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_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 19:27:38,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 19:27:38,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 19:27:38,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 19:27:38,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 19:27:38,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 19:27:38,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 19:27:38,635 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 19:27:38,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 19:27:38,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 19:27:38,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 19:27:38,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 19:27:38,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 19:27:38,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 19:27:38,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 19:27:38,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 19:27:38,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 19:27:38,646 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 19:27:38,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 19:27:38,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 19:27:38,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 19:27:38,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 19:27:38,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 19:27:38,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 19:27:38,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 19:27:38,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 19:27:38,657 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 19:27:38,658 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 19:27:38,659 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 19:27:38,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 19:27:38,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 19:27:38,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 19:27:38,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 19:27:38,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 19:27:38,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 19:27:38,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 19:27:38,664 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-15 19:27:38,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 19:27:38,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 19:27:38,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 19:27:38,683 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 19:27:38,683 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 19:27:38,683 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 19:27:38,683 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 19:27:38,684 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 19:27:38,684 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-15 19:27:38,684 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 19:27:38,684 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 19:27:38,684 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 19:27:38,685 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 19:27:38,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 19:27:38,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 19:27:38,686 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 19:27:38,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 19:27:38,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 19:27:38,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 19:27:38,687 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 19:27:38,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 19:27:38,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 19:27:38,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 19:27:38,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 19:27:38,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 19:27:38,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 19:27:38,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 19:27:38,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 19:27:38,689 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 19:27:38,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 19:27:38,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 19:27:38,689 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 19:27:38,690 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 19:27:38,690 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 19:27:38,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 19:27:38,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 19:27:38,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 19:27:38,772 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 19:27:38,773 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 19:27:38,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-09-15 19:27:39,137 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5117b0670/754e5e7112b04484b9aefb82b2aa5c08/FLAG98d7c257d [2018-09-15 19:27:39,423 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 19:27:39,424 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-09-15 19:27:39,438 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5117b0670/754e5e7112b04484b9aefb82b2aa5c08/FLAG98d7c257d [2018-09-15 19:27:39,455 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5117b0670/754e5e7112b04484b9aefb82b2aa5c08 [2018-09-15 19:27:39,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 19:27:39,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 19:27:39,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 19:27:39,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 19:27:39,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 19:27:39,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:27:39" (1/1) ... [2018-09-15 19:27:39,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf5491e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:39, skipping insertion in model container [2018-09-15 19:27:39,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:27:39" (1/1) ... [2018-09-15 19:27:39,495 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 19:27:39,985 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:27:40,003 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 19:27:40,132 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:27:40,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40 WrapperNode [2018-09-15 19:27:40,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 19:27:40,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 19:27:40,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 19:27:40,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 19:27:40,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 19:27:40,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 19:27:40,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 19:27:40,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 19:27:40,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (1/1) ... [2018-09-15 19:27:40,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 19:27:40,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 19:27:40,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 19:27:40,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 19:27:40,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (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 19:27:40,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 19:27:40,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 19:27:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 19:27:40,698 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 19:27:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 19:27:40,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 19:27:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 19:27:40,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 19:27:43,886 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 19:27:43,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:27:43 BoogieIcfgContainer [2018-09-15 19:27:43,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 19:27:43,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 19:27:43,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 19:27:43,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 19:27:43,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:27:39" (1/3) ... [2018-09-15 19:27:43,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20c853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:27:43, skipping insertion in model container [2018-09-15 19:27:43,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:27:40" (2/3) ... [2018-09-15 19:27:43,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20c853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:27:43, skipping insertion in model container [2018-09-15 19:27:43,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:27:43" (3/3) ... [2018-09-15 19:27:43,900 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59_true-unreach-call.c [2018-09-15 19:27:43,911 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 19:27:43,923 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 19:27:43,996 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 19:27:43,997 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 19:27:43,997 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 19:27:43,997 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 19:27:43,997 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 19:27:43,998 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 19:27:43,998 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 19:27:43,998 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 19:27:43,998 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 19:27:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 19:27:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-15 19:27:44,055 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:27:44,057 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:27:44,058 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:27:44,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1019321972, now seen corresponding path program 1 times [2018-09-15 19:27:44,070 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:27:44,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-09-15 19:27:44,075 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 19:27:44,153 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:27:44,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:27:45,903 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:27:45,905 INFO L272 AbstractInterpreter]: Visited 71 different actions 71 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 19:27:45,922 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:27:46,599 INFO L232 lantSequenceWeakener]: Weakened 70 states. On average, predicates are now at 76.15% of their original sizes. [2018-09-15 19:27:46,599 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:27:46,919 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:27:46,921 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:27:46,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 19:27:46,921 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:27:46,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 19:27:46,936 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 19:27:46,936 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 19:27:46,939 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 19:27:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:27:51,751 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 19:27:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 19:27:51,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-09-15 19:27:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:27:51,773 INFO L225 Difference]: With dead ends: 576 [2018-09-15 19:27:51,774 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 19:27:51,780 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 67 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 19:27:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 19:27:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 19:27:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 19:27:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 19:27:51,877 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 72 [2018-09-15 19:27:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:27:51,878 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 19:27:51,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 19:27:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 19:27:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-15 19:27:51,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:27:51,886 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:27:51,886 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:27:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1630388773, now seen corresponding path program 1 times [2018-09-15 19:27:51,887 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:27:51,887 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-09-15 19:27:51,888 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:27:51,894 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:27:51,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:27:53,498 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:27:56,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:27:56,361 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 19:27:56,372 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:27:58,130 INFO L232 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 74.52% of their original sizes. [2018-09-15 19:27:58,130 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:27:59,035 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:27:59,036 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:27:59,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 19:27:59,036 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:27:59,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 19:27:59,038 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 19:27:59,038 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 19:27:59,038 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 19:28:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:28:06,868 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 19:28:06,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 19:28:06,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2018-09-15 19:28:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:28:06,877 INFO L225 Difference]: With dead ends: 711 [2018-09-15 19:28:06,877 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 19:28:06,880 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:28:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 19:28:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 19:28:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 19:28:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 19:28:06,920 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 143 [2018-09-15 19:28:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:28:06,921 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 19:28:06,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 19:28:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 19:28:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-15 19:28:06,926 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:28:06,927 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:28:06,927 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:28:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash -265136992, now seen corresponding path program 1 times [2018-09-15 19:28:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:28:06,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-09-15 19:28:06,928 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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 19:28:06,932 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:28:06,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:28:12,172 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:28:12,172 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 19:28:12,188 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:28:13,125 INFO L232 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 74.42% of their original sizes. [2018-09-15 19:28:13,125 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:28:13,623 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:28:13,623 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:28:13,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 19:28:13,623 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:28:13,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 19:28:13,624 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 19:28:13,625 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 19:28:13,625 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 12 states. [2018-09-15 19:28:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:28:20,564 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 19:28:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 19:28:20,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 152 [2018-09-15 19:28:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:28:20,571 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 19:28:20,571 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 19:28:20,573 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 19:28:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 19:28:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 19:28:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 19:28:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 19:28:20,621 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 152 [2018-09-15 19:28:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:28:20,622 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 19:28:20,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 19:28:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 19:28:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-15 19:28:20,628 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:28:20,629 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 19:28:20,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:28:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1534445288, now seen corresponding path program 1 times [2018-09-15 19:28:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:28:20,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-09-15 19:28:20,630 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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 19:28:20,637 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:28:20,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:28:25,218 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:28:35,323 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:28:35,324 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:28:35,328 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:28:37,539 INFO L232 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 74.09% of their original sizes. [2018-09-15 19:28:37,539 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:28:38,308 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:28:38,308 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:28:38,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 19:28:38,309 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:28:38,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 19:28:38,310 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 19:28:38,310 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 19:28:38,310 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 14 states. [2018-09-15 19:28:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:28:49,630 INFO L93 Difference]: Finished difference Result 1161 states and 1610 transitions. [2018-09-15 19:28:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 19:28:49,632 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-09-15 19:28:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:28:49,638 INFO L225 Difference]: With dead ends: 1161 [2018-09-15 19:28:49,638 INFO L226 Difference]: Without dead ends: 955 [2018-09-15 19:28:49,641 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-09-15 19:28:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-09-15 19:28:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 943. [2018-09-15 19:28:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-15 19:28:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1137 transitions. [2018-09-15 19:28:49,692 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1137 transitions. Word has length 188 [2018-09-15 19:28:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:28:49,693 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 1137 transitions. [2018-09-15 19:28:49,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 19:28:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1137 transitions. [2018-09-15 19:28:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-15 19:28:49,698 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:28:49,698 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 19:28:49,698 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:28:49,699 INFO L82 PathProgramCache]: Analyzing trace with hash -560242341, now seen corresponding path program 1 times [2018-09-15 19:28:49,699 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:28:49,699 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-15 19:28:49,700 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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 19:28:49,706 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:28:49,707 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:29:03,589 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:29:03,589 INFO L272 AbstractInterpreter]: Visited 142 different actions 278 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 19:29:03,598 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:29:05,330 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.96% of their original sizes. [2018-09-15 19:29:05,331 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:29:06,750 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:29:06,750 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:29:06,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-15 19:29:06,751 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:29:06,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-15 19:29:06,752 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-15 19:29:06,752 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-15 19:29:06,753 INFO L87 Difference]: Start difference. First operand 943 states and 1137 transitions. Second operand 18 states. [2018-09-15 19:29:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:29:18,369 INFO L93 Difference]: Finished difference Result 1561 states and 2167 transitions. [2018-09-15 19:29:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-15 19:29:18,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 207 [2018-09-15 19:29:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:29:18,376 INFO L225 Difference]: With dead ends: 1561 [2018-09-15 19:29:18,376 INFO L226 Difference]: Without dead ends: 1207 [2018-09-15 19:29:18,379 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-09-15 19:29:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-09-15 19:29:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-09-15 19:29:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-15 19:29:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1418 transitions. [2018-09-15 19:29:18,429 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1418 transitions. Word has length 207 [2018-09-15 19:29:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:29:18,430 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1418 transitions. [2018-09-15 19:29:18,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-15 19:29:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1418 transitions. [2018-09-15 19:29:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-15 19:29:18,434 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:29:18,434 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:29:18,435 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:29:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1435948105, now seen corresponding path program 1 times [2018-09-15 19:29:18,435 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:29:18,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-09-15 19:29:18,436 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:29:18,439 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:29:18,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:29:19,924 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:29:26,406 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:29:26,407 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 19:29:26,410 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:29:28,194 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 73.95% of their original sizes. [2018-09-15 19:29:28,194 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:29:28,797 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:29:28,797 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:29:28,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 19:29:28,798 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:29:28,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 19:29:28,798 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 19:29:28,798 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 19:29:28,799 INFO L87 Difference]: Start difference. First operand 1205 states and 1418 transitions. Second operand 11 states. [2018-09-15 19:29:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:29:39,777 INFO L93 Difference]: Finished difference Result 1717 states and 2233 transitions. [2018-09-15 19:29:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 19:29:39,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 219 [2018-09-15 19:29:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:29:39,787 INFO L225 Difference]: With dead ends: 1717 [2018-09-15 19:29:39,788 INFO L226 Difference]: Without dead ends: 1363 [2018-09-15 19:29:39,795 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-09-15 19:29:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-09-15 19:29:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1353. [2018-09-15 19:29:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-09-15 19:29:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1584 transitions. [2018-09-15 19:29:39,865 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1584 transitions. Word has length 219 [2018-09-15 19:29:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:29:39,866 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 1584 transitions. [2018-09-15 19:29:39,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 19:29:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1584 transitions. [2018-09-15 19:29:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-15 19:29:39,871 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:29:39,872 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 19:29:39,872 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:29:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1189102865, now seen corresponding path program 1 times [2018-09-15 19:29:39,873 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:29:39,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-15 19:29:39,873 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [477], [479], [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 19:29:39,876 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:29:39,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:29:41,358 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:29:59,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 19:29:59,588 INFO L272 AbstractInterpreter]: Visited 89 different actions 515 times. Merged at 7 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:29:59,599 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 19:29:59,638 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 19:29:59,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:29:59 BoogieIcfgContainer [2018-09-15 19:29:59,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 19:29:59,640 INFO L168 Benchmark]: Toolchain (without parser) took 140172.62 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 1.8 GB in the end (delta: -396.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 19:29:59,642 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 19:29:59,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.14 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-15 19:29:59,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.54 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 19:29:59,644 INFO L168 Benchmark]: Boogie Preprocessor took 275.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2018-09-15 19:29:59,645 INFO L168 Benchmark]: RCFGBuilder took 3273.98 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 7.1 GB. [2018-09-15 19:29:59,646 INFO L168 Benchmark]: TraceAbstraction took 135750.46 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 1.8 GB in the end (delta: 289.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-15 19:29:59,652 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.14 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 131.54 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 275.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3273.98 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135750.46 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 1.8 GB in the end (delta: 289.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 199]: 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 TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL 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 TRUE (((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)) [L199] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 135.6s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 53.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1241 SDtfs, 3964 SDslu, 2194 SDs, 0 SdLazy, 10942 SolverSat, 1035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.4s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 1029 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1353occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 67.8s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9943067801763454 AbsIntWeakeningRatio, 0.12307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 162.81025641025641 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 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_label59_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_19-29-59-667.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label59_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_19-29-59-667.csv Received shutdown request...