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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label03_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 11:17:31,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 11:17:31,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 11:17:31,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 11:17:31,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 11:17:31,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 11:17:31,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 11:17:31,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 11:17:31,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 11:17:31,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 11:17:31,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 11:17:31,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 11:17:31,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 11:17:31,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 11:17:31,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 11:17:31,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 11:17:31,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 11:17:31,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 11:17:31,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 11:17:31,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 11:17:31,670 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 11:17:31,671 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 11:17:31,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 11:17:31,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 11:17:31,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 11:17:31,675 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 11:17:31,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 11:17:31,677 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 11:17:31,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 11:17:31,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 11:17:31,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 11:17:31,680 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 11:17:31,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 11:17:31,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 11:17:31,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 11:17:31,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 11:17:31,683 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-15 11:17:31,707 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 11:17:31,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 11:17:31,708 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 11:17:31,708 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 11:17:31,708 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 11:17:31,709 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 11:17:31,709 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 11:17:31,709 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 11:17:31,709 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 11:17:31,710 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 11:17:31,710 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 11:17:31,711 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 11:17:31,711 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 11:17:31,711 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 11:17:31,711 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 11:17:31,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 11:17:31,712 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 11:17:31,712 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 11:17:31,712 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 11:17:31,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 11:17:31,713 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 11:17:31,714 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 11:17:31,714 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 11:17:31,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:17:31,714 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 11:17:31,714 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 11:17:31,715 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 11:17:31,715 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 11:17:31,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 11:17:31,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 11:17:31,715 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 11:17:31,716 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 11:17:31,716 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 11:17:31,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 11:17:31,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 11:17:31,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 11:17:31,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 11:17:31,790 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 11:17:31,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label03_true-unreach-call.c [2018-09-15 11:17:32,165 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c10f7e3/e75bdff0f3a2494b85fe720b023414d6/FLAG535e69220 [2018-09-15 11:17:32,555 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 11:17:32,556 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label03_true-unreach-call.c [2018-09-15 11:17:32,582 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c10f7e3/e75bdff0f3a2494b85fe720b023414d6/FLAG535e69220 [2018-09-15 11:17:32,604 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c10f7e3/e75bdff0f3a2494b85fe720b023414d6 [2018-09-15 11:17:32,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 11:17:32,618 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 11:17:32,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 11:17:32,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 11:17:32,627 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 11:17:32,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:17:32" (1/1) ... [2018-09-15 11:17:32,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f1297b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:32, skipping insertion in model container [2018-09-15 11:17:32,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:17:32" (1/1) ... [2018-09-15 11:17:32,644 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 11:17:33,226 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:17:33,252 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 11:17:33,372 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:17:33,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33 WrapperNode [2018-09-15 11:17:33,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 11:17:33,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 11:17:33,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 11:17:33,430 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 11:17:33,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 11:17:33,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 11:17:33,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 11:17:33,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 11:17:33,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (1/1) ... [2018-09-15 11:17:33,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 11:17:33,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 11:17:33,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 11:17:33,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 11:17:33,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (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-15 11:17:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 11:17:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 11:17:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 11:17:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 11:17:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 11:17:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 11:17:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 11:17:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 11:17:37,409 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 11:17:37,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:17:37 BoogieIcfgContainer [2018-09-15 11:17:37,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 11:17:37,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 11:17:37,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 11:17:37,417 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 11:17:37,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 11:17:32" (1/3) ... [2018-09-15 11:17:37,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71faa919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:17:37, skipping insertion in model container [2018-09-15 11:17:37,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:17:33" (2/3) ... [2018-09-15 11:17:37,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71faa919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:17:37, skipping insertion in model container [2018-09-15 11:17:37,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:17:37" (3/3) ... [2018-09-15 11:17:37,422 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label03_true-unreach-call.c [2018-09-15 11:17:37,431 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 11:17:37,440 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 11:17:37,495 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 11:17:37,496 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 11:17:37,497 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 11:17:37,497 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 11:17:37,497 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 11:17:37,497 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 11:17:37,498 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 11:17:37,498 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 11:17:37,498 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 11:17:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 11:17:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-15 11:17:37,536 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:17:37,538 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] [2018-09-15 11:17:37,539 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:17:37,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1405656705, now seen corresponding path program 1 times [2018-09-15 11:17:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:17:37,548 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-09-15 11:17:37,551 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 11:17:37,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:17:37,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:17:39,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:17:39,033 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 11:17:39,049 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:17:39,616 INFO L232 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 75.36% of their original sizes. [2018-09-15 11:17:39,617 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:17:39,920 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:17:39,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:17:39,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 11:17:39,923 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:17:39,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 11:17:39,936 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 11:17:39,937 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:17:39,940 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 11:17:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:17:43,610 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 11:17:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 11:17:43,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-09-15 11:17:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:17:43,631 INFO L225 Difference]: With dead ends: 576 [2018-09-15 11:17:43,632 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 11:17:43,640 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 38 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-15 11:17:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 11:17:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 11:17:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 11:17:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 11:17:43,723 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 43 [2018-09-15 11:17:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:17:43,724 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 11:17:43,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 11:17:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 11:17:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-15 11:17:43,731 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:17:43,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:17:43,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:17:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1018978157, now seen corresponding path program 1 times [2018-09-15 11:17:43,732 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:17:43,733 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-09-15 11:17:43,733 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:17:43,740 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:17:43,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:17:45,914 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:17:51,923 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:17:51,924 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:17:51,951 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:17:55,215 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 73.81% of their original sizes. [2018-09-15 11:17:55,216 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:17:56,998 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:17:56,998 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:17:56,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:17:56,999 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:17:57,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:17:57,001 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:17:57,001 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:17:57,001 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 11:18:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:18:03,723 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 11:18:03,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:18:03,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-09-15 11:18:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:18:03,735 INFO L225 Difference]: With dead ends: 711 [2018-09-15 11:18:03,736 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 11:18:03,740 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 120 GetRequests, 74 SyntacticMatches, 31 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 11:18:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 11:18:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 11:18:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 11:18:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 11:18:03,801 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 114 [2018-09-15 11:18:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:18:03,802 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 11:18:03,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:18:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 11:18:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-15 11:18:03,807 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:18:03,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:18:03,808 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:18:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1444484276, now seen corresponding path program 1 times [2018-09-15 11:18:03,809 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:18:03,809 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-09-15 11:18:03,809 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:18:03,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:18:03,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:18:10,357 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:18:10,358 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:18:10,394 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:18:12,923 INFO L232 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 73.73% of their original sizes. [2018-09-15 11:18:12,923 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:18:13,985 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:18:13,985 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:18:13,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 11:18:13,986 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:18:13,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 11:18:13,987 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 11:18:13,987 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 11:18:13,987 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 11 states. [2018-09-15 11:18:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:18:25,576 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 11:18:25,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:18:25,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2018-09-15 11:18:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:18:25,583 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 11:18:25,583 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 11:18:25,585 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 31 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:18:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 11:18:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 11:18:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 11:18:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 11:18:25,634 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 123 [2018-09-15 11:18:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:18:25,635 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 11:18:25,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 11:18:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 11:18:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-15 11:18:25,640 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:18:25,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:18:25,640 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:18:25,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1342877780, now seen corresponding path program 1 times [2018-09-15 11:18:25,641 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:18:25,641 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-09-15 11:18:25,641 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:18:25,647 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:18:25,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:18:28,609 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:18:39,437 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:18:39,437 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:18:39,447 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:18:43,010 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-15 11:18:43,011 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:18:44,377 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:18:44,378 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:18:44,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 11:18:44,378 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:18:44,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 11:18:44,380 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 11:18:44,380 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-15 11:18:44,381 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 12 states. [2018-09-15 11:18:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:18:52,901 INFO L93 Difference]: Finished difference Result 1150 states and 1593 transitions. [2018-09-15 11:18:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 11:18:52,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2018-09-15 11:18:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:18:52,908 INFO L225 Difference]: With dead ends: 1150 [2018-09-15 11:18:52,908 INFO L226 Difference]: Without dead ends: 944 [2018-09-15 11:18:52,910 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 117 SyntacticMatches, 31 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-15 11:18:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-09-15 11:18:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 939. [2018-09-15 11:18:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-09-15 11:18:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1120 transitions. [2018-09-15 11:18:52,957 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1120 transitions. Word has length 159 [2018-09-15 11:18:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:18:52,957 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1120 transitions. [2018-09-15 11:18:52,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 11:18:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1120 transitions. [2018-09-15 11:18:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-15 11:18:52,961 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:18:52,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:18:52,962 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:18:52,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1331084013, now seen corresponding path program 1 times [2018-09-15 11:18:52,962 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:18:52,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-09-15 11:18:52,963 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:18:52,969 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:18:52,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:19:18,520 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:19:18,520 INFO L272 AbstractInterpreter]: Visited 142 different actions 549 times. Merged at 5 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:19:18,527 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:19:20,301 INFO L232 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 73.42% of their original sizes. [2018-09-15 11:19:20,302 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:19:21,166 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:19:21,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:19:21,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 11:19:21,167 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:19:21,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 11:19:21,168 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 11:19:21,168 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-15 11:19:21,169 INFO L87 Difference]: Start difference. First operand 939 states and 1120 transitions. Second operand 15 states. [2018-09-15 11:19:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:19:29,334 INFO L93 Difference]: Finished difference Result 1301 states and 1760 transitions. [2018-09-15 11:19:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 11:19:29,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 178 [2018-09-15 11:19:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:19:29,351 INFO L225 Difference]: With dead ends: 1301 [2018-09-15 11:19:29,352 INFO L226 Difference]: Without dead ends: 1095 [2018-09-15 11:19:29,354 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-09-15 11:19:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-15 11:19:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1089. [2018-09-15 11:19:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-09-15 11:19:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1286 transitions. [2018-09-15 11:19:29,419 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1286 transitions. Word has length 178 [2018-09-15 11:19:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:19:29,419 INFO L480 AbstractCegarLoop]: Abstraction has 1089 states and 1286 transitions. [2018-09-15 11:19:29,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 11:19:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1286 transitions. [2018-09-15 11:19:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-15 11:19:29,423 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:19:29,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:19:29,424 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:19:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash 161088928, now seen corresponding path program 1 times [2018-09-15 11:19:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:19:29,424 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-09-15 11:19:29,425 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:19:29,440 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:19:29,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:19:46,398 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:19:46,398 INFO L272 AbstractInterpreter]: Visited 145 different actions 284 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:19:46,406 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:19:49,924 INFO L232 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 73.41% of their original sizes. [2018-09-15 11:19:49,924 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:19:51,606 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:19:51,606 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:19:51,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 11:19:51,607 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:19:51,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 11:19:51,608 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 11:19:51,608 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 11:19:51,608 INFO L87 Difference]: Start difference. First operand 1089 states and 1286 transitions. Second operand 14 states. [2018-09-15 11:20:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:20:00,131 INFO L93 Difference]: Finished difference Result 1594 states and 2078 transitions. [2018-09-15 11:20:00,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:20:00,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 181 [2018-09-15 11:20:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:20:00,139 INFO L225 Difference]: With dead ends: 1594 [2018-09-15 11:20:00,139 INFO L226 Difference]: Without dead ends: 1238 [2018-09-15 11:20:00,141 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 137 SyntacticMatches, 31 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-09-15 11:20:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-09-15 11:20:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1235. [2018-09-15 11:20:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-09-15 11:20:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1444 transitions. [2018-09-15 11:20:00,199 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1444 transitions. Word has length 181 [2018-09-15 11:20:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:20:00,199 INFO L480 AbstractCegarLoop]: Abstraction has 1235 states and 1444 transitions. [2018-09-15 11:20:00,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 11:20:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1444 transitions. [2018-09-15 11:20:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-15 11:20:00,203 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:20:00,203 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:20:00,204 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:20:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash -975903850, now seen corresponding path program 1 times [2018-09-15 11:20:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:20:00,204 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-15 11:20:00,205 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:20:00,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:20:00,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:20:01,666 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:20:13,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:20:13,169 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:20:13,178 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:20:16,681 INFO L232 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 73.43% of their original sizes. [2018-09-15 11:20:16,681 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:20:17,881 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:20:17,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:20:17,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:20:17,882 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:20:17,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:20:17,883 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:20:17,883 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:20:17,884 INFO L87 Difference]: Start difference. First operand 1235 states and 1444 transitions. Second operand 10 states. [2018-09-15 11:20:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:20:25,411 INFO L93 Difference]: Finished difference Result 1749 states and 2252 transitions. [2018-09-15 11:20:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 11:20:25,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-09-15 11:20:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:20:25,420 INFO L225 Difference]: With dead ends: 1749 [2018-09-15 11:20:25,420 INFO L226 Difference]: Without dead ends: 1393 [2018-09-15 11:20:25,422 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 150 SyntacticMatches, 31 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:20:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-09-15 11:20:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1383. [2018-09-15 11:20:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-09-15 11:20:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1610 transitions. [2018-09-15 11:20:25,482 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1610 transitions. Word has length 190 [2018-09-15 11:20:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:20:25,483 INFO L480 AbstractCegarLoop]: Abstraction has 1383 states and 1610 transitions. [2018-09-15 11:20:25,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:20:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1610 transitions. [2018-09-15 11:20:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-15 11:20:25,487 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:20:25,487 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:20:25,487 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:20:25,487 INFO L82 PathProgramCache]: Analyzing trace with hash 647362910, now seen corresponding path program 1 times [2018-09-15 11:20:25,488 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:20:25,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-09-15 11:20:25,488 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:20:25,491 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:20:25,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:20:27,013 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:20:46,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:20:46,380 INFO L272 AbstractInterpreter]: Visited 88 different actions 510 times. Merged at 7 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:20:46,388 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:20:47,685 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 73.38% of their original sizes. [2018-09-15 11:20:47,686 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:20:48,626 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:20:48,626 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:20:48,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 11:20:48,626 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:20:48,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 11:20:48,628 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 11:20:48,628 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-15 11:20:48,628 INFO L87 Difference]: Start difference. First operand 1383 states and 1610 transitions. Second operand 15 states. [2018-09-15 11:20:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:20:56,954 INFO L93 Difference]: Finished difference Result 2585 states and 3385 transitions. [2018-09-15 11:20:56,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:20:56,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 194 [2018-09-15 11:20:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:20:56,974 INFO L225 Difference]: With dead ends: 2585 [2018-09-15 11:20:56,975 INFO L226 Difference]: Without dead ends: 2081 [2018-09-15 11:20:56,978 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-09-15 11:20:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2018-09-15 11:20:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2059. [2018-09-15 11:20:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2018-09-15 11:20:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2428 transitions. [2018-09-15 11:20:57,071 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2428 transitions. Word has length 194 [2018-09-15 11:20:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:20:57,071 INFO L480 AbstractCegarLoop]: Abstraction has 2059 states and 2428 transitions. [2018-09-15 11:20:57,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 11:20:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2428 transitions. [2018-09-15 11:20:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-15 11:20:57,077 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:20:57,077 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:20:57,077 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:20:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash 652203189, now seen corresponding path program 1 times [2018-09-15 11:20:57,078 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:20:57,078 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-09-15 11:20:57,078 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:20:57,081 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:20:57,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:20:58,372 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:21:22,687 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:21:22,688 INFO L272 AbstractInterpreter]: Visited 121 different actions 589 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:21:22,695 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:21:24,102 INFO L232 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-15 11:21:24,103 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:21:24,860 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:21:24,860 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:21:24,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-15 11:21:24,861 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:21:24,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-15 11:21:24,861 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-15 11:21:24,861 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-15 11:21:24,862 INFO L87 Difference]: Start difference. First operand 2059 states and 2428 transitions. Second operand 13 states. [2018-09-15 11:21:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:21:37,278 INFO L93 Difference]: Finished difference Result 3850 states and 4951 transitions. [2018-09-15 11:21:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:21:37,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 227 [2018-09-15 11:21:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:21:37,291 INFO L225 Difference]: With dead ends: 3850 [2018-09-15 11:21:37,291 INFO L226 Difference]: Without dead ends: 2670 [2018-09-15 11:21:37,296 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 203 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-15 11:21:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2018-09-15 11:21:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2574. [2018-09-15 11:21:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2018-09-15 11:21:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3052 transitions. [2018-09-15 11:21:37,400 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3052 transitions. Word has length 227 [2018-09-15 11:21:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:21:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 2574 states and 3052 transitions. [2018-09-15 11:21:37,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-15 11:21:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3052 transitions. [2018-09-15 11:21:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-15 11:21:37,407 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:21:37,408 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:21:37,408 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:21:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash -258499226, now seen corresponding path program 1 times [2018-09-15 11:21:37,408 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:21:37,409 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-09-15 11:21:37,409 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [245], [247], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:21:37,412 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:21:37,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:21:38,731 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 11:21:46,943 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 11:21:46,943 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 11:21:46,944 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 11:21:46,978 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 11:21:46,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 11:21:46 BoogieIcfgContainer [2018-09-15 11:21:46,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 11:21:46,980 INFO L168 Benchmark]: Toolchain (without parser) took 254364.48 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:21:46,982 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 11:21:46,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-15 11:21:46,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 11:21:46,984 INFO L168 Benchmark]: Boogie Preprocessor took 254.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -871.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-15 11:21:46,984 INFO L168 Benchmark]: RCFGBuilder took 3614.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 7.1 GB. [2018-09-15 11:21:46,985 INFO L168 Benchmark]: TraceAbstraction took 249567.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:21:46,991 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 254.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -871.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3614.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249567.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 112]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND TRUE (((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L112] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 249.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 75.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1842 SDtfs, 8052 SDslu, 2808 SDs, 0 SdLazy, 16310 SolverSat, 1818 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 65.7s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 1480 GetRequests, 1145 SyntacticMatches, 167 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2574occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 141.6s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9936903585544884 AbsIntWeakeningRatio, 0.13714285714285715 AbsIntAvgWeakeningVarsNumRemoved, 303.5842857142857 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 150 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label03_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_11-21-47-021.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label03_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_11-21-47-021.csv Completed graceful shutdown