java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label07_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:39:06,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:39:06,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:39:06,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:39:06,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:39:06,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:39:06,597 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:39:06,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:39:06,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:39:06,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:39:06,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:39:06,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:39:06,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:39:06,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:39:06,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:39:06,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:39:06,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:39:06,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:39:06,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:39:06,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:39:06,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:39:06,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:39:06,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:39:06,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:39:06,633 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:39:06,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:39:06,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:39:06,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:39:06,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:39:06,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:39:06,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:39:06,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:39:06,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:39:06,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:39:06,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:39:06,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:39:06,647 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:39:06,675 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:39:06,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:39:06,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:39:06,678 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:39:06,678 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:39:06,678 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:39:06,678 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:39:06,678 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:39:06,679 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:39:06,679 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:39:06,679 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:39:06,679 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:39:06,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:39:06,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:39:06,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:39:06,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:39:06,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:39:06,683 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:39:06,683 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:39:06,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:39:06,684 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:39:06,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:39:06,684 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:39:06,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:39:06,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:39:06,685 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:39:06,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:39:06,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:39:06,685 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:39:06,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:39:06,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:39:06,686 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:39:06,686 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:39:06,686 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:39:06,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:39:06,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:39:06,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:39:06,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:39:06,774 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:39:06,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label07_true-unreach-call.c [2018-09-19 12:39:07,138 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24b6405c/9c84021cf6b846788e2bd92459998c6a/FLAG89198f622 [2018-09-19 12:39:07,421 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:39:07,422 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label07_true-unreach-call.c [2018-09-19 12:39:07,444 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24b6405c/9c84021cf6b846788e2bd92459998c6a/FLAG89198f622 [2018-09-19 12:39:07,466 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24b6405c/9c84021cf6b846788e2bd92459998c6a [2018-09-19 12:39:07,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:39:07,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:39:07,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:39:07,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:39:07,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:39:07,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:39:07" (1/1) ... [2018-09-19 12:39:07,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c844d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:07, skipping insertion in model container [2018-09-19 12:39:07,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:39:07" (1/1) ... [2018-09-19 12:39:07,507 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:39:08,003 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:39:08,027 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:39:08,138 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:39:08,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08 WrapperNode [2018-09-19 12:39:08,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:39:08,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:39:08,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:39:08,195 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:39:08,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:39:08,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:39:08,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:39:08,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:39:08,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... [2018-09-19 12:39:08,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:39:08,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:39:08,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:39:08,590 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:39:08,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:39:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:39:08,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:39:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:39:08,659 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:39:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:39:08,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:39:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:39:08,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:39:12,276 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:39:12,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:39:12 BoogieIcfgContainer [2018-09-19 12:39:12,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:39:12,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:39:12,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:39:12,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:39:12,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:39:07" (1/3) ... [2018-09-19 12:39:12,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf17ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:39:12, skipping insertion in model container [2018-09-19 12:39:12,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:08" (2/3) ... [2018-09-19 12:39:12,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf17ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:39:12, skipping insertion in model container [2018-09-19 12:39:12,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:39:12" (3/3) ... [2018-09-19 12:39:12,293 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label07_true-unreach-call.c [2018-09-19 12:39:12,306 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:39:12,318 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:39:12,387 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:39:12,388 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:39:12,388 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:39:12,389 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:39:12,389 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:39:12,389 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:39:12,389 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:39:12,389 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:39:12,390 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:39:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:39:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-19 12:39:12,432 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:12,434 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:12,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash 154949884, now seen corresponding path program 1 times [2018-09-19 12:39:12,444 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:12,445 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-09-19 12:39:12,448 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:39:12,492 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:12,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:12,845 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:12,849 INFO L272 AbstractInterpreter]: Visited 51 different actions 51 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:39:12,876 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:13,142 INFO L232 lantSequenceWeakener]: Weakened 49 states. On average, predicates are now at 75.21% of their original sizes. [2018-09-19 12:39:13,142 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:13,357 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:13,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:13,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:39:13,359 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:13,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:39:13,372 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:39:13,373 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:39:13,376 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:39:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:16,078 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:39:16,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:39:16,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-09-19 12:39:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:16,102 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:39:16,103 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:39:16,115 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:39:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:39:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:39:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:39:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:39:16,195 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 52 [2018-09-19 12:39:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:16,196 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:39:16,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:39:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:39:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-19 12:39:16,203 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:16,203 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:16,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash -169844341, now seen corresponding path program 1 times [2018-09-19 12:39:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:16,205 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-09-19 12:39:16,205 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:16,210 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:16,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:16,330 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:16,458 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:16,458 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:16,479 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:16,743 INFO L232 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 73.82% of their original sizes. [2018-09-19 12:39:16,744 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:17,117 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:17,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:17,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:17,118 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:17,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:17,120 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:17,120 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:17,121 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:39:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:20,200 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:39:20,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:20,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2018-09-19 12:39:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:20,211 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:39:20,212 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:39:20,215 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:39:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:39:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:39:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:39:20,254 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 123 [2018-09-19 12:39:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:20,255 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:39:20,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:39:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-19 12:39:20,259 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:20,261 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:20,262 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:20,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1818097840, now seen corresponding path program 1 times [2018-09-19 12:39:20,262 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:20,263 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2018-09-19 12:39:20,263 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:20,271 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:20,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:20,403 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:20,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:20,548 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:20,585 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:20,762 INFO L232 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 73.74% of their original sizes. [2018-09-19 12:39:20,763 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:20,987 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:20,988 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:20,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:20,988 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:20,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:20,989 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:20,989 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:20,989 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:39:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:24,987 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:39:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:24,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-09-19 12:39:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:25,012 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:39:25,013 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:39:25,016 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:39:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:39:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:39:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:39:25,075 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 132 [2018-09-19 12:39:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:25,076 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:39:25,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:39:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-19 12:39:25,081 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:25,081 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:25,082 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash -561825848, now seen corresponding path program 1 times [2018-09-19 12:39:25,082 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:25,082 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2018-09-19 12:39:25,083 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:25,087 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:25,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:25,234 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:25,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:25,490 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:25,529 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:25,799 INFO L232 lantSequenceWeakener]: Weakened 165 states. On average, predicates are now at 73.52% of their original sizes. [2018-09-19 12:39:25,799 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:26,045 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:26,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:26,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:26,046 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:26,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:26,048 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:26,049 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:26,049 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:39:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:30,778 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:39:30,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:30,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 168 [2018-09-19 12:39:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:30,786 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:39:30,786 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:39:30,789 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:39:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:39:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:39:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:39:30,821 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 168 [2018-09-19 12:39:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:30,822 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:39:30,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:39:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-19 12:39:30,826 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:30,826 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:30,826 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1864910091, now seen corresponding path program 1 times [2018-09-19 12:39:30,827 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:30,827 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-09-19 12:39:30,828 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:30,832 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:30,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:31,065 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:31,066 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:31,110 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:31,317 INFO L232 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 12:39:31,317 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:31,633 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:31,634 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:31,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:31,634 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:31,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:31,635 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:31,635 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:31,635 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:39:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:34,048 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:39:34,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:34,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2018-09-19 12:39:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:34,057 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:39:34,057 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:39:34,060 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:39:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:39:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:39:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:39:34,103 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 187 [2018-09-19 12:39:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:34,104 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:39:34,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:39:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-19 12:39:34,108 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:34,109 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:34,109 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1829551783, now seen corresponding path program 1 times [2018-09-19 12:39:34,110 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:34,110 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-19 12:39:34,110 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:34,113 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:34,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:34,172 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:34,341 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:34,341 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:34,383 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:34,658 INFO L232 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 12:39:34,658 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:34,969 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:34,970 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:34,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:34,970 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:34,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:34,971 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:34,971 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:34,971 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:39:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:37,523 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:39:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:37,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-09-19 12:39:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:37,545 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:39:37,545 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:39:37,549 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:39:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:39:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:39:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:39:37,608 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 199 [2018-09-19 12:39:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:37,609 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:39:37,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:39:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-19 12:39:37,613 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:37,613 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:37,614 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1501091027, now seen corresponding path program 1 times [2018-09-19 12:39:37,614 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:37,614 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-09-19 12:39:37,615 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:37,618 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:37,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:37,680 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:37,787 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:37,787 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:37,824 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:38,042 INFO L232 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 73.42% of their original sizes. [2018-09-19 12:39:38,043 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:38,250 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:38,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:38,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:38,250 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:38,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:38,251 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:38,251 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:38,252 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:39:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:42,203 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:39:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:42,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2018-09-19 12:39:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:42,214 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:39:42,214 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:39:42,217 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:39:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:39:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:39:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:39:42,275 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 205 [2018-09-19 12:39:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:42,276 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:39:42,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:39:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-19 12:39:42,281 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:42,281 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:42,281 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1244866232, now seen corresponding path program 1 times [2018-09-19 12:39:42,282 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:42,282 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-19 12:39:42,282 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:42,284 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:42,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:42,335 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:42,470 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:42,470 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:42,504 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:42,724 INFO L232 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-19 12:39:42,724 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:42,886 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:42,886 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:42,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:42,886 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:42,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:42,887 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:42,887 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:42,888 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:39:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:45,273 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:39:45,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:45,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-09-19 12:39:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:45,292 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:39:45,292 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:39:45,297 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:39:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:39:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:39:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:39:45,361 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 210 [2018-09-19 12:39:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:45,361 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:39:45,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:39:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-19 12:39:45,366 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:45,367 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:45,367 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1459783168, now seen corresponding path program 1 times [2018-09-19 12:39:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:45,368 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-09-19 12:39:45,368 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:45,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:45,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:45,415 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:45,590 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:45,590 INFO L272 AbstractInterpreter]: Visited 90 different actions 434 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:45,624 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:45,849 INFO L232 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 73.39% of their original sizes. [2018-09-19 12:39:45,849 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:45,980 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:45,981 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:45,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:45,981 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:45,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:45,982 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:45,982 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:45,982 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:39:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:48,436 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:39:48,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:48,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2018-09-19 12:39:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:48,453 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:39:48,453 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:39:48,461 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:39:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:39:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:39:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:39:48,614 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 214 [2018-09-19 12:39:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:48,615 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:39:48,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:39:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 12:39:48,622 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:48,622 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:48,623 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1582624532, now seen corresponding path program 1 times [2018-09-19 12:39:48,623 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:48,623 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 12:39:48,624 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:48,626 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:48,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:48,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:53,863 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:53,863 INFO L272 AbstractInterpreter]: Visited 96 different actions 464 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:53,869 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:55,328 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 12:39:55,328 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:55,435 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:55,435 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:55,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:55,435 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:55,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:55,436 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:55,436 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:55,437 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:39:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:58,652 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:39:58,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:58,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2018-09-19 12:39:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:58,675 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:39:58,675 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:39:58,684 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:39:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:39:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:39:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:39:58,795 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 220 [2018-09-19 12:39:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:58,795 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:39:58,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:39:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-19 12:39:58,803 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:58,804 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:58,804 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1421250167, now seen corresponding path program 1 times [2018-09-19 12:39:58,805 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:58,805 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-09-19 12:39:58,805 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:58,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:58,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:58,857 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:59,127 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:59,128 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:59,166 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:59,381 INFO L232 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 73.33% of their original sizes. [2018-09-19 12:39:59,381 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:59,546 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:59,547 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:59,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:59,547 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:59,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:59,548 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:59,548 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:59,548 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:40:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:02,677 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:40:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:02,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 235 [2018-09-19 12:40:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:02,696 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:40:02,696 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:40:02,706 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:40:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:40:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:40:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:40:02,813 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 235 [2018-09-19 12:40:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:02,814 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:40:02,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:40:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-19 12:40:02,821 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:02,822 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:02,822 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash -681415845, now seen corresponding path program 1 times [2018-09-19 12:40:02,822 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:02,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-09-19 12:40:02,823 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:02,825 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:02,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:02,898 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:03,083 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:03,083 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:40:03,093 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:03,312 INFO L232 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-19 12:40:03,313 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:03,517 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:03,517 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:03,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:03,518 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:03,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:03,518 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:03,518 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:03,519 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:40:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:05,498 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:40:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:05,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 241 [2018-09-19 12:40:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:05,525 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:40:05,525 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:40:05,537 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:40:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:40:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:40:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:40:05,757 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 241 [2018-09-19 12:40:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:05,758 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:40:05,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:40:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-19 12:40:05,766 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:05,767 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:05,767 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1748607224, now seen corresponding path program 1 times [2018-09-19 12:40:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:05,768 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-09-19 12:40:05,768 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:05,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:05,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:05,815 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:06,093 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:06,094 INFO L272 AbstractInterpreter]: Visited 118 different actions 574 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:06,126 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:06,374 INFO L232 lantSequenceWeakener]: Weakened 239 states. On average, predicates are now at 73.31% of their original sizes. [2018-09-19 12:40:06,374 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:06,838 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:06,838 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:06,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:06,838 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:06,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:06,841 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:06,841 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:06,841 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:40:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:09,725 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:40:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:09,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 242 [2018-09-19 12:40:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:09,744 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:40:09,744 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:40:09,757 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 249 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:40:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:40:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:40:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:40:09,892 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 242 [2018-09-19 12:40:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:09,892 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:40:09,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:40:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-19 12:40:09,907 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:09,907 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:09,907 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:09,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1782047944, now seen corresponding path program 1 times [2018-09-19 12:40:09,908 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:09,908 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 275 with the following transitions: [2018-09-19 12:40:09,908 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:09,911 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:09,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:09,954 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:10,238 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:10,239 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:40:10,275 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:10,566 INFO L232 lantSequenceWeakener]: Weakened 271 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 12:40:10,567 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:10,724 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:10,724 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:10,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:10,724 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:10,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:10,725 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:10,725 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:10,725 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:40:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:14,470 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:40:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:14,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 274 [2018-09-19 12:40:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:14,498 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:40:14,499 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:40:14,513 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 281 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:40:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:40:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:40:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:40:14,829 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 274 [2018-09-19 12:40:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:14,830 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:40:14,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:40:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-19 12:40:14,846 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:14,846 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:14,846 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash 794982875, now seen corresponding path program 1 times [2018-09-19 12:40:14,847 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:14,847 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-09-19 12:40:14,847 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:14,849 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:14,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:14,896 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:15,090 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:15,090 INFO L272 AbstractInterpreter]: Visited 89 different actions 438 times. Merged at 8 different actions 37 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:15,127 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:15,404 INFO L232 lantSequenceWeakener]: Weakened 280 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 12:40:15,404 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:16,167 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:16,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:16,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:16,168 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:16,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:16,168 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:16,168 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:16,168 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:40:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:19,876 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:40:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:19,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2018-09-19 12:40:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:19,915 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:40:19,916 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:40:19,934 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 290 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:40:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:40:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:40:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:40:20,132 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 283 [2018-09-19 12:40:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:20,133 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:40:20,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:40:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-19 12:40:20,151 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:20,151 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:20,152 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1284792907, now seen corresponding path program 1 times [2018-09-19 12:40:20,152 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:20,152 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-09-19 12:40:20,153 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:20,155 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:20,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:20,197 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:20,377 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:20,377 INFO L272 AbstractInterpreter]: Visited 90 different actions 440 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:20,413 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:20,710 INFO L232 lantSequenceWeakener]: Weakened 288 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 12:40:20,711 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:21,515 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:21,516 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:21,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:21,516 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:21,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:21,517 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:21,517 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:21,517 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:40:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:24,492 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:40:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:40:24,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 291 [2018-09-19 12:40:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:24,527 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:40:24,528 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:40:24,543 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 298 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:40:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:40:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:40:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:40:24,743 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 291 [2018-09-19 12:40:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:24,744 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:40:24,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:40:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-09-19 12:40:24,764 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:24,765 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:24,765 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:24,765 INFO L82 PathProgramCache]: Analyzing trace with hash 911247759, now seen corresponding path program 1 times [2018-09-19 12:40:24,765 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:24,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2018-09-19 12:40:24,766 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:24,768 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:24,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:24,817 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:30,144 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:30,144 INFO L272 AbstractInterpreter]: Visited 97 different actions 573 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:30,153 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:32,166 INFO L232 lantSequenceWeakener]: Weakened 290 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 12:40:32,167 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:32,255 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:32,255 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:32,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:32,255 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:32,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:32,256 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:32,256 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:32,256 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:40:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:36,302 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:40:36,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:36,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 293 [2018-09-19 12:40:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:36,337 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:40:36,338 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:40:36,354 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 300 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:40:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:40:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:40:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:40:36,593 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 293 [2018-09-19 12:40:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:36,594 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:40:36,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:40:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-19 12:40:36,618 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:36,618 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:36,618 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:36,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1566611492, now seen corresponding path program 1 times [2018-09-19 12:40:36,619 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:36,619 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 301 with the following transitions: [2018-09-19 12:40:36,619 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:36,621 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:36,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:36,665 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:36,846 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:36,846 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:36,858 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:37,124 INFO L232 lantSequenceWeakener]: Weakened 297 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 12:40:37,124 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:37,283 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:37,283 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:37,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:37,283 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:37,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:37,284 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:37,284 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:37,284 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:40:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:40,753 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:40:40,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:40,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 300 [2018-09-19 12:40:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:40,785 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:40:40,785 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:40:40,803 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:40:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:40:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:40:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:40:41,023 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 300 [2018-09-19 12:40:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:41,023 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:40:41,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:40:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-19 12:40:41,042 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:41,042 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:41,043 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2055434011, now seen corresponding path program 1 times [2018-09-19 12:40:41,043 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:41,043 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-09-19 12:40:41,043 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:41,045 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:41,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:41,082 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:47,569 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:47,570 INFO L272 AbstractInterpreter]: Visited 97 different actions 568 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:47,575 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:49,285 INFO L232 lantSequenceWeakener]: Weakened 300 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 12:40:49,285 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:49,389 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:49,389 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:49,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:49,389 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:49,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:49,390 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:49,390 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:49,390 INFO L87 Difference]: Start difference. First operand 15014 states and 19527 transitions. Second operand 10 states. [2018-09-19 12:40:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:52,782 INFO L93 Difference]: Finished difference Result 31248 states and 40901 transitions. [2018-09-19 12:40:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:52,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 303 [2018-09-19 12:40:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:52,823 INFO L225 Difference]: With dead ends: 31248 [2018-09-19 12:40:52,823 INFO L226 Difference]: Without dead ends: 16384 [2018-09-19 12:40:52,841 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 310 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2018-09-19 12:40:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 16100. [2018-09-19 12:40:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2018-09-19 12:40:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 21070 transitions. [2018-09-19 12:40:53,280 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 21070 transitions. Word has length 303 [2018-09-19 12:40:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:53,281 INFO L480 AbstractCegarLoop]: Abstraction has 16100 states and 21070 transitions. [2018-09-19 12:40:53,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 21070 transitions. [2018-09-19 12:40:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-09-19 12:40:53,299 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:53,299 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:53,299 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:53,300 INFO L82 PathProgramCache]: Analyzing trace with hash 664807763, now seen corresponding path program 1 times [2018-09-19 12:40:53,300 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:53,300 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2018-09-19 12:40:53,300 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:53,302 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:53,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:53,343 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:59,670 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:59,670 INFO L272 AbstractInterpreter]: Visited 97 different actions 664 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:59,678 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:01,548 INFO L232 lantSequenceWeakener]: Weakened 304 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 12:41:01,548 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:01,642 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:01,642 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:01,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:01,642 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:01,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:01,643 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:01,643 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:01,643 INFO L87 Difference]: Start difference. First operand 16100 states and 21070 transitions. Second operand 10 states. [2018-09-19 12:41:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:05,089 INFO L93 Difference]: Finished difference Result 33283 states and 43657 transitions. [2018-09-19 12:41:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:05,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 307 [2018-09-19 12:41:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:05,124 INFO L225 Difference]: With dead ends: 33283 [2018-09-19 12:41:05,124 INFO L226 Difference]: Without dead ends: 17333 [2018-09-19 12:41:05,145 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 314 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-09-19 12:41:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17020. [2018-09-19 12:41:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-09-19 12:41:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 22326 transitions. [2018-09-19 12:41:05,411 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 22326 transitions. Word has length 307 [2018-09-19 12:41:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:05,412 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 22326 transitions. [2018-09-19 12:41:05,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 22326 transitions. [2018-09-19 12:41:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-19 12:41:05,431 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:05,431 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:05,431 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1379966144, now seen corresponding path program 1 times [2018-09-19 12:41:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:05,432 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 311 with the following transitions: [2018-09-19 12:41:05,433 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:05,436 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:05,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:05,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:05,734 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:05,735 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:05,744 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:06,019 INFO L232 lantSequenceWeakener]: Weakened 307 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 12:41:06,019 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:06,112 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:06,112 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:06,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:06,112 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:06,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:06,113 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:06,113 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:06,113 INFO L87 Difference]: Start difference. First operand 17020 states and 22326 transitions. Second operand 10 states. [2018-09-19 12:41:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:09,426 INFO L93 Difference]: Finished difference Result 35215 states and 46290 transitions. [2018-09-19 12:41:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:09,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 310 [2018-09-19 12:41:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:09,455 INFO L225 Difference]: With dead ends: 35215 [2018-09-19 12:41:09,455 INFO L226 Difference]: Without dead ends: 18345 [2018-09-19 12:41:09,473 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 317 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18345 states. [2018-09-19 12:41:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18345 to 17954. [2018-09-19 12:41:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2018-09-19 12:41:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 23579 transitions. [2018-09-19 12:41:09,727 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 23579 transitions. Word has length 310 [2018-09-19 12:41:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:09,728 INFO L480 AbstractCegarLoop]: Abstraction has 17954 states and 23579 transitions. [2018-09-19 12:41:09,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 23579 transitions. [2018-09-19 12:41:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-19 12:41:09,738 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:09,738 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:09,738 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1135701019, now seen corresponding path program 1 times [2018-09-19 12:41:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:09,739 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-09-19 12:41:09,739 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:09,741 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:09,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:09,781 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:10,034 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:10,034 INFO L272 AbstractInterpreter]: Visited 119 different actions 704 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:10,044 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:10,268 INFO L232 lantSequenceWeakener]: Weakened 312 states. On average, predicates are now at 73.21% of their original sizes. [2018-09-19 12:41:10,269 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:10,357 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:10,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:10,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:10,358 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:10,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:10,358 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:10,359 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:10,359 INFO L87 Difference]: Start difference. First operand 17954 states and 23579 transitions. Second operand 10 states. [2018-09-19 12:41:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:13,965 INFO L93 Difference]: Finished difference Result 37767 states and 49724 transitions. [2018-09-19 12:41:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:13,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 315 [2018-09-19 12:41:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:13,998 INFO L225 Difference]: With dead ends: 37767 [2018-09-19 12:41:13,999 INFO L226 Difference]: Without dead ends: 19963 [2018-09-19 12:41:14,016 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 322 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2018-09-19 12:41:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19520. [2018-09-19 12:41:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19520 states. [2018-09-19 12:41:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 25686 transitions. [2018-09-19 12:41:14,298 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 25686 transitions. Word has length 315 [2018-09-19 12:41:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:14,298 INFO L480 AbstractCegarLoop]: Abstraction has 19520 states and 25686 transitions. [2018-09-19 12:41:14,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 25686 transitions. [2018-09-19 12:41:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-09-19 12:41:14,310 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:14,310 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:14,311 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 617326303, now seen corresponding path program 1 times [2018-09-19 12:41:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:14,311 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 330 with the following transitions: [2018-09-19 12:41:14,311 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:14,313 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:14,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:14,363 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:14,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:14,651 INFO L272 AbstractInterpreter]: Visited 119 different actions 819 times. Merged at 8 different actions 52 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:14,658 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:14,903 INFO L232 lantSequenceWeakener]: Weakened 326 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 12:41:14,903 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:15,035 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:15,036 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:15,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:15,036 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:15,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:15,037 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:15,037 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:15,037 INFO L87 Difference]: Start difference. First operand 19520 states and 25686 transitions. Second operand 10 states. [2018-09-19 12:41:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:18,186 INFO L93 Difference]: Finished difference Result 40792 states and 53797 transitions. [2018-09-19 12:41:18,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:18,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 329 [2018-09-19 12:41:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:18,225 INFO L225 Difference]: With dead ends: 40792 [2018-09-19 12:41:18,225 INFO L226 Difference]: Without dead ends: 21422 [2018-09-19 12:41:18,245 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2018-09-19 12:41:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 21074. [2018-09-19 12:41:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21074 states. [2018-09-19 12:41:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 27733 transitions. [2018-09-19 12:41:18,756 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 27733 transitions. Word has length 329 [2018-09-19 12:41:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:18,756 INFO L480 AbstractCegarLoop]: Abstraction has 21074 states and 27733 transitions. [2018-09-19 12:41:18,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 27733 transitions. [2018-09-19 12:41:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-19 12:41:18,771 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:18,772 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:18,772 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1281048884, now seen corresponding path program 1 times [2018-09-19 12:41:18,772 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:18,773 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 331 with the following transitions: [2018-09-19 12:41:18,773 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:18,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:18,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:18,822 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:19,164 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:19,164 INFO L272 AbstractInterpreter]: Visited 129 different actions 635 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:19,182 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:19,450 INFO L232 lantSequenceWeakener]: Weakened 327 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 12:41:19,450 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:19,541 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:19,541 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:19,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:19,542 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:19,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:19,542 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:19,543 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:19,543 INFO L87 Difference]: Start difference. First operand 21074 states and 27733 transitions. Second operand 10 states. [2018-09-19 12:41:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:22,003 INFO L93 Difference]: Finished difference Result 45130 states and 60382 transitions. [2018-09-19 12:41:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:22,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 330 [2018-09-19 12:41:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:22,054 INFO L225 Difference]: With dead ends: 45130 [2018-09-19 12:41:22,054 INFO L226 Difference]: Without dead ends: 24206 [2018-09-19 12:41:22,079 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 337 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24206 states. [2018-09-19 12:41:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24206 to 23793. [2018-09-19 12:41:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23793 states. [2018-09-19 12:41:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23793 states to 23793 states and 31366 transitions. [2018-09-19 12:41:22,378 INFO L78 Accepts]: Start accepts. Automaton has 23793 states and 31366 transitions. Word has length 330 [2018-09-19 12:41:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:22,378 INFO L480 AbstractCegarLoop]: Abstraction has 23793 states and 31366 transitions. [2018-09-19 12:41:22,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23793 states and 31366 transitions. [2018-09-19 12:41:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-09-19 12:41:22,397 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:22,397 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:22,397 INFO L423 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1444199381, now seen corresponding path program 1 times [2018-09-19 12:41:22,398 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:22,398 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-09-19 12:41:22,398 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [317], [319], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [718], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:22,400 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:22,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:22,441 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:22,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:41:22,770 INFO L272 AbstractInterpreter]: Visited 136 different actions 666 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:22,809 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:41:22,881 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:41:22,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:41:22 BoogieIcfgContainer [2018-09-19 12:41:22,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:41:22,883 INFO L168 Benchmark]: Toolchain (without parser) took 135401.89 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -871.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-19 12:41:22,888 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:41:22,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:22,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:22,890 INFO L168 Benchmark]: Boogie Preprocessor took 253.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -862.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:22,891 INFO L168 Benchmark]: RCFGBuilder took 3687.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:22,896 INFO L168 Benchmark]: TraceAbstraction took 130602.96 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -158.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-19 12:41:22,903 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 710.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 139.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 253.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -862.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3687.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130602.96 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -158.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 139]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L222] a19 = 10 [L224] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND TRUE (((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L139] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 130.4s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 77.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4088 SDtfs, 17709 SDslu, 9165 SDs, 0 SdLazy, 49167 SolverSat, 4819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.9s Time, PredicateUnifierStatistics: 48 DeclaredPredicates, 5920 GetRequests, 5551 SyntacticMatches, 0 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23793occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.1s AbstIntTime, 25 AbstIntIterations, 24 AbstIntStrong, 0.9967755859071501 AbsIntWeakeningRatio, 0.11186617877679038 AbsIntAvgWeakeningVarsNumRemoved, 21.66422721728524 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 3663 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label07_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-41-22-933.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label07_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-41-22-933.csv Received shutdown request...