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_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 14:13:09,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 14:13:09,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 14:13:09,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 14:13:09,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 14:13:09,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 14:13:09,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 14:13:09,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 14:13:09,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 14:13:09,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 14:13:09,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 14:13:09,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 14:13:09,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 14:13:09,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 14:13:09,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 14:13:09,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 14:13:09,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 14:13:09,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 14:13:09,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 14:13:09,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 14:13:09,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 14:13:09,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 14:13:09,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 14:13:09,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 14:13:09,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 14:13:09,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 14:13:09,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 14:13:09,518 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 14:13:09,519 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 14:13:09,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 14:13:09,520 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 14:13:09,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 14:13:09,521 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 14:13:09,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 14:13:09,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 14:13:09,524 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 14:13:09,524 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-15 14:13:09,551 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 14:13:09,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 14:13:09,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 14:13:09,553 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 14:13:09,553 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 14:13:09,554 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 14:13:09,554 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 14:13:09,554 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 14:13:09,554 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 14:13:09,556 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-15 14:13:09,556 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 14:13:09,558 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 14:13:09,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 14:13:09,559 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 14:13:09,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 14:13:09,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 14:13:09,560 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 14:13:09,560 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 14:13:09,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 14:13:09,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 14:13:09,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 14:13:09,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 14:13:09,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 14:13:09,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 14:13:09,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 14:13:09,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 14:13:09,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 14:13:09,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 14:13:09,563 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 14:13:09,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 14:13:09,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 14:13:09,564 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 14:13:09,564 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 14:13:09,564 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 14:13:09,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 14:13:09,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 14:13:09,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 14:13:09,635 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 14:13:09,636 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 14:13:09,637 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c [2018-09-15 14:13:09,989 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac143a8f3/157a3faf579b4923935d1932c2e4f3a2/FLAG0be66a342 [2018-09-15 14:13:10,321 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 14:13:10,327 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c [2018-09-15 14:13:10,345 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac143a8f3/157a3faf579b4923935d1932c2e4f3a2/FLAG0be66a342 [2018-09-15 14:13:10,363 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac143a8f3/157a3faf579b4923935d1932c2e4f3a2 [2018-09-15 14:13:10,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 14:13:10,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 14:13:10,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 14:13:10,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 14:13:10,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 14:13:10,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 02:13:10" (1/1) ... [2018-09-15 14:13:10,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4566f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:10, skipping insertion in model container [2018-09-15 14:13:10,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 02:13:10" (1/1) ... [2018-09-15 14:13:10,411 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 14:13:10,951 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 14:13:10,970 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 14:13:11,204 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 14:13:11,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11 WrapperNode [2018-09-15 14:13:11,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 14:13:11,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 14:13:11,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 14:13:11,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 14:13:11,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 14:13:11,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 14:13:11,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 14:13:11,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 14:13:11,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (1/1) ... [2018-09-15 14:13:11,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 14:13:11,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 14:13:11,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 14:13:11,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 14:13:11,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (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 14:13:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 14:13:11,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 14:13:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 14:13:11,724 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 14:13:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 14:13:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 14:13:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 14:13:11,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 14:13:15,291 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 14:13:15,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 02:13:15 BoogieIcfgContainer [2018-09-15 14:13:15,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 14:13:15,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 14:13:15,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 14:13:15,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 14:13:15,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 02:13:10" (1/3) ... [2018-09-15 14:13:15,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdc1c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 02:13:15, skipping insertion in model container [2018-09-15 14:13:15,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:13:11" (2/3) ... [2018-09-15 14:13:15,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdc1c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 02:13:15, skipping insertion in model container [2018-09-15 14:13:15,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 02:13:15" (3/3) ... [2018-09-15 14:13:15,302 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label17_true-unreach-call.c [2018-09-15 14:13:15,315 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 14:13:15,328 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 14:13:15,389 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 14:13:15,390 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 14:13:15,391 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 14:13:15,391 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 14:13:15,391 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 14:13:15,391 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 14:13:15,392 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 14:13:15,392 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 14:13:15,392 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 14:13:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 14:13:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-15 14:13:15,429 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:13:15,430 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] [2018-09-15 14:13:15,432 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:13:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1893194825, now seen corresponding path program 1 times [2018-09-15 14:13:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:13:15,442 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-09-15 14:13:15,445 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], [197], [199], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 14:13:15,491 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:13:15,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 14:13:18,000 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 14:13:18,002 INFO L272 AbstractInterpreter]: Visited 36 different actions 36 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 14:13:18,050 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 14:13:19,473 INFO L232 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 74.3% of their original sizes. [2018-09-15 14:13:19,473 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 14:13:19,727 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 14:13:19,729 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 14:13:19,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 14:13:19,730 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 14:13:19,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 14:13:19,745 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 14:13:19,746 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 14:13:19,748 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 14:13:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 14:13:22,488 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 14:13:22,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 14:13:22,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-09-15 14:13:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 14:13:22,508 INFO L225 Difference]: With dead ends: 576 [2018-09-15 14:13:22,508 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 14:13:22,517 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 14:13:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 14:13:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 14:13:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 14:13:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 14:13:22,590 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 37 [2018-09-15 14:13:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 14:13:22,590 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 14:13:22,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 14:13:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 14:13:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-15 14:13:22,596 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:13:22,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:13:22,597 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:13:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1004761221, now seen corresponding path program 1 times [2018-09-15 14:13:22,597 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:13:22,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2018-09-15 14:13:22,598 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 14:13:22,607 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:13:22,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 14:13:26,162 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 14:13:32,370 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 14:13:32,371 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 14:13:32,416 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 14:13:40,629 INFO L232 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-15 14:13:40,629 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 14:13:40,761 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 14:13:40,762 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 14:13:40,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 14:13:40,762 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 14:13:40,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 14:13:40,764 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 14:13:40,764 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 14:13:40,764 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 14:13:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 14:13:43,940 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 14:13:43,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 14:13:43,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-09-15 14:13:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 14:13:43,950 INFO L225 Difference]: With dead ends: 711 [2018-09-15 14:13:43,950 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 14:13:43,953 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 14:13:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 14:13:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 14:13:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 14:13:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 14:13:43,990 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 108 [2018-09-15 14:13:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 14:13:43,991 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 14:13:43,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 14:13:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 14:13:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-15 14:13:43,995 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:13:43,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:13:43,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:13:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1446169164, now seen corresponding path program 1 times [2018-09-15 14:13:43,996 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:13:43,996 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-09-15 14:13:43,997 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 14:13:44,001 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:13:44,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 14:14:25,151 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 14:15:10,617 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 14:15:10,618 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 14:15:10,631 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 14:15:55,484 INFO L232 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 73.31% of their original sizes. [2018-09-15 14:15:55,485 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 14:15:55,635 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 14:15:55,635 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 14:15:55,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 14:15:55,635 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 14:15:55,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 14:15:55,636 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 14:15:55,636 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 14:15:55,637 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 11 states. [2018-09-15 14:15:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 14:15:59,234 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 14:15:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 14:15:59,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2018-09-15 14:15:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 14:15:59,241 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 14:15:59,242 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 14:15:59,244 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 123 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 14:15:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 14:15:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 14:15:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 14:15:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 14:15:59,278 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 117 [2018-09-15 14:15:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 14:15:59,279 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 14:15:59,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 14:15:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 14:15:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-15 14:15:59,284 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:15:59,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:59,285 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:15:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1179733828, now seen corresponding path program 1 times [2018-09-15 14:15:59,285 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:15:59,286 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-09-15 14:15:59,286 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 14:15:59,291 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:15:59,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-15 14:17:19,548 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 14:17:19,549 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 14:17:19,550 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 14:17:19,575 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 14:17:19,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 02:17:19 BoogieIcfgContainer [2018-09-15 14:17:19,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 14:17:19,577 INFO L168 Benchmark]: Toolchain (without parser) took 249200.67 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -844.6 MB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-09-15 14:17:19,580 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 14:17:19,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 886.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-15 14:17:19,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-15 14:17:19,582 INFO L168 Benchmark]: Boogie Preprocessor took 240.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 735.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -827.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-15 14:17:19,584 INFO L168 Benchmark]: RCFGBuilder took 3647.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. [2018-09-15 14:17:19,585 INFO L168 Benchmark]: TraceAbstraction took 244282.67 ms. Allocated memory was 2.2 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -180.8 MB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-09-15 14:17:19,590 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 886.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 135.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 240.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 735.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -827.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3647.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244282.67 ms. Allocated memory was 2.2 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -180.8 MB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 94]: 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 FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND TRUE (((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)) [L94] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 244.1s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 9.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 627 SDtfs, 1515 SDslu, 849 SDs, 0 SdLazy, 4548 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=793occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 179.3s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9957157245977125 AbsIntWeakeningRatio, 0.2084942084942085 AbsIntAvgWeakeningVarsNumRemoved, 7.146718146718147 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 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_label17_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_14-17-19-605.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label17_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_14-17-19-605.csv Completed graceful shutdown