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_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 10:02:24,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 10:02:24,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 10:02:24,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 10:02:24,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 10:02:24,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 10:02:24,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 10:02:24,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 10:02:24,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 10:02:24,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 10:02:24,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 10:02:24,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 10:02:24,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 10:02:24,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 10:02:24,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 10:02:24,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 10:02:24,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 10:02:24,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 10:02:24,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 10:02:24,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 10:02:24,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 10:02:24,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 10:02:24,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 10:02:24,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 10:02:24,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 10:02:24,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 10:02:24,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 10:02:24,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 10:02:24,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 10:02:24,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 10:02:24,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 10:02:24,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 10:02:24,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 10:02:24,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 10:02:24,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 10:02:24,638 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 10:02:24,638 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-19 10:02:24,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 10:02:24,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 10:02:24,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 10:02:24,669 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 10:02:24,670 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 10:02:24,670 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 10:02:24,670 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 10:02:24,670 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 10:02:24,670 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 10:02:24,671 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 10:02:24,671 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 10:02:24,671 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 10:02:24,671 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 10:02:24,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 10:02:24,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 10:02:24,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 10:02:24,674 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 10:02:24,674 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 10:02:24,674 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 10:02:24,674 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 10:02:24,675 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 10:02:24,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 10:02:24,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 10:02:24,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 10:02:24,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 10:02:24,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:02:24,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 10:02:24,677 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 10:02:24,677 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 10:02:24,677 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 10:02:24,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 10:02:24,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 10:02:24,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 10:02:24,678 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 10:02:24,678 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 10:02:24,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 10:02:24,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 10:02:24,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 10:02:24,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 10:02:24,776 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 10:02:24,777 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label34_true-unreach-call.c [2018-09-19 10:02:25,137 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d289f2cdd/df639574292f446e8b9982312859430e/FLAGb7ebeb706 [2018-09-19 10:02:25,404 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 10:02:25,408 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label34_true-unreach-call.c [2018-09-19 10:02:25,433 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d289f2cdd/df639574292f446e8b9982312859430e/FLAGb7ebeb706 [2018-09-19 10:02:25,455 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d289f2cdd/df639574292f446e8b9982312859430e [2018-09-19 10:02:25,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 10:02:25,468 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 10:02:25,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 10:02:25,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 10:02:25,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 10:02:25,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:02:25" (1/1) ... [2018-09-19 10:02:25,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746fe49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:25, skipping insertion in model container [2018-09-19 10:02:25,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:02:25" (1/1) ... [2018-09-19 10:02:25,491 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 10:02:25,953 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:02:25,970 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 10:02:26,134 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:02:26,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26 WrapperNode [2018-09-19 10:02:26,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 10:02:26,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 10:02:26,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 10:02:26,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 10:02:26,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 10:02:26,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 10:02:26,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 10:02:26,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 10:02:26,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... [2018-09-19 10:02:26,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 10:02:26,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 10:02:26,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 10:02:26,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 10:02:26,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:02:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 10:02:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 10:02:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 10:02:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 10:02:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 10:02:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 10:02:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 10:02:26,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 10:02:29,799 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 10:02:29,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:02:29 BoogieIcfgContainer [2018-09-19 10:02:29,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 10:02:29,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 10:02:29,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 10:02:29,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 10:02:29,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 10:02:25" (1/3) ... [2018-09-19 10:02:29,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a6bc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:02:29, skipping insertion in model container [2018-09-19 10:02:29,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:02:26" (2/3) ... [2018-09-19 10:02:29,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a6bc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:02:29, skipping insertion in model container [2018-09-19 10:02:29,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:02:29" (3/3) ... [2018-09-19 10:02:29,810 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label34_true-unreach-call.c [2018-09-19 10:02:29,821 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 10:02:29,832 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 10:02:29,901 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 10:02:29,902 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 10:02:29,902 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 10:02:29,902 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 10:02:29,903 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 10:02:29,903 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 10:02:29,903 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 10:02:29,903 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 10:02:29,903 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 10:02:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 10:02:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-19 10:02:29,950 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:29,951 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] [2018-09-19 10:02:29,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash 427988964, now seen corresponding path program 1 times [2018-09-19 10:02:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:29,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-09-19 10:02:29,966 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], [461], [463], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 10:02:30,051 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:30,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:32,070 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:32,072 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 10:02:32,087 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:32,761 INFO L232 lantSequenceWeakener]: Weakened 68 states. On average, predicates are now at 76.12% of their original sizes. [2018-09-19 10:02:32,761 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:33,146 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:33,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:33,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 10:02:33,148 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:33,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 10:02:33,163 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 10:02:33,164 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:02:33,167 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 10:02:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:38,558 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 10:02:38,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 10:02:38,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-09-19 10:02:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:38,579 INFO L225 Difference]: With dead ends: 576 [2018-09-19 10:02:38,579 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 10:02:38,586 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:02:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 10:02:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 10:02:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 10:02:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 10:02:38,672 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 70 [2018-09-19 10:02:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:38,673 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 10:02:38,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 10:02:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 10:02:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-19 10:02:38,681 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:38,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:02:38,681 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:38,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1761224749, now seen corresponding path program 1 times [2018-09-19 10:02:38,682 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:38,682 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-09-19 10:02:38,683 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], [461], [463], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:02:38,688 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:38,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:40,028 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:02:43,056 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:43,057 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:02:43,064 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:44,140 INFO L232 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 74.45% of their original sizes. [2018-09-19 10:02:44,140 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:44,700 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:44,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:44,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:02:44,701 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:44,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:02:44,703 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:02:44,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:02:44,703 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 10:02:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:53,077 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 10:02:53,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 10:02:53,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2018-09-19 10:02:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:53,086 INFO L225 Difference]: With dead ends: 717 [2018-09-19 10:02:53,087 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 10:02:53,091 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 10:02:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 10:02:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 10:02:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 10:02:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 10:02:53,133 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 141 [2018-09-19 10:02:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:53,135 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 10:02:53,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:02:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 10:02:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-19 10:02:53,139 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:53,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:02:53,140 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash -831848424, now seen corresponding path program 1 times [2018-09-19 10:02:53,141 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:53,141 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-09-19 10:02:53,141 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], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:02:53,146 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:53,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:58,716 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:00,749 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:00,749 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:03:00,754 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:01,651 INFO L232 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 74.35% of their original sizes. [2018-09-19 10:03:01,651 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:02,504 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:02,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:02,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:03:02,505 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:02,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:03:02,506 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:03:02,506 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:03:02,507 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 13 states. [2018-09-19 10:03:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:14,441 INFO L93 Difference]: Finished difference Result 1333 states and 2096 transitions. [2018-09-19 10:03:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 10:03:14,452 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 150 [2018-09-19 10:03:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:14,461 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 10:03:14,462 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 10:03:14,464 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 10:03:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 10:03:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 10:03:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 10:03:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 953 transitions. [2018-09-19 10:03:14,533 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 953 transitions. Word has length 150 [2018-09-19 10:03:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:14,534 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 953 transitions. [2018-09-19 10:03:14,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:03:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 953 transitions. [2018-09-19 10:03:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-19 10:03:14,544 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:14,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:03:14,544 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash 209457808, now seen corresponding path program 1 times [2018-09-19 10:03:14,546 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:14,546 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-09-19 10:03:14,547 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], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:03:14,557 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:14,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:17,178 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:22,850 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:22,851 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:03:22,872 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:23,844 INFO L232 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 74.03% of their original sizes. [2018-09-19 10:03:23,845 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:24,242 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:24,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:24,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:03:24,243 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:24,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:03:24,244 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:03:24,244 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:03:24,244 INFO L87 Difference]: Start difference. First operand 762 states and 953 transitions. Second operand 12 states. [2018-09-19 10:03:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:34,070 INFO L93 Difference]: Finished difference Result 1677 states and 2220 transitions. [2018-09-19 10:03:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:03:34,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 186 [2018-09-19 10:03:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:34,077 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 10:03:34,077 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 10:03:34,080 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 10:03:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 10:03:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 10:03:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 10:03:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1287 transitions. [2018-09-19 10:03:34,118 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1287 transitions. Word has length 186 [2018-09-19 10:03:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:34,118 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1287 transitions. [2018-09-19 10:03:34,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:03:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1287 transitions. [2018-09-19 10:03:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-19 10:03:34,122 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:34,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:03:34,123 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash -621618349, now seen corresponding path program 1 times [2018-09-19 10:03:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:34,123 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-09-19 10:03:34,124 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], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:03:34,128 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:34,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:43,874 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:43,875 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:03:43,884 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:44,723 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 73.91% of their original sizes. [2018-09-19 10:03:44,724 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:45,095 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:45,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:45,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:03:45,096 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:45,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:03:45,096 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:03:45,097 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:03:45,097 INFO L87 Difference]: Start difference. First operand 1056 states and 1287 transitions. Second operand 12 states. [2018-09-19 10:03:53,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:53,230 INFO L93 Difference]: Finished difference Result 2268 states and 2899 transitions. [2018-09-19 10:03:53,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:03:53,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 205 [2018-09-19 10:03:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:53,244 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 10:03:53,244 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 10:03:53,247 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 10:03:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 10:03:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 10:03:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 10:03:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1615 transitions. [2018-09-19 10:03:53,295 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1615 transitions. Word has length 205 [2018-09-19 10:03:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:53,295 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1615 transitions. [2018-09-19 10:03:53,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:03:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1615 transitions. [2018-09-19 10:03:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-19 10:03:53,300 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:53,300 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:03:53,300 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash -267612977, now seen corresponding path program 1 times [2018-09-19 10:03:53,301 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:53,301 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-09-19 10:03:53,301 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], [461], [463], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:03:53,304 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:53,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:54,706 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:59,686 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:59,686 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:03:59,693 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:00,625 INFO L232 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.89% of their original sizes. [2018-09-19 10:04:00,625 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:00,885 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:00,885 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:00,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:04:00,886 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:00,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:04:00,886 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:04:00,886 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:04:00,887 INFO L87 Difference]: Start difference. First operand 1352 states and 1615 transitions. Second operand 10 states. [2018-09-19 10:04:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:05,675 INFO L93 Difference]: Finished difference Result 2719 states and 3388 transitions. [2018-09-19 10:04:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:04:05,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2018-09-19 10:04:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:05,691 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 10:04:05,691 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 10:04:05,695 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:04:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 10:04:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 10:04:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 10:04:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1792 transitions. [2018-09-19 10:04:05,765 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1792 transitions. Word has length 217 [2018-09-19 10:04:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:05,766 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1792 transitions. [2018-09-19 10:04:05,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:04:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1792 transitions. [2018-09-19 10:04:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-19 10:04:05,770 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:05,770 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:04:05,771 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1605372053, now seen corresponding path program 1 times [2018-09-19 10:04:05,771 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:05,771 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-09-19 10:04:05,771 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], [461], [463], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:04:05,777 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:05,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:07,067 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:12,735 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:12,736 INFO L272 AbstractInterpreter]: Visited 86 different actions 333 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:04:12,743 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:13,596 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 73.87% of their original sizes. [2018-09-19 10:04:13,597 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:13,851 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:13,852 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:13,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:04:13,852 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:13,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:04:13,853 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:04:13,853 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:04:13,853 INFO L87 Difference]: Start difference. First operand 1503 states and 1792 transitions. Second operand 10 states. [2018-09-19 10:04:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:21,714 INFO L93 Difference]: Finished difference Result 3020 states and 3751 transitions. [2018-09-19 10:04:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:04:21,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2018-09-19 10:04:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:21,725 INFO L225 Difference]: With dead ends: 3020 [2018-09-19 10:04:21,726 INFO L226 Difference]: Without dead ends: 1671 [2018-09-19 10:04:21,729 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:04:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-19 10:04:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1654. [2018-09-19 10:04:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2018-09-19 10:04:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1988 transitions. [2018-09-19 10:04:21,787 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1988 transitions. Word has length 219 [2018-09-19 10:04:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:21,788 INFO L480 AbstractCegarLoop]: Abstraction has 1654 states and 1988 transitions. [2018-09-19 10:04:21,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:04:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1988 transitions. [2018-09-19 10:04:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-19 10:04:21,792 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:21,792 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, 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] [2018-09-19 10:04:21,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:21,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1093581661, now seen corresponding path program 1 times [2018-09-19 10:04:21,793 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:21,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-19 10:04:21,793 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], [461], [463], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:04:21,796 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:21,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:23,232 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:29,199 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:29,200 INFO L272 AbstractInterpreter]: Visited 90 different actions 349 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:04:29,208 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:30,060 INFO L232 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.85% of their original sizes. [2018-09-19 10:04:30,060 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:30,339 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:30,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:30,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:04:30,340 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:30,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:04:30,341 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:04:30,341 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:04:30,341 INFO L87 Difference]: Start difference. First operand 1654 states and 1988 transitions. Second operand 10 states. [2018-09-19 10:04:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:37,208 INFO L93 Difference]: Finished difference Result 3477 states and 4328 transitions. [2018-09-19 10:04:37,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:04:37,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 223 [2018-09-19 10:04:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:37,226 INFO L225 Difference]: With dead ends: 3477 [2018-09-19 10:04:37,226 INFO L226 Difference]: Without dead ends: 1977 [2018-09-19 10:04:37,230 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:04:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-09-19 10:04:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1954. [2018-09-19 10:04:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-09-19 10:04:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2362 transitions. [2018-09-19 10:04:37,300 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2362 transitions. Word has length 223 [2018-09-19 10:04:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:37,301 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 2362 transitions. [2018-09-19 10:04:37,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:04:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2362 transitions. [2018-09-19 10:04:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-19 10:04:37,305 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:37,306 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, 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] [2018-09-19 10:04:37,306 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1731238793, now seen corresponding path program 1 times [2018-09-19 10:04:37,306 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:37,307 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-09-19 10:04:37,307 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], [461], [463], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:04:37,309 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:37,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:38,601 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:48,440 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:48,441 INFO L272 AbstractInterpreter]: Visited 96 different actions 373 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:04:48,448 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:49,517 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.82% of their original sizes. [2018-09-19 10:04:49,517 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:49,821 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:49,822 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:49,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:04:49,822 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:49,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:04:49,823 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:04:49,823 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:04:49,823 INFO L87 Difference]: Start difference. First operand 1954 states and 2362 transitions. Second operand 10 states. [2018-09-19 10:04:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:54,873 INFO L93 Difference]: Finished difference Result 3932 states and 4909 transitions. [2018-09-19 10:04:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:04:54,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 229 [2018-09-19 10:04:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:54,883 INFO L225 Difference]: With dead ends: 3932 [2018-09-19 10:04:54,883 INFO L226 Difference]: Without dead ends: 2132 [2018-09-19 10:04:54,887 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:04:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-09-19 10:04:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2109. [2018-09-19 10:04:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2018-09-19 10:04:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2577 transitions. [2018-09-19 10:04:54,959 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2577 transitions. Word has length 229 [2018-09-19 10:04:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:54,960 INFO L480 AbstractCegarLoop]: Abstraction has 2109 states and 2577 transitions. [2018-09-19 10:04:54,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:04:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2577 transitions. [2018-09-19 10:04:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-19 10:04:54,965 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:54,965 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:04:54,965 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1261492016, now seen corresponding path program 1 times [2018-09-19 10:04:54,966 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:54,966 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-09-19 10:04:54,966 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], [461], [463], [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], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:04:54,969 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:54,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:56,401 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:06,620 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:06,620 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:05:06,630 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:07,958 INFO L232 lantSequenceWeakener]: Weakened 236 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-19 10:05:07,958 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:08,287 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:08,287 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:08,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:05:08,287 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:08,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:05:08,288 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:05:08,288 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:05:08,288 INFO L87 Difference]: Start difference. First operand 2109 states and 2577 transitions. Second operand 11 states. [2018-09-19 10:05:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:13,501 INFO L93 Difference]: Finished difference Result 4320 states and 5463 transitions. [2018-09-19 10:05:13,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:05:13,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 238 [2018-09-19 10:05:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:13,511 INFO L225 Difference]: With dead ends: 4320 [2018-09-19 10:05:13,511 INFO L226 Difference]: Without dead ends: 2365 [2018-09-19 10:05:13,516 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 246 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:05:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-09-19 10:05:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2262. [2018-09-19 10:05:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-19 10:05:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2792 transitions. [2018-09-19 10:05:13,595 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2792 transitions. Word has length 238 [2018-09-19 10:05:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:13,596 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 2792 transitions. [2018-09-19 10:05:13,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:05:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2792 transitions. [2018-09-19 10:05:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-19 10:05:13,602 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:13,603 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, 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] [2018-09-19 10:05:13,603 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1903291708, now seen corresponding path program 1 times [2018-09-19 10:05:13,603 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:13,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-09-19 10:05:13,604 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], [461], [463], [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], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:05:13,607 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:13,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:15,266 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:23,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:23,774 INFO L272 AbstractInterpreter]: Visited 111 different actions 433 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:05:23,780 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:24,893 INFO L232 lantSequenceWeakener]: Weakened 242 states. On average, predicates are now at 73.76% of their original sizes. [2018-09-19 10:05:24,894 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:25,223 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:25,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:25,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:05:25,223 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:25,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:05:25,224 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:05:25,224 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:05:25,224 INFO L87 Difference]: Start difference. First operand 2262 states and 2792 transitions. Second operand 11 states. [2018-09-19 10:05:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:33,335 INFO L93 Difference]: Finished difference Result 4808 states and 6139 transitions. [2018-09-19 10:05:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:05:33,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2018-09-19 10:05:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:33,345 INFO L225 Difference]: With dead ends: 4808 [2018-09-19 10:05:33,345 INFO L226 Difference]: Without dead ends: 2700 [2018-09-19 10:05:33,350 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:05:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-09-19 10:05:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2670. [2018-09-19 10:05:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-09-19 10:05:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3328 transitions. [2018-09-19 10:05:33,434 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3328 transitions. Word has length 244 [2018-09-19 10:05:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:33,435 INFO L480 AbstractCegarLoop]: Abstraction has 2670 states and 3328 transitions. [2018-09-19 10:05:33,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:05:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3328 transitions. [2018-09-19 10:05:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-19 10:05:33,440 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:33,440 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, 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] [2018-09-19 10:05:33,440 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:33,440 INFO L82 PathProgramCache]: Analyzing trace with hash -177479381, now seen corresponding path program 1 times [2018-09-19 10:05:33,441 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:33,441 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-09-19 10:05:33,441 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], [461], [463], [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], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:05:33,444 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:33,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:35,042 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:44,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:44,248 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:05:44,253 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:45,188 INFO L232 lantSequenceWeakener]: Weakened 249 states. On average, predicates are now at 73.73% of their original sizes. [2018-09-19 10:05:45,188 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:45,539 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:45,540 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:45,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:05:45,540 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:45,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:05:45,541 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:05:45,541 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:05:45,541 INFO L87 Difference]: Start difference. First operand 2670 states and 3328 transitions. Second operand 11 states. [2018-09-19 10:05:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:51,508 INFO L93 Difference]: Finished difference Result 5752 states and 7377 transitions. [2018-09-19 10:05:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:05:51,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 251 [2018-09-19 10:05:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:51,522 INFO L225 Difference]: With dead ends: 5752 [2018-09-19 10:05:51,523 INFO L226 Difference]: Without dead ends: 3236 [2018-09-19 10:05:51,528 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 259 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:05:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-09-19 10:05:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3129. [2018-09-19 10:05:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2018-09-19 10:05:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 3930 transitions. [2018-09-19 10:05:51,629 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 3930 transitions. Word has length 251 [2018-09-19 10:05:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:51,630 INFO L480 AbstractCegarLoop]: Abstraction has 3129 states and 3930 transitions. [2018-09-19 10:05:51,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:05:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3930 transitions. [2018-09-19 10:05:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-19 10:05:51,635 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:51,636 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, 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-19 10:05:51,636 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash -752200176, now seen corresponding path program 1 times [2018-09-19 10:05:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:51,638 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-09-19 10:05:51,639 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], [461], [463], [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-19 10:05:51,642 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:51,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:52,980 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:02,528 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:02,529 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:06:02,538 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:03,535 INFO L232 lantSequenceWeakener]: Weakened 252 states. On average, predicates are now at 73.72% of their original sizes. [2018-09-19 10:06:03,535 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:03,980 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:03,981 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:03,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:06:03,981 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:03,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:06:03,982 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:06:03,982 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:06:03,982 INFO L87 Difference]: Start difference. First operand 3129 states and 3930 transitions. Second operand 13 states. [2018-09-19 10:06:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:12,008 INFO L93 Difference]: Finished difference Result 6701 states and 8709 transitions. [2018-09-19 10:06:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:06:12,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 254 [2018-09-19 10:06:12,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:12,024 INFO L225 Difference]: With dead ends: 6701 [2018-09-19 10:06:12,024 INFO L226 Difference]: Without dead ends: 3726 [2018-09-19 10:06:12,031 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 10:06:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2018-09-19 10:06:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3529. [2018-09-19 10:06:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-09-19 10:06:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4443 transitions. [2018-09-19 10:06:12,144 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4443 transitions. Word has length 254 [2018-09-19 10:06:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:12,145 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 4443 transitions. [2018-09-19 10:06:12,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:06:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4443 transitions. [2018-09-19 10:06:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-19 10:06:12,151 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:12,152 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:06:12,152 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1829582141, now seen corresponding path program 1 times [2018-09-19 10:06:12,152 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:12,153 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-09-19 10:06:12,153 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:06:12,156 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:12,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:14,932 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:26,575 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:26,575 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:06:26,584 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:27,634 INFO L232 lantSequenceWeakener]: Weakened 257 states. On average, predicates are now at 73.7% of their original sizes. [2018-09-19 10:06:27,634 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:27,905 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:27,905 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:27,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:06:27,905 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:27,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:06:27,906 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:06:27,906 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:06:27,906 INFO L87 Difference]: Start difference. First operand 3529 states and 4443 transitions. Second operand 10 states. [2018-09-19 10:06:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:33,499 INFO L93 Difference]: Finished difference Result 7079 states and 9092 transitions. [2018-09-19 10:06:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:06:33,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-09-19 10:06:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:33,513 INFO L225 Difference]: With dead ends: 7079 [2018-09-19 10:06:33,519 INFO L226 Difference]: Without dead ends: 3704 [2018-09-19 10:06:33,526 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:06:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2018-09-19 10:06:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3677. [2018-09-19 10:06:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2018-09-19 10:06:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4642 transitions. [2018-09-19 10:06:33,656 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4642 transitions. Word has length 259 [2018-09-19 10:06:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:33,657 INFO L480 AbstractCegarLoop]: Abstraction has 3677 states and 4642 transitions. [2018-09-19 10:06:33,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:06:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4642 transitions. [2018-09-19 10:06:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-19 10:06:33,664 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:33,664 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, 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] [2018-09-19 10:06:33,664 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2012174125, now seen corresponding path program 1 times [2018-09-19 10:06:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:33,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-09-19 10:06:33,665 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], [461], [463], [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], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:06:33,668 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:33,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:35,161 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 10:06:43,465 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 10:06:43,465 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 10:06:43,466 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:06:43,510 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:06:43,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:06:43 BoogieIcfgContainer [2018-09-19 10:06:43,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:06:43,512 INFO L168 Benchmark]: Toolchain (without parser) took 258046.70 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:06:43,514 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 10:06:43,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.32 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-19 10:06:43,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 10:06:43,516 INFO L168 Benchmark]: Boogie Preprocessor took 259.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -869.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 10:06:43,516 INFO L168 Benchmark]: RCFGBuilder took 3229.73 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: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2018-09-19 10:06:43,517 INFO L168 Benchmark]: TraceAbstraction took 253709.33 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -402.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 10:06:43,522 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.19 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 727.32 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 114.34 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 259.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -869.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3229.73 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: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253709.33 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -402.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: 193]: 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 FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] RET return 24; [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 TRUE (((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)) [L193] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 253.6s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 101.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2712 SDtfs, 10509 SDslu, 5210 SDs, 0 SdLazy, 27547 SolverSat, 2559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.3s Time, PredicateUnifierStatistics: 28 DeclaredPredicates, 2993 GetRequests, 2751 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3677occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 131.9s AbstIntTime, 15 AbstIntIterations, 14 AbstIntStrong, 0.9947821476543334 AbsIntWeakeningRatio, 0.11420612813370473 AbsIntAvgWeakeningVarsNumRemoved, 881.3419220055711 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 792 StatesRemovedByMinimization, 14 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_label34_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-06-43-536.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label34_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-06-43-536.csv Completed graceful shutdown