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_label40_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 19:25:20,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 19:25:20,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 19:25:20,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 19:25:20,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 19:25:20,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 19:25:20,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 19:25:20,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 19:25:20,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 19:25:20,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 19:25:20,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 19:25:20,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 19:25:20,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 19:25:20,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 19:25:20,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 19:25:20,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 19:25:20,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 19:25:20,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 19:25:20,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 19:25:20,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 19:25:20,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 19:25:20,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 19:25:20,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 19:25:20,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 19:25:20,069 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 19:25:20,070 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 19:25:20,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 19:25:20,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 19:25:20,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 19:25:20,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 19:25:20,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 19:25:20,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 19:25:20,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 19:25:20,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 19:25:20,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 19:25:20,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 19:25:20,081 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-15 19:25:20,110 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 19:25:20,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 19:25:20,111 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 19:25:20,112 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 19:25:20,112 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 19:25:20,112 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 19:25:20,112 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 19:25:20,112 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 19:25:20,113 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-15 19:25:20,113 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 19:25:20,113 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 19:25:20,113 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 19:25:20,114 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 19:25:20,114 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 19:25:20,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 19:25:20,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 19:25:20,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 19:25:20,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 19:25:20,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 19:25:20,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 19:25:20,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 19:25:20,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 19:25:20,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 19:25:20,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 19:25:20,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 19:25:20,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 19:25:20,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 19:25:20,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 19:25:20,117 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 19:25:20,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 19:25:20,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 19:25:20,118 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 19:25:20,118 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 19:25:20,118 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 19:25:20,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 19:25:20,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 19:25:20,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 19:25:20,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 19:25:20,193 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 19:25:20,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label40_true-unreach-call.c [2018-09-15 19:25:20,576 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea26896fe/57caa7c5b3a24ca380258448d6e908ec/FLAGe5c72530e [2018-09-15 19:25:20,881 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 19:25:20,885 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label40_true-unreach-call.c [2018-09-15 19:25:20,906 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea26896fe/57caa7c5b3a24ca380258448d6e908ec/FLAGe5c72530e [2018-09-15 19:25:20,930 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea26896fe/57caa7c5b3a24ca380258448d6e908ec [2018-09-15 19:25:20,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 19:25:20,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 19:25:20,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 19:25:20,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 19:25:20,961 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 19:25:20,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:25:20" (1/1) ... [2018-09-15 19:25:20,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54315448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:20, skipping insertion in model container [2018-09-15 19:25:20,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:25:20" (1/1) ... [2018-09-15 19:25:20,980 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 19:25:21,441 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:25:21,460 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 19:25:21,629 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:25:21,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21 WrapperNode [2018-09-15 19:25:21,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 19:25:21,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 19:25:21,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 19:25:21,677 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 19:25:21,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:21,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:21,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 19:25:21,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 19:25:21,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 19:25:21,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 19:25:22,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:22,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:22,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:22,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:22,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:22,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:22,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... [2018-09-15 19:25:22,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 19:25:22,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 19:25:22,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 19:25:22,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 19:25:22,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 19:25:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 19:25:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 19:25:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 19:25:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 19:25:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 19:25:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 19:25:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 19:25:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 19:25:25,521 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 19:25:25,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:25:25 BoogieIcfgContainer [2018-09-15 19:25:25,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 19:25:25,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 19:25:25,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 19:25:25,528 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 19:25:25,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:25:20" (1/3) ... [2018-09-15 19:25:25,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677b08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:25:25, skipping insertion in model container [2018-09-15 19:25:25,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:21" (2/3) ... [2018-09-15 19:25:25,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677b08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:25:25, skipping insertion in model container [2018-09-15 19:25:25,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:25:25" (3/3) ... [2018-09-15 19:25:25,532 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label40_true-unreach-call.c [2018-09-15 19:25:25,540 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 19:25:25,550 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 19:25:25,602 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 19:25:25,603 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 19:25:25,603 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 19:25:25,603 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 19:25:25,603 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 19:25:25,604 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 19:25:25,604 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 19:25:25,604 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 19:25:25,604 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 19:25:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 19:25:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-15 19:25:25,642 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:25:25,644 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] [2018-09-15 19:25:25,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:25:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash -114412468, now seen corresponding path program 1 times [2018-09-15 19:25:25,652 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:25:25,652 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-09-15 19:25:25,655 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], [349], [351], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 19:25:25,715 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:25:25,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:25:27,173 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:25:27,175 INFO L272 AbstractInterpreter]: Visited 55 different actions 55 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 19:25:27,188 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:25:27,765 INFO L232 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 75.82% of their original sizes. [2018-09-15 19:25:27,765 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:25:28,114 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:25:28,115 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:25:28,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 19:25:28,116 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:25:28,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 19:25:28,132 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 19:25:28,133 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 19:25:28,136 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 19:25:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:25:32,564 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 19:25:32,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 19:25:32,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-09-15 19:25:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:25:32,586 INFO L225 Difference]: With dead ends: 576 [2018-09-15 19:25:32,586 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 19:25:32,594 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 51 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-15 19:25:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 19:25:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 19:25:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 19:25:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 19:25:32,667 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 56 [2018-09-15 19:25:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:25:32,668 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 19:25:32,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 19:25:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 19:25:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-15 19:25:32,675 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:25:32,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:25:32,676 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:25:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash -613904997, now seen corresponding path program 1 times [2018-09-15 19:25:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:25:32,676 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-09-15 19:25:32,677 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], [349], [351], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:25:32,684 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:25:32,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:25:34,019 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:25:36,706 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:25:36,707 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:25:36,709 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:25:38,777 INFO L232 lantSequenceWeakener]: Weakened 125 states. On average, predicates are now at 74.17% of their original sizes. [2018-09-15 19:25:38,777 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:25:39,683 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:25:39,683 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:25:39,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 19:25:39,684 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:25:39,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 19:25:39,685 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 19:25:39,685 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 19:25:39,686 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 19:25:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:25:48,004 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 19:25:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 19:25:48,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2018-09-15 19:25:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:25:48,014 INFO L225 Difference]: With dead ends: 711 [2018-09-15 19:25:48,014 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 19:25:48,017 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 133 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:25:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 19:25:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 19:25:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 19:25:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 19:25:48,066 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 127 [2018-09-15 19:25:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:25:48,067 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 19:25:48,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 19:25:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 19:25:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-15 19:25:48,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:25:48,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:25:48,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:25:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1956884576, now seen corresponding path program 1 times [2018-09-15 19:25:48,072 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:25:48,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-09-15 19:25:48,073 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], [349], [351], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:25:48,078 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:25:48,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:25:53,070 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:25:53,070 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:25:53,076 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:25:54,060 INFO L232 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 74.07% of their original sizes. [2018-09-15 19:25:54,060 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:25:54,629 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:25:54,630 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:25:54,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 19:25:54,630 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:25:54,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 19:25:54,631 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 19:25:54,631 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 19:25:54,632 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 12 states. [2018-09-15 19:26:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:26:01,624 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 19:26:01,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 19:26:01,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 136 [2018-09-15 19:26:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:26:01,632 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 19:26:01,632 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 19:26:01,634 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 19:26:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 19:26:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 19:26:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 19:26:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 19:26:01,690 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 136 [2018-09-15 19:26:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:26:01,691 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 19:26:01,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 19:26:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 19:26:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-15 19:26:01,696 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:26:01,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:26:01,697 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:26:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash -194575144, now seen corresponding path program 1 times [2018-09-15 19:26:01,698 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:26:01,698 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-09-15 19:26:01,698 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], [349], [351], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:26:01,705 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:26:01,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:26:06,049 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:26:15,775 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:26:15,775 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:26:15,781 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:26:18,223 INFO L232 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 73.79% of their original sizes. [2018-09-15 19:26:18,223 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:26:19,087 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:26:19,087 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:26:19,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 19:26:19,087 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:26:19,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 19:26:19,089 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 19:26:19,089 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 19:26:19,089 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 14 states. [2018-09-15 19:26:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:26:30,238 INFO L93 Difference]: Finished difference Result 1161 states and 1610 transitions. [2018-09-15 19:26:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 19:26:30,239 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 172 [2018-09-15 19:26:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:26:30,245 INFO L225 Difference]: With dead ends: 1161 [2018-09-15 19:26:30,245 INFO L226 Difference]: Without dead ends: 955 [2018-09-15 19:26:30,247 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-09-15 19:26:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-09-15 19:26:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 943. [2018-09-15 19:26:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-15 19:26:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1137 transitions. [2018-09-15 19:26:30,291 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1137 transitions. Word has length 172 [2018-09-15 19:26:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:26:30,292 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 1137 transitions. [2018-09-15 19:26:30,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 19:26:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1137 transitions. [2018-09-15 19:26:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-15 19:26:30,296 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:26:30,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:26:30,296 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:26:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash -579817189, now seen corresponding path program 1 times [2018-09-15 19:26:30,297 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:26:30,297 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-09-15 19:26:30,297 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], [349], [351], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:26:30,304 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:26:30,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:26:44,503 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:26:44,503 INFO L272 AbstractInterpreter]: Visited 142 different actions 278 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:26:44,510 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:26:46,872 INFO L232 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 73.68% of their original sizes. [2018-09-15 19:26:46,873 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:26:48,280 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:26:48,280 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:26:48,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-15 19:26:48,281 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:26:48,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-15 19:26:48,281 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-15 19:26:48,281 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-15 19:26:48,282 INFO L87 Difference]: Start difference. First operand 943 states and 1137 transitions. Second operand 18 states. [2018-09-15 19:27:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:27:00,143 INFO L93 Difference]: Finished difference Result 1561 states and 2167 transitions. [2018-09-15 19:27:00,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-15 19:27:00,149 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 191 [2018-09-15 19:27:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:27:00,155 INFO L225 Difference]: With dead ends: 1561 [2018-09-15 19:27:00,156 INFO L226 Difference]: Without dead ends: 1207 [2018-09-15 19:27:00,158 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-09-15 19:27:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-09-15 19:27:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-09-15 19:27:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-15 19:27:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1418 transitions. [2018-09-15 19:27:00,217 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1418 transitions. Word has length 191 [2018-09-15 19:27:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:27:00,218 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1418 transitions. [2018-09-15 19:27:00,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-15 19:27:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1418 transitions. [2018-09-15 19:27:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-15 19:27:00,222 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:27:00,222 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:27:00,223 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:27:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash -80112521, now seen corresponding path program 1 times [2018-09-15 19:27:00,223 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:27:00,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-09-15 19:27:00,224 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], [349], [351], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:27:00,234 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:27:00,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:27:01,736 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:27:08,624 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:27:08,625 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:27:08,629 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:27:10,357 INFO L232 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 73.68% of their original sizes. [2018-09-15 19:27:10,357 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:27:10,824 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:27:10,824 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:27:10,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 19:27:10,824 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:27:10,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 19:27:10,825 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 19:27:10,825 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 19:27:10,825 INFO L87 Difference]: Start difference. First operand 1205 states and 1418 transitions. Second operand 11 states. [2018-09-15 19:27:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:27:21,541 INFO L93 Difference]: Finished difference Result 1717 states and 2233 transitions. [2018-09-15 19:27:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 19:27:21,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 203 [2018-09-15 19:27:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:27:21,549 INFO L225 Difference]: With dead ends: 1717 [2018-09-15 19:27:21,549 INFO L226 Difference]: Without dead ends: 1363 [2018-09-15 19:27:21,551 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-09-15 19:27:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-09-15 19:27:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1353. [2018-09-15 19:27:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-09-15 19:27:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1584 transitions. [2018-09-15 19:27:21,613 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1584 transitions. Word has length 203 [2018-09-15 19:27:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:27:21,613 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 1584 transitions. [2018-09-15 19:27:21,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 19:27:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1584 transitions. [2018-09-15 19:27:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-15 19:27:21,618 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:27:21,618 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:27:21,618 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:27:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1194693551, now seen corresponding path program 1 times [2018-09-15 19:27:21,619 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:27:21,619 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-15 19:27:21,620 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], [349], [351], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:27:21,623 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:27:21,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:27:23,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:27:42,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:27:42,018 INFO L272 AbstractInterpreter]: Visited 88 different actions 511 times. Merged at 7 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:27:42,022 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:27:44,401 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.66% of their original sizes. [2018-09-15 19:27:44,401 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:27:45,573 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:27:45,573 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:27:45,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 19:27:45,574 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:27:45,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 19:27:45,575 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 19:27:45,575 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-15 19:27:45,575 INFO L87 Difference]: Start difference. First operand 1353 states and 1584 transitions. Second operand 15 states. [2018-09-15 19:27:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:27:58,712 INFO L93 Difference]: Finished difference Result 2559 states and 3382 transitions. [2018-09-15 19:27:58,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 19:27:58,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2018-09-15 19:27:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:27:58,736 INFO L225 Difference]: With dead ends: 2559 [2018-09-15 19:27:58,736 INFO L226 Difference]: Without dead ends: 2057 [2018-09-15 19:27:58,739 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-09-15 19:27:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2018-09-15 19:27:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2037. [2018-09-15 19:27:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-09-15 19:27:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2424 transitions. [2018-09-15 19:27:58,838 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2424 transitions. Word has length 207 [2018-09-15 19:27:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:27:58,839 INFO L480 AbstractCegarLoop]: Abstraction has 2037 states and 2424 transitions. [2018-09-15 19:27:58,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 19:27:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2424 transitions. [2018-09-15 19:27:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-15 19:27:58,845 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:27:58,845 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:27:58,846 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:27:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1191040136, now seen corresponding path program 1 times [2018-09-15 19:27:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:27:58,846 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-09-15 19:27:58,847 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:27:58,850 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:27:58,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:28:00,327 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:28:20,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 19:28:20,672 INFO L272 AbstractInterpreter]: Visited 122 different actions 357 times. Merged at 7 different actions 15 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:28:20,682 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 19:28:20,722 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 19:28:20,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:28:20 BoogieIcfgContainer [2018-09-15 19:28:20,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 19:28:20,723 INFO L168 Benchmark]: Toolchain (without parser) took 179777.97 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 19:28:20,725 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 19:28:20,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-15 19:28:20,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 19:28:20,727 INFO L168 Benchmark]: Boogie Preprocessor took 302.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -877.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2018-09-15 19:28:20,728 INFO L168 Benchmark]: RCFGBuilder took 3421.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2018-09-15 19:28:20,729 INFO L168 Benchmark]: TraceAbstraction took 175198.42 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-15 19:28:20,734 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.84 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 121.56 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 302.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -877.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3421.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 175198.42 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). 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: 151]: 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 TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND TRUE (((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) [L151] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 175.1s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 66.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1437 SDtfs, 5779 SDslu, 2588 SDs, 0 SdLazy, 13315 SolverSat, 1369 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.0s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1151 GetRequests, 1013 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2037occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 89.5s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9937970164477874 AbsIntWeakeningRatio, 0.13456221198156681 AbsIntAvgWeakeningVarsNumRemoved, 120.35299539170506 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 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_label40_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_19-28-20-750.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label40_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_19-28-20-750.csv Received shutdown request...