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/Problem16_label09_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 13:04:39,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 13:04:39,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 13:04:39,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 13:04:39,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 13:04:39,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 13:04:39,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 13:04:39,656 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 13:04:39,657 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 13:04:39,658 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 13:04:39,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 13:04:39,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 13:04:39,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 13:04:39,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 13:04:39,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 13:04:39,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 13:04:39,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 13:04:39,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 13:04:39,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 13:04:39,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 13:04:39,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 13:04:39,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 13:04:39,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 13:04:39,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 13:04:39,676 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 13:04:39,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 13:04:39,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 13:04:39,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 13:04:39,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 13:04:39,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 13:04:39,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 13:04:39,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 13:04:39,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 13:04:39,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 13:04:39,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 13:04:39,688 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 13:04:39,688 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 13:04:39,719 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 13:04:39,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 13:04:39,720 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 13:04:39,720 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 13:04:39,720 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 13:04:39,723 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 13:04:39,723 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 13:04:39,723 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 13:04:39,724 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 13:04:39,724 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 13:04:39,724 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 13:04:39,724 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 13:04:39,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 13:04:39,725 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 13:04:39,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 13:04:39,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 13:04:39,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 13:04:39,727 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 13:04:39,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 13:04:39,727 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 13:04:39,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 13:04:39,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 13:04:39,728 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 13:04:39,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 13:04:39,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 13:04:39,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 13:04:39,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 13:04:39,729 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 13:04:39,729 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 13:04:39,729 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 13:04:39,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 13:04:39,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 13:04:39,730 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 13:04:39,730 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 13:04:39,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 13:04:39,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 13:04:39,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 13:04:39,796 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 13:04:39,796 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 13:04:39,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label09_true-unreach-call.c [2018-09-19 13:04:40,136 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06100ff99/ee9252dc12c44692ae9bfa906004ce3e/FLAG8fdf42931 [2018-09-19 13:04:40,564 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 13:04:40,565 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label09_true-unreach-call.c [2018-09-19 13:04:40,597 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06100ff99/ee9252dc12c44692ae9bfa906004ce3e/FLAG8fdf42931 [2018-09-19 13:04:40,618 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06100ff99/ee9252dc12c44692ae9bfa906004ce3e [2018-09-19 13:04:40,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 13:04:40,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 13:04:40,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 13:04:40,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 13:04:40,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 13:04:40,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:04:40" (1/1) ... [2018-09-19 13:04:40,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c1f22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:40, skipping insertion in model container [2018-09-19 13:04:40,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:04:40" (1/1) ... [2018-09-19 13:04:40,665 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 13:04:41,346 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 13:04:41,367 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 13:04:41,623 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 13:04:41,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41 WrapperNode [2018-09-19 13:04:41,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 13:04:41,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 13:04:41,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 13:04:41,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 13:04:41,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:41,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:41,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 13:04:41,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 13:04:41,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 13:04:41,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 13:04:42,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:42,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:42,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:42,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:42,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:42,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:42,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (1/1) ... [2018-09-19 13:04:42,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 13:04:42,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 13:04:42,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 13:04:42,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 13:04:42,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (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 13:04:42,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 13:04:42,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 13:04:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 13:04:42,505 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 13:04:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 13:04:42,505 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 13:04:42,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 13:04:42,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 13:04:42,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 13:04:42,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 13:04:48,332 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 13:04:48,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:04:48 BoogieIcfgContainer [2018-09-19 13:04:48,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 13:04:48,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 13:04:48,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 13:04:48,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 13:04:48,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 01:04:40" (1/3) ... [2018-09-19 13:04:48,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cd1530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:04:48, skipping insertion in model container [2018-09-19 13:04:48,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:04:41" (2/3) ... [2018-09-19 13:04:48,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cd1530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:04:48, skipping insertion in model container [2018-09-19 13:04:48,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:04:48" (3/3) ... [2018-09-19 13:04:48,342 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label09_true-unreach-call.c [2018-09-19 13:04:48,352 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 13:04:48,360 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 13:04:48,420 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 13:04:48,421 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 13:04:48,421 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 13:04:48,421 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 13:04:48,421 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 13:04:48,421 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 13:04:48,421 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 13:04:48,422 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 13:04:48,422 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 13:04:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-19 13:04:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-19 13:04:48,471 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:04:48,472 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, 1, 1] [2018-09-19 13:04:48,473 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:04:48,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1905211356, now seen corresponding path program 1 times [2018-09-19 13:04:48,482 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:04:48,483 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-09-19 13:04:48,485 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [1556], [1560], [1566], [1570], [1579], [1580], [1581], [1583] [2018-09-19 13:04:48,523 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:04:48,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:04:48,783 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:04:48,785 INFO L272 AbstractInterpreter]: Visited 53 different actions 53 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 13:04:48,822 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:04:49,074 INFO L232 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 80.18% of their original sizes. [2018-09-19 13:04:49,075 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:04:49,339 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:04:49,341 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:04:49,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 13:04:49,341 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:04:49,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 13:04:49,354 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 13:04:49,355 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 13:04:49,358 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 6 states. [2018-09-19 13:04:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:04:56,495 INFO L93 Difference]: Finished difference Result 1158 states and 2145 transitions. [2018-09-19 13:04:56,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 13:04:56,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-09-19 13:04:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:04:56,519 INFO L225 Difference]: With dead ends: 1158 [2018-09-19 13:04:56,520 INFO L226 Difference]: Without dead ends: 746 [2018-09-19 13:04:56,530 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 49 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 13:04:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-09-19 13:04:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-09-19 13:04:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-19 13:04:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1075 transitions. [2018-09-19 13:04:56,637 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1075 transitions. Word has length 54 [2018-09-19 13:04:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:04:56,637 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1075 transitions. [2018-09-19 13:04:56,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 13:04:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1075 transitions. [2018-09-19 13:04:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-19 13:04:56,645 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:04:56,645 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, 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] [2018-09-19 13:04:56,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:04:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1863704390, now seen corresponding path program 1 times [2018-09-19 13:04:56,646 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:04:56,647 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-19 13:04:56,647 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:04:56,653 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:04:56,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:04:56,775 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:04:56,937 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:04:56,937 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 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 13:04:56,978 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:04:57,207 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 78.37% of their original sizes. [2018-09-19 13:04:57,207 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:04:57,935 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:04:57,936 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:04:57,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:04:57,936 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:04:57,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:04:57,939 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:04:57,939 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:04:57,941 INFO L87 Difference]: Start difference. First operand 744 states and 1075 transitions. Second operand 10 states. [2018-09-19 13:05:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:05:06,926 INFO L93 Difference]: Finished difference Result 1505 states and 2490 transitions. [2018-09-19 13:05:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 13:05:06,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-09-19 13:05:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:05:06,934 INFO L225 Difference]: With dead ends: 1505 [2018-09-19 13:05:06,934 INFO L226 Difference]: Without dead ends: 1105 [2018-09-19 13:05:06,937 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 137 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 13:05:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-09-19 13:05:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1094. [2018-09-19 13:05:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-19 13:05:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1441 transitions. [2018-09-19 13:05:06,977 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1441 transitions. Word has length 146 [2018-09-19 13:05:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:05:06,978 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1441 transitions. [2018-09-19 13:05:06,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:05:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1441 transitions. [2018-09-19 13:05:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-19 13:05:06,982 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:05:06,983 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, 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] [2018-09-19 13:05:06,983 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:05:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 336527934, now seen corresponding path program 1 times [2018-09-19 13:05:06,984 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:05:06,984 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-09-19 13:05:06,984 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [904], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:05:06,990 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:05:06,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:05:07,102 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:05:07,301 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:05:07,302 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 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 13:05:07,346 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:05:07,596 INFO L232 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 78.15% of their original sizes. [2018-09-19 13:05:07,597 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:05:07,882 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:05:07,882 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:05:07,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:05:07,883 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:05:07,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:05:07,884 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:05:07,884 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:05:07,884 INFO L87 Difference]: Start difference. First operand 1094 states and 1441 transitions. Second operand 10 states. [2018-09-19 13:05:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:05:22,189 INFO L93 Difference]: Finished difference Result 2209 states and 3230 transitions. [2018-09-19 13:05:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 13:05:22,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2018-09-19 13:05:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:05:22,204 INFO L225 Difference]: With dead ends: 2209 [2018-09-19 13:05:22,205 INFO L226 Difference]: Without dead ends: 1459 [2018-09-19 13:05:22,208 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 13:05:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2018-09-19 13:05:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1444. [2018-09-19 13:05:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-09-19 13:05:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1808 transitions. [2018-09-19 13:05:22,265 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1808 transitions. Word has length 182 [2018-09-19 13:05:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:05:22,266 INFO L480 AbstractCegarLoop]: Abstraction has 1444 states and 1808 transitions. [2018-09-19 13:05:22,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:05:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1808 transitions. [2018-09-19 13:05:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-19 13:05:22,277 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:05:22,278 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:22,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:05:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1716552798, now seen corresponding path program 1 times [2018-09-19 13:05:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:05:22,281 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-09-19 13:05:22,282 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:05:22,299 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:05:22,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:05:22,828 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:05:22,828 INFO L272 AbstractInterpreter]: Visited 247 different actions 488 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 13:05:22,867 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:05:23,238 INFO L232 lantSequenceWeakener]: Weakened 291 states. On average, predicates are now at 77.81% of their original sizes. [2018-09-19 13:05:23,238 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:05:23,923 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:05:23,923 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:05:23,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:05:23,926 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:05:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:05:23,927 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:05:23,927 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:05:23,928 INFO L87 Difference]: Start difference. First operand 1444 states and 1808 transitions. Second operand 10 states. [2018-09-19 13:05:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:05:30,408 INFO L93 Difference]: Finished difference Result 2887 states and 3942 transitions. [2018-09-19 13:05:30,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 13:05:30,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 294 [2018-09-19 13:05:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:05:30,420 INFO L225 Difference]: With dead ends: 2887 [2018-09-19 13:05:30,420 INFO L226 Difference]: Without dead ends: 1787 [2018-09-19 13:05:30,423 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 300 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 13:05:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-09-19 13:05:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1784. [2018-09-19 13:05:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-09-19 13:05:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2165 transitions. [2018-09-19 13:05:30,540 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2165 transitions. Word has length 294 [2018-09-19 13:05:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:05:30,541 INFO L480 AbstractCegarLoop]: Abstraction has 1784 states and 2165 transitions. [2018-09-19 13:05:30,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:05:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2165 transitions. [2018-09-19 13:05:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-19 13:05:30,547 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:05:30,548 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:30,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:05:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1572006194, now seen corresponding path program 1 times [2018-09-19 13:05:30,548 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:05:30,549 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2018-09-19 13:05:30,549 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:05:30,555 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:05:30,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:05:30,970 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:05:30,970 INFO L272 AbstractInterpreter]: Visited 255 different actions 752 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 13:05:31,006 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:05:31,308 INFO L232 lantSequenceWeakener]: Weakened 299 states. On average, predicates are now at 77.8% of their original sizes. [2018-09-19 13:05:31,308 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:05:31,628 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:05:31,628 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:05:31,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:05:31,628 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:05:31,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:05:31,629 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:05:31,629 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:05:31,630 INFO L87 Difference]: Start difference. First operand 1784 states and 2165 transitions. Second operand 10 states. [2018-09-19 13:05:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:05:38,413 INFO L93 Difference]: Finished difference Result 3232 states and 4306 transitions. [2018-09-19 13:05:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 13:05:38,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 302 [2018-09-19 13:05:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:05:38,428 INFO L225 Difference]: With dead ends: 3232 [2018-09-19 13:05:38,428 INFO L226 Difference]: Without dead ends: 2132 [2018-09-19 13:05:38,432 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 308 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 13:05:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-09-19 13:05:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2126. [2018-09-19 13:05:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2018-09-19 13:05:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2526 transitions. [2018-09-19 13:05:38,602 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2526 transitions. Word has length 302 [2018-09-19 13:05:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:05:38,603 INFO L480 AbstractCegarLoop]: Abstraction has 2126 states and 2526 transitions. [2018-09-19 13:05:38,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:05:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2526 transitions. [2018-09-19 13:05:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-09-19 13:05:38,612 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:05:38,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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:38,613 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:05:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 609476480, now seen corresponding path program 1 times [2018-09-19 13:05:38,614 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:05:38,614 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 387 with the following transitions: [2018-09-19 13:05:38,615 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:05:38,620 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:05:38,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:05:38,667 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:05:39,190 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:05:39,191 INFO L272 AbstractInterpreter]: Visited 248 different actions 982 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 13:05:39,220 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:05:39,648 INFO L232 lantSequenceWeakener]: Weakened 383 states. On average, predicates are now at 77.71% of their original sizes. [2018-09-19 13:05:39,648 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:05:40,420 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:05:40,421 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:05:40,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:05:40,421 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:05:40,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:05:40,422 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:05:40,422 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:05:40,423 INFO L87 Difference]: Start difference. First operand 2126 states and 2526 transitions. Second operand 10 states. [2018-09-19 13:05:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:05:47,879 INFO L93 Difference]: Finished difference Result 3939 states and 5048 transitions. [2018-09-19 13:05:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 13:05:47,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 386 [2018-09-19 13:05:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:05:47,891 INFO L225 Difference]: With dead ends: 3939 [2018-09-19 13:05:47,891 INFO L226 Difference]: Without dead ends: 2497 [2018-09-19 13:05:47,896 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 393 GetRequests, 377 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 13:05:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2018-09-19 13:05:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2485. [2018-09-19 13:05:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2018-09-19 13:05:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 2914 transitions. [2018-09-19 13:05:47,954 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 2914 transitions. Word has length 386 [2018-09-19 13:05:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:05:47,955 INFO L480 AbstractCegarLoop]: Abstraction has 2485 states and 2914 transitions. [2018-09-19 13:05:47,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:05:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 2914 transitions. [2018-09-19 13:05:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-09-19 13:05:47,965 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:05:47,965 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:47,965 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:05:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1095134149, now seen corresponding path program 1 times [2018-09-19 13:05:47,966 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:05:47,966 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 404 with the following transitions: [2018-09-19 13:05:47,967 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [796], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:05:47,971 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:05:47,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:05:48,324 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:05:48,646 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:05:48,646 INFO L272 AbstractInterpreter]: Visited 256 different actions 1012 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 13:05:48,683 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:05:49,076 INFO L232 lantSequenceWeakener]: Weakened 400 states. On average, predicates are now at 77.69% of their original sizes. [2018-09-19 13:05:49,077 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:05:49,195 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:05:49,195 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:05:49,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:05:49,196 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:05:49,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:05:49,196 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:05:49,197 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:05:49,197 INFO L87 Difference]: Start difference. First operand 2485 states and 2914 transitions. Second operand 10 states. [2018-09-19 13:05:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:05:55,525 INFO L93 Difference]: Finished difference Result 4985 states and 6192 transitions. [2018-09-19 13:05:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 13:05:55,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 403 [2018-09-19 13:05:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:05:55,545 INFO L225 Difference]: With dead ends: 4985 [2018-09-19 13:05:55,546 INFO L226 Difference]: Without dead ends: 3184 [2018-09-19 13:05:55,552 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 410 GetRequests, 394 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 13:05:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2018-09-19 13:05:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 3167. [2018-09-19 13:05:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3167 states. [2018-09-19 13:05:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 3649 transitions. [2018-09-19 13:05:55,763 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 3649 transitions. Word has length 403 [2018-09-19 13:05:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:05:55,764 INFO L480 AbstractCegarLoop]: Abstraction has 3167 states and 3649 transitions. [2018-09-19 13:05:55,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:05:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 3649 transitions. [2018-09-19 13:05:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-09-19 13:05:55,771 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:05:55,772 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, 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, 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, 1] [2018-09-19 13:05:55,772 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:05:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash 103691404, now seen corresponding path program 1 times [2018-09-19 13:05:55,772 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:05:55,773 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 461 with the following transitions: [2018-09-19 13:05:55,773 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1024], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:05:55,777 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:05:55,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:05:56,024 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:05:56,249 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:05:56,249 INFO L272 AbstractInterpreter]: Visited 256 different actions 760 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 13:05:56,257 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:05:56,681 INFO L232 lantSequenceWeakener]: Weakened 457 states. On average, predicates are now at 77.64% of their original sizes. [2018-09-19 13:05:56,681 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:05:56,819 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:05:56,819 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:05:56,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:05:56,819 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:05:56,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:05:56,820 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:05:56,820 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:05:56,821 INFO L87 Difference]: Start difference. First operand 3167 states and 3649 transitions. Second operand 10 states. [2018-09-19 13:06:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:06:01,899 INFO L93 Difference]: Finished difference Result 6348 states and 7666 transitions. [2018-09-19 13:06:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 13:06:01,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 460 [2018-09-19 13:06:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:06:01,916 INFO L225 Difference]: With dead ends: 6348 [2018-09-19 13:06:01,916 INFO L226 Difference]: Without dead ends: 3865 [2018-09-19 13:06:01,923 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 467 GetRequests, 451 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 13:06:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2018-09-19 13:06:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3855. [2018-09-19 13:06:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3855 states. [2018-09-19 13:06:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 4413 transitions. [2018-09-19 13:06:02,011 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 4413 transitions. Word has length 460 [2018-09-19 13:06:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:06:02,012 INFO L480 AbstractCegarLoop]: Abstraction has 3855 states and 4413 transitions. [2018-09-19 13:06:02,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:06:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 4413 transitions. [2018-09-19 13:06:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-09-19 13:06:02,020 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:06:02,020 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, 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, 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, 1, 1, 1, 1, 1, 1, 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 13:06:02,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:06:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash 7776648, now seen corresponding path program 1 times [2018-09-19 13:06:02,021 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:06:02,021 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 479 with the following transitions: [2018-09-19 13:06:02,022 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1128], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:06:02,026 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:06:02,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:06:02,379 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:06:02,541 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:06:02,541 INFO L272 AbstractInterpreter]: Visited 248 different actions 735 times. Merged at 7 different actions 13 times. Never widened. Found 3 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 13:06:02,545 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:06:03,006 INFO L232 lantSequenceWeakener]: Weakened 475 states. On average, predicates are now at 77.62% of their original sizes. [2018-09-19 13:06:03,007 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:06:03,125 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:06:03,125 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:06:03,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:06:03,125 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:06:03,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:06:03,126 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:06:03,126 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:06:03,126 INFO L87 Difference]: Start difference. First operand 3855 states and 4413 transitions. Second operand 10 states. [2018-09-19 13:06:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:06:10,872 INFO L93 Difference]: Finished difference Result 8103 states and 9609 transitions. [2018-09-19 13:06:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 13:06:10,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 478 [2018-09-19 13:06:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:06:10,899 INFO L225 Difference]: With dead ends: 8103 [2018-09-19 13:06:10,899 INFO L226 Difference]: Without dead ends: 4932 [2018-09-19 13:06:10,908 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 485 GetRequests, 469 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 13:06:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4932 states. [2018-09-19 13:06:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4932 to 4906. [2018-09-19 13:06:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4906 states. [2018-09-19 13:06:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 5546 transitions. [2018-09-19 13:06:11,019 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 5546 transitions. Word has length 478 [2018-09-19 13:06:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:06:11,020 INFO L480 AbstractCegarLoop]: Abstraction has 4906 states and 5546 transitions. [2018-09-19 13:06:11,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:06:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 5546 transitions. [2018-09-19 13:06:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-09-19 13:06:11,029 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:06:11,029 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, 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, 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, 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] [2018-09-19 13:06:11,030 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:06:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1221247928, now seen corresponding path program 1 times [2018-09-19 13:06:11,030 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:06:11,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 519 with the following transitions: [2018-09-19 13:06:11,031 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1288], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:06:11,035 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:06:11,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:06:11,279 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:06:11,802 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:06:11,803 INFO L272 AbstractInterpreter]: Visited 248 different actions 1468 times. Merged at 7 different actions 35 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 13:06:11,819 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:06:12,242 INFO L232 lantSequenceWeakener]: Weakened 515 states. On average, predicates are now at 77.6% of their original sizes. [2018-09-19 13:06:12,242 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:06:12,357 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:06:12,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:06:12,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:06:12,358 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:06:12,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:06:12,358 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:06:12,359 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:06:12,359 INFO L87 Difference]: Start difference. First operand 4906 states and 5546 transitions. Second operand 10 states. [2018-09-19 13:06:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:06:17,123 INFO L93 Difference]: Finished difference Result 9816 states and 11463 transitions. [2018-09-19 13:06:17,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 13:06:17,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 518 [2018-09-19 13:06:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:06:17,145 INFO L225 Difference]: With dead ends: 9816 [2018-09-19 13:06:17,146 INFO L226 Difference]: Without dead ends: 5594 [2018-09-19 13:06:17,155 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 524 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 13:06:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2018-09-19 13:06:17,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5587. [2018-09-19 13:06:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5587 states. [2018-09-19 13:06:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 6293 transitions. [2018-09-19 13:06:17,252 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 6293 transitions. Word has length 518 [2018-09-19 13:06:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:06:17,253 INFO L480 AbstractCegarLoop]: Abstraction has 5587 states and 6293 transitions. [2018-09-19 13:06:17,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:06:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 6293 transitions. [2018-09-19 13:06:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-09-19 13:06:17,262 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:06:17,263 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, 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, 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, 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] [2018-09-19 13:06:17,263 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:06:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash 333612500, now seen corresponding path program 1 times [2018-09-19 13:06:17,264 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:06:17,264 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 521 with the following transitions: [2018-09-19 13:06:17,264 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1296], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:06:17,269 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:06:17,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:06:17,514 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:06:17,761 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:06:17,761 INFO L272 AbstractInterpreter]: Visited 248 different actions 979 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 13:06:17,773 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:06:18,387 INFO L232 lantSequenceWeakener]: Weakened 517 states. On average, predicates are now at 77.59% of their original sizes. [2018-09-19 13:06:18,387 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:06:18,477 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:06:18,477 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:06:18,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:06:18,477 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:06:18,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:06:18,478 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:06:18,478 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:06:18,478 INFO L87 Difference]: Start difference. First operand 5587 states and 6293 transitions. Second operand 10 states. [2018-09-19 13:06:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:06:25,376 INFO L93 Difference]: Finished difference Result 10851 states and 12610 transitions. [2018-09-19 13:06:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 13:06:25,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 520 [2018-09-19 13:06:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:06:25,399 INFO L225 Difference]: With dead ends: 10851 [2018-09-19 13:06:25,400 INFO L226 Difference]: Without dead ends: 6629 [2018-09-19 13:06:25,409 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 527 GetRequests, 511 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 13:06:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6629 states. [2018-09-19 13:06:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6629 to 6613. [2018-09-19 13:06:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6613 states. [2018-09-19 13:06:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 7457 transitions. [2018-09-19 13:06:25,512 INFO L78 Accepts]: Start accepts. Automaton has 6613 states and 7457 transitions. Word has length 520 [2018-09-19 13:06:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:06:25,513 INFO L480 AbstractCegarLoop]: Abstraction has 6613 states and 7457 transitions. [2018-09-19 13:06:25,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:06:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6613 states and 7457 transitions. [2018-09-19 13:06:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-09-19 13:06:25,524 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:06:25,524 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:25,524 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:06:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1351464231, now seen corresponding path program 1 times [2018-09-19 13:06:25,525 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:06:25,525 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 528 with the following transitions: [2018-09-19 13:06:25,526 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [796], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [888], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 13:06:25,530 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:06:25,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:06:25,727 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:06:26,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 13:06:26,214 INFO L272 AbstractInterpreter]: Visited 258 different actions 1277 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 13:06:26,252 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 13:06:26,336 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 13:06:26,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 01:06:26 BoogieIcfgContainer [2018-09-19 13:06:26,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 13:06:26,340 INFO L168 Benchmark]: Toolchain (without parser) took 105706.87 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -156.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-19 13:06:26,344 INFO L168 Benchmark]: CDTParser took 0.20 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 13:06:26,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1097.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-19 13:06:26,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 197.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 13:06:26,346 INFO L168 Benchmark]: Boogie Preprocessor took 483.04 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 846.7 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -985.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. [2018-09-19 13:06:26,349 INFO L168 Benchmark]: RCFGBuilder took 5914.11 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 240.5 MB). Peak memory consumption was 240.5 MB. Max. memory is 7.1 GB. [2018-09-19 13:06:26,351 INFO L168 Benchmark]: TraceAbstraction took 98004.99 ms. Allocated memory was 2.4 GB in the beginning and 3.3 GB in the end (delta: 923.8 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 461.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-19 13:06:26,358 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.20 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 1097.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 197.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 483.04 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 846.7 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -985.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5914.11 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 240.5 MB). Peak memory consumption was 240.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98004.99 ms. Allocated memory was 2.4 GB in the beginning and 3.3 GB in the end (delta: 923.8 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 461.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 148]: 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: [L8] int inputB = 2; [L9] int inputE = 5; [L10] int inputD = 4; [L11] int inputF = 6; [L12] int inputC = 3; [L13] int inputA = 1; [L16] int a15 = 3; [L17] int a18 = -87; [L18] int a16 = 11; [L19] int a12 = 5; [L1770] int output = -1; [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND FALSE !(((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5))) [L338] COND FALSE !(((a16==9) && ((((input == 3) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9)))) [L345] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) && (a12==8)) || (( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8)))) && (input == 3)) && (a15==3)) && (a16==12))) [L350] COND FALSE !(((a16==11) && (((a12==8) && ((input == 1) && (a15==3))) && a18 <= -156 ))) [L356] COND FALSE !((((((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 4)) && (a15==3)) && (a16==12))) [L361] COND FALSE !((((a15==4) && (((input == 3) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (a12==7))) && (a16==8))) [L367] COND FALSE !(((a16==8) && ((( ((-79 < a18) && (134 >= a18)) && (input == 3)) && (a12==9)) && (a15==4)))) [L373] COND FALSE !(((a16==8) && ((a12==6) && ((a15==4) && ((input == 2) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L380] COND FALSE !((((a16==12) && (((( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )) && (input == 1))) && (a15==3))) [L386] COND FALSE !(((a15==3) && (((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11)) && (a12==5)))) [L391] COND FALSE !(((a15==4) && ((a12==8) && ((a16==9) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L398] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && (((a16==8) && ((a15==4) && (input == 1))) && (a12==9)))) [L404] COND FALSE !(((a16==9) && (((input == 3) && ((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7)))) && (a15==4)))) [L411] COND FALSE !((((input == 1) && (((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9))) || (( a18 <= -156 && (a16==12)) && (a12==5)))) && (a15==3))) [L417] COND FALSE !(((a15==4) && ((a12==6) && ((a16==8) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L424] COND FALSE !(((a15==3) && ((a16==12) && ((a12==5) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L427] COND FALSE !((((a16==10) && (((input == 2) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))) && (a12==5))) [L434] COND FALSE !(((a16==11) && ((a15==3) && (((a12==8) && (input == 5)) && a18 <= -156 )))) [L440] COND FALSE !((((a16==8) && (((input == 4) && (a15==4)) && (a12==5))) && a18 <= -156 )) [L443] COND FALSE !(((a16==8) && (((((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9)))) && (input == 3)) && (a15==4)))) [L449] COND FALSE !((((((a12==5) && (input == 6)) && (a16==12)) && 134 < a18 ) && (a15==3))) [L454] COND FALSE !(((a15==4) && ((a16==9) && ((a12==6) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L457] COND FALSE !((((a15==3) && ((a16==11) && ((input == 3) && (a12==8)))) && a18 <= -156 )) [L463] COND FALSE !(((a15==3) && (( ((-79 < a18) && (134 >= a18)) && ((a16==12) && (input == 2))) && (a12==7)))) [L469] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)) && (a16==12)) && (a15==3)) && (a12==9))) [L476] COND FALSE !(((a12==9) && ((((input == 6) && a18 <= -156 ) && (a16==9)) && (a15==4)))) [L483] COND FALSE !(((a12==6) && ((a15==4) && (( 134 < a18 && (input == 3)) && (a16==10))))) [L489] COND FALSE !(((((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 2)) && (a12==6)) && (a16==12)) && (a15==3))) [L495] COND FALSE !(((a12==8) && ((((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==11)) && (a15==3)))) [L501] COND FALSE !(((a16==10) && ((a15==4) && ((a12==5) && ((input == 3) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )))))) [L508] COND FALSE !(((a15==4) && ((a16==9) && ((input == 2) && (((a12==5) && 134 < a18 ) || ( a18 <= -156 && (a12==6))))))) [L515] COND FALSE !(((((( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))) && (input == 5)) && (a15==3)) && (a16==12))) [L521] COND FALSE !(((a16==11) && ((a15==3) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (( 134 < a18 && (a12==6)) || ( a18 <= -156 && (a12==7)))) && (input == 3))))) [L527] COND FALSE !(((a15==4) && ((((input == 4) && a18 <= -156 ) && (a12==9)) && (a16==9)))) [L533] COND FALSE !(((a15==4) && (((a12==5) && ((input == 5) && a18 <= -156 )) && (a16==8)))) [L538] COND FALSE !((((((input == 2) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4)) && (a16==10))) [L543] COND FALSE !((((a15==3) && ((a12==5) && ((input == 6) && (a16==11)))) && ((-156 < a18) && (-79 >= a18)) )) [L548] COND FALSE !((((a15==4) && ((a16==9) && ((input == 6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a12==8))) [L554] COND FALSE !(((a16==11) && ((a15==3) && ((input == 3) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 ))))))) [L560] COND FALSE !(((((a12==6) && ((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ) && (input == 1))) && (a15==4)) && (a16==10))) [L567] COND FALSE !(((a15==4) && (((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) && (input == 6)) && (a12==7)) && (a16==8)))) [L573] COND FALSE !(((a12==6) && ((a15==3) && (((input == 6) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a16==12))))) [L578] COND FALSE !((((a15==4) && ( ((-79 < a18) && (134 >= a18)) && ((input == 5) && (a12==9)))) && (a16==8))) [L584] COND FALSE !(((a16==8) && ((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 3)) && (a12==5)) && (a15==4)))) [L589] COND FALSE !(((a16==12) && ((a12==5) && ((a15==3) && ((input == 6) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L594] COND FALSE !((((a12==7) && ((a15==4) && ((input == 4) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )))) && (a16==8))) [L600] COND FALSE !(((((input == 4) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))))) && (a16==8)) && (a15==4))) [L606] COND FALSE !((((a12==5) && ( ((-156 < a18) && (-79 >= a18)) && ((a15==4) && (input == 6)))) && (a16==10))) [L612] COND FALSE !(((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (((input == 3) && (a12==8)) && (a16==8))))) [L618] COND FALSE !((((a15==4) && ((input == 3) && (((a12==8) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==7)) || ((a12==8) && a18 <= -156 ))))) && (a16==8))) [L624] COND FALSE !(((a15==4) && ((a16==9) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 ))) && (input == 4))))) [L631] COND FALSE !(((a16==8) && (( a18 <= -156 && ((input == 5) && (a15==4))) && (a12==6)))) [L636] COND FALSE !(((a16==8) && (((( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 6)) && (a15==4)) && (a12==5)))) [L641] COND FALSE !(((( ((-79 < a18) && (134 >= a18)) && ((input == 4) && (a15==3))) && (a16==12)) && (a12==8))) [L648] COND FALSE !(((((((a12==9) && ((a16==9) && ((-79 < a18) && (134 >= a18)) )) || ((a12==9) && ((a16==9) && 134 < a18 ))) || ((a12==5) && ((a16==10) && a18 <= -156 ))) && (input == 6)) && (a15==4))) [L655] COND FALSE !(((a12==9) && ((a15==4) && (((input == 4) && (a16==8)) && ((-79 < a18) && (134 >= a18)) )))) [L661] COND FALSE !(((((a16==12) && ((a15==3) && (input == 6))) && (a12==9)) && 134 < a18 )) [L664] COND FALSE !(((a12==7) && ((a15==4) && (( ((-79 < a18) && (134 >= a18)) && (input == 1)) && (a16==8))))) [L670] COND FALSE !(((a15==4) && ((((input == 5) && 134 < a18 ) && (a16==10)) && (a12==6)))) [L677] COND FALSE !((((a15==3) && (((input == 2) && (a12==9)) && 134 < a18 )) && (a16==12))) [L680] COND FALSE !(((((( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 )) && (input == 3)) && (a15==3)) && (a16==12))) [L686] COND FALSE !((((((a16==11) && (input == 2)) && (a15==3)) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) )) [L691] COND FALSE !(((a12==5) && ((a16==12) && (((input == 3) && (a15==3)) && 134 < a18 )))) [L696] COND FALSE !((((a15==4) && ((a12==6) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==8))) [L703] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 5)) && (a15==3)) && (a12==5)) && (a16==12))) [L706] COND FALSE !((((a12==9) && (((a15==3) && (input == 4)) && 134 < a18 )) && (a16==12))) [L712] COND FALSE !(((a15==3) && ((a16==11) && ((a12==5) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 1)))))) [L717] COND FALSE !(((a15==4) && ((((a12==9) && (input == 3)) && a18 <= -156 ) && (a16==9)))) [L723] COND FALSE !(((a12==5) && ((a15==4) && (((input == 1) && (a16==10)) && ((-156 < a18) && (-79 >= a18)) )))) [L728] COND FALSE !(((((a16==9) && ((input == 2) && (a15==4))) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L734] COND FALSE !((((a12==5) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 2)) && (a16==9))) && (a15==4))) [L741] COND FALSE !(((a15==3) && ((a16==11) && (((((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7))) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7))) && (input == 6))))) [L746] COND FALSE !((((a12==8) && ((a16==11) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)))) && (a15==3))) [L752] COND FALSE !(((a16==12) && (( 134 < a18 && ((a12==9) && (input == 3))) && (a15==3)))) [L758] COND FALSE !(((((a12==8) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4))) && (a15==4)) && (a16==9))) [L763] COND FALSE !(((((((a16==12) && a18 <= -156 ) && (a12==5)) || (((a12==9) && ((a16==11) && ((-79 < a18) && (134 >= a18)) )) || ((a12==9) && ((a16==11) && 134 < a18 )))) && (input == 5)) && (a15==3))) [L769] COND FALSE !(((a16==12) && (((a15==3) && ((input == 3) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a12==9)))) [L775] COND FALSE !((((((input == 4) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==12)) && (a12==5)) && (a15==3))) [L778] COND FALSE !(((a15==3) && (((( a18 <= -156 && (a16==12)) && (a12==5)) || ((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9)))) && (input == 2)))) [L784] COND FALSE !((((a12==6) && ((a15==4) && (( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 5)))) && (a16==10))) [L789] COND FALSE !(((a15==4) && ((a16==9) && (((input == 5) && a18 <= -156 ) && (a12==9))))) [L796] COND FALSE !(((a15==3) && ((a12==9) && ((a16==12) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 4)))))) [L802] COND FALSE !((((((input == 2) && a18 <= -156 ) && (a16==9)) && (a15==4)) && (a12==9))) [L808] COND FALSE !((((((a12==9) && ((a16==8) && 134 < a18 )) || (( a18 <= -156 && (a16==9)) && (a12==5))) && (input == 4)) && (a15==4))) [L815] COND FALSE !(((a12==5) && ((a16==10) && (((input == 6) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))))) [L822] COND FALSE !(((((input == 6) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))))) && (a16==8)) && (a15==4))) [L828] COND FALSE !(((a15==3) && (((a12==8) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==11)))) [L834] COND FALSE !(((a16==12) && ((a15==3) && (((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 2))))) [L840] COND FALSE !(((a15==3) && ((((((a12==8) && 134 < a18 ) || ((a12==9) && a18 <= -156 )) || ((a12==9) && ((-156 < a18) && (-79 >= a18)) )) && (input == 6)) && (a16==11)))) [L846] COND FALSE !(((((a16==8) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 1))) && (a15==4)) && (a12==5))) [L851] COND FALSE !(((a12==8) && ((a16==11) && ((a15==3) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L857] COND FALSE !(((((input == 1) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 )))) && (a15==3)) && (a16==11))) [L863] COND FALSE !((((((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ) && (input == 1)) && (a12==6)) && (a15==3)) && (a16==11))) [L869] COND FALSE !(((((a12==8) && ((input == 2) && (a16==8))) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L875] COND FALSE !(((a15==4) && ((((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7))) && (input == 5)) && (a16==9)))) [L882] COND FALSE !((((((input == 4) && (a15==3)) && a18 <= -156 ) && (a12==8)) && (a16==11))) [L888] COND FALSE !((((a16==11) && (((a15==3) && (input == 2)) && a18 <= -156 )) && (a12==8))) [L894] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && ((a15==4) && (((a16==8) && (input == 4)) && (a12==7))))) [L899] COND FALSE !(((a16==12) && ((((input == 1) && ((-79 < a18) && (134 >= a18)) ) && (a15==3)) && (a12==8)))) [L905] COND FALSE !((((a15==4) && ((((a12==5) && 134 < a18 ) || ((a12==6) && a18 <= -156 )) && (input == 3))) && (a16==9))) [L912] COND FALSE !(((((a16==12) && ( 134 < a18 && (input == 4))) && (a15==3)) && (a12==5))) [L917] COND FALSE !(( ((-156 < a18) && (-79 >= a18)) && ((a15==3) && ((a12==5) && ((a16==11) && (input == 3)))))) [L922] COND FALSE !((((a15==4) && ((((a12==5) && 134 < a18 ) || ((a12==6) && a18 <= -156 )) && (input == 1))) && (a16==9))) [L929] COND FALSE !(((a15==3) && ((a16==12) && ((input == 4) && (((a12==8) && 134 < a18 ) || ((a12==9) && a18 <= -156 )))))) [L935] COND FALSE !(((a16==12) && ( ((-156 < a18) && (-79 >= a18)) && (((a12==7) && (input == 1)) && (a15==3))))) [L942] COND FALSE !(((( ((-79 < a18) && (134 >= a18)) && ((a12==7) && (input == 2))) && (a16==8)) && (a15==4))) [L948] COND FALSE !((((a12==7) && ( ((-79 < a18) && (134 >= a18)) && ((a15==4) && (input == 6)))) && (a16==8))) [L954] COND FALSE !(((a16==10) && ((((input == 4) && (a12==5)) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ))) [L961] COND FALSE !((((a16==12) && ((( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 )) && (input == 1))) && (a15==3))) [L967] COND FALSE !(((a12==5) && (((a16==10) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 4))) && (a15==4)))) [L974] COND FALSE !(((a16==12) && (((((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7))) && (input == 5)) && (a15==3)))) [L979] COND FALSE !((((a16==9) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)) && (a12==6))) && (a15==4))) [L986] COND FALSE !(((a16==9) && ((a15==4) && ((input == 3) && (( a18 <= -156 && (a12==8)) || (( ((-79 < a18) && (134 >= a18)) && (a12==7)) || ( 134 < a18 && (a12==7)))))))) [L993] COND FALSE !(((a15==4) && (((input == 5) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) ))) && (a16==8)))) [L999] COND FALSE !(((a16==9) && (((a15==4) && ((input == 1) && a18 <= -156 )) && (a12==9)))) [L1005] COND FALSE !(((a12==6) && ((a16==9) && ((a15==4) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)))))) [L1011] COND FALSE !(((a15==4) && ((a16==10) && (((input == 4) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a12==6))))) [L1018] COND FALSE !(((((input == 5) && (((a12==8) && a18 <= -156 ) || (( ((-79 < a18) && (134 >= a18)) && (a12==7)) || ( 134 < a18 && (a12==7))))) && (a15==4)) && (a16==9))) [L1025] COND FALSE !(((a16==12) && ( ((-79 < a18) && (134 >= a18)) && (((input == 2) && (a15==3)) && (a12==8))))) [L1031] COND FALSE !(((a15==3) && (((a12==5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 2))) && (a16==12)))) [L1036] COND FALSE !((((a12==7) && ((a15==3) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 2)))) && (a16==11))) [L1042] COND FALSE !(((a12==6) && ((a15==3) && ((a16==12) && (( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 1)))))) [L1048] COND FALSE !((((a15==4) && ((input == 6) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 ))))) && (a16==9))) [L1055] COND FALSE !((((a15==3) && ((a16==12) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))) && (a12==9))) [L1061] COND FALSE !(((a15==4) && (((( a18 <= -156 && (a16==10)) && (a12==5)) || ((((a16==9) && ((-79 < a18) && (134 >= a18)) ) && (a12==9)) || (( 134 < a18 && (a16==9)) && (a12==9)))) && (input == 4)))) [L1067] COND FALSE !(((a15==3) && ((((a16==12) && (input == 1)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ))) [L1073] COND FALSE !(((a15==4) && (((a16==9) && ((input == 4) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a12==5)))) [L1079] COND FALSE !(((a15==4) && ((input == 3) && ((((a16==10) && a18 <= -156 ) && (a12==5)) || (((a12==9) && ( ((-79 < a18) && (134 >= a18)) && (a16==9))) || ((a12==9) && ((a16==9) && 134 < a18 ))))))) [L1086] COND FALSE !((((a15==3) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 1)) && (a12==7))) && (a16==11))) [L1092] COND FALSE !((((a12==5) && ( 134 < a18 && ((a16==12) && (input == 2)))) && (a15==3))) [L1097] COND FALSE !((((input == 1) && ((((a16==8) && 134 < a18 ) && (a12==9)) || (((a16==9) && a18 <= -156 ) && (a12==5)))) && (a15==4))) [L1103] COND FALSE !(((a12==6) && (((a15==3) && ((input == 5) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ))) && (a16==12)))) [L1109] COND FALSE !((((a12==6) && ((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 5)) && (a16==11))) && (a15==3))) [L1114] COND FALSE !(((a16==12) && ((a15==3) && (( ((-79 < a18) && (134 >= a18)) && (input == 5)) && (a12==8))))) [L1120] COND FALSE !(((a12==6) && ((a16==11) && ((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 6)) && (a15==3))))) [L1125] COND FALSE !(((a12==8) && ((a15==3) && ( ((-79 < a18) && (134 >= a18)) && ((input == 3) && (a16==12)))))) [L1131] COND FALSE !((((a15==4) && (((input == 6) && (a16==8)) && (a12==9))) && ((-79 < a18) && (134 >= a18)) )) [L1137] COND FALSE !((((a16==9) && ((a12==5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)))) && (a15==4))) [L1143] COND FALSE !(((a15==4) && (((a12==6) && ((input == 3) && (a16==8))) && a18 <= -156 ))) [L1149] COND FALSE !(((a16==8) && ((a15==4) && ((a12==6) && ((input == 6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L1155] COND FALSE !((((a16==9) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 2)) && (a15==4))) && (a12==8))) [L1160] COND FALSE !(((a12==5) && (((a16==9) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6))) && (a15==4)))) [L1166] COND FALSE !((((( a18 <= -156 && (input == 4)) && (a15==4)) && (a12==6)) && (a16==8))) [L1172] COND FALSE !(((a12==6) && (((a16==10) && ((input == 4) && 134 < a18 )) && (a15==4)))) [L1175] COND FALSE !((((a15==3) && ((input == 6) && (( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 )))) && (a16==12))) [L1181] COND FALSE !(((((a15==4) && ((input == 1) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ))) && (a12==7)) && (a16==8))) [L1187] COND FALSE !(((a15==3) && ((a16==11) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7)))) && (input == 4))))) [L1193] COND FALSE !((((input == 5) && ((((a12==9) && ( ((-79 < a18) && (134 >= a18)) && (a16==9))) || (((a16==9) && 134 < a18 ) && (a12==9))) || (( a18 <= -156 && (a16==10)) && (a12==5)))) && (a15==4))) [L1200] COND FALSE !(((a12==5) && ((a16==11) && (((input == 1) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) )))) [L1205] COND FALSE !(((a16==8) && (((input == 1) && ((( 134 < a18 && (a12==7)) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8)))) && (a15==4)))) [L1211] COND FALSE !(((a16==9) && ((((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a15==4)) && (a12==6)))) [L1214] COND FALSE !(((a16==11) && ((a15==3) && (((input == 3) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a12==6))))) [L1220] COND FALSE !(((a15==4) && ((input == 5) && (((a12==9) && ((a16==8) && 134 < a18 )) || (((a16==9) && a18 <= -156 ) && (a12==5)))))) [L1227] COND FALSE !(((a15==4) && ((input == 2) && ((( 134 < a18 && (a16==8)) && (a12==9)) || ((a12==5) && ((a16==9) && a18 <= -156 )))))) [L1234] COND FALSE !(((((a12==6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 1))) && (a16==9)) && (a15==4))) [L1241] COND FALSE !(((a15==3) && (((input == 4) && (( 134 < a18 && (a12==6)) || ( a18 <= -156 && (a12==7)))) && (a16==12)))) [L1247] COND TRUE ( ((-156 < a18) && (-79 >= a18)) && (((a12==5) && ((input == 4) && (a15==3))) && (a16==11))) [L1248] a18 = ((((a18 - -196) - -3) - 306144) + 306115) [L1249] RET return 21; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND FALSE !(((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5))) [L338] COND FALSE !(((a16==9) && ((((input == 3) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9)))) [L345] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) && (a12==8)) || (( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8)))) && (input == 3)) && (a15==3)) && (a16==12))) [L350] COND FALSE !(((a16==11) && (((a12==8) && ((input == 1) && (a15==3))) && a18 <= -156 ))) [L356] COND FALSE !((((((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 4)) && (a15==3)) && (a16==12))) [L361] COND FALSE !((((a15==4) && (((input == 3) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (a12==7))) && (a16==8))) [L367] COND FALSE !(((a16==8) && ((( ((-79 < a18) && (134 >= a18)) && (input == 3)) && (a12==9)) && (a15==4)))) [L373] COND FALSE !(((a16==8) && ((a12==6) && ((a15==4) && ((input == 2) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L380] COND FALSE !((((a16==12) && (((( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )) && (input == 1))) && (a15==3))) [L386] COND TRUE ((a15==3) && (((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11)) && (a12==5))) [L387] a18 = ((((a18 % 38)- 116) - 2) - -1) [L388] a12 = 7 [L390] RET return 22; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND FALSE !(((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5))) [L338] COND FALSE !(((a16==9) && ((((input == 3) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9)))) [L345] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) && (a12==8)) || (( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8)))) && (input == 3)) && (a15==3)) && (a16==12))) [L350] COND FALSE !(((a16==11) && (((a12==8) && ((input == 1) && (a15==3))) && a18 <= -156 ))) [L356] COND FALSE !((((((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 4)) && (a15==3)) && (a16==12))) [L361] COND FALSE !((((a15==4) && (((input == 3) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (a12==7))) && (a16==8))) [L367] COND FALSE !(((a16==8) && ((( ((-79 < a18) && (134 >= a18)) && (input == 3)) && (a12==9)) && (a15==4)))) [L373] COND FALSE !(((a16==8) && ((a12==6) && ((a15==4) && ((input == 2) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L380] COND FALSE !((((a16==12) && (((( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )) && (input == 1))) && (a15==3))) [L386] COND FALSE !(((a15==3) && (((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11)) && (a12==5)))) [L391] COND FALSE !(((a15==4) && ((a12==8) && ((a16==9) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L398] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && (((a16==8) && ((a15==4) && (input == 1))) && (a12==9)))) [L404] COND FALSE !(((a16==9) && (((input == 3) && ((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7)))) && (a15==4)))) [L411] COND FALSE !((((input == 1) && (((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9))) || (( a18 <= -156 && (a16==12)) && (a12==5)))) && (a15==3))) [L417] COND FALSE !(((a15==4) && ((a12==6) && ((a16==8) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L424] COND FALSE !(((a15==3) && ((a16==12) && ((a12==5) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L427] COND FALSE !((((a16==10) && (((input == 2) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))) && (a12==5))) [L434] COND FALSE !(((a16==11) && ((a15==3) && (((a12==8) && (input == 5)) && a18 <= -156 )))) [L440] COND FALSE !((((a16==8) && (((input == 4) && (a15==4)) && (a12==5))) && a18 <= -156 )) [L443] COND FALSE !(((a16==8) && (((((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9)))) && (input == 3)) && (a15==4)))) [L449] COND FALSE !((((((a12==5) && (input == 6)) && (a16==12)) && 134 < a18 ) && (a15==3))) [L454] COND FALSE !(((a15==4) && ((a16==9) && ((a12==6) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L457] COND FALSE !((((a15==3) && ((a16==11) && ((input == 3) && (a12==8)))) && a18 <= -156 )) [L463] COND FALSE !(((a15==3) && (( ((-79 < a18) && (134 >= a18)) && ((a16==12) && (input == 2))) && (a12==7)))) [L469] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)) && (a16==12)) && (a15==3)) && (a12==9))) [L476] COND FALSE !(((a12==9) && ((((input == 6) && a18 <= -156 ) && (a16==9)) && (a15==4)))) [L483] COND FALSE !(((a12==6) && ((a15==4) && (( 134 < a18 && (input == 3)) && (a16==10))))) [L489] COND FALSE !(((((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 2)) && (a12==6)) && (a16==12)) && (a15==3))) [L495] COND FALSE !(((a12==8) && ((((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==11)) && (a15==3)))) [L501] COND FALSE !(((a16==10) && ((a15==4) && ((a12==5) && ((input == 3) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )))))) [L508] COND FALSE !(((a15==4) && ((a16==9) && ((input == 2) && (((a12==5) && 134 < a18 ) || ( a18 <= -156 && (a12==6))))))) [L515] COND FALSE !(((((( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))) && (input == 5)) && (a15==3)) && (a16==12))) [L521] COND TRUE ((a16==11) && ((a15==3) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (( 134 < a18 && (a12==6)) || ( a18 <= -156 && (a12==7)))) && (input == 3)))) [L522] a18 = ((((a18 % 299922)+ -300077) + -1) + -1) [L523] a16 = 8 [L524] a12 = 5 [L526] RET return -1; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND TRUE ((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7)) [L148] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. UNKNOWN Result, 97.9s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 82.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4358 SDtfs, 13546 SDslu, 4200 SDs, 0 SdLazy, 45357 SolverSat, 3923 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 70.8s Time, PredicateUnifierStatistics: 22 DeclaredPredicates, 3808 GetRequests, 3648 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6613occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.4s AbstIntTime, 12 AbstIntIterations, 11 AbstIntStrong, 0.9982670743907281 AbsIntWeakeningRatio, 0.0669882100750268 AbsIntAvgWeakeningVarsNumRemoved, 22.205251875669884 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 125 StatesRemovedByMinimization, 11 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/Problem16_label09_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_13-06-26-377.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label09_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_13-06-26-377.csv Received shutdown request...