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_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label03_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 16:49:40,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 16:49:40,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 16:49:40,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 16:49:40,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 16:49:40,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 16:49:40,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 16:49:40,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 16:49:40,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 16:49:40,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 16:49:40,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 16:49:40,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 16:49:40,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 16:49:40,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 16:49:40,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 16:49:40,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 16:49:40,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 16:49:40,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 16:49:40,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 16:49:40,537 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 16:49:40,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 16:49:40,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 16:49:40,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 16:49:40,543 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 16:49:40,543 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 16:49:40,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 16:49:40,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 16:49:40,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 16:49:40,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 16:49:40,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 16:49:40,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 16:49:40,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 16:49:40,550 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 16:49:40,550 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 16:49:40,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 16:49:40,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 16:49:40,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-15 16:49:40,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 16:49:40,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 16:49:40,569 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 16:49:40,570 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 16:49:40,570 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 16:49:40,570 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 16:49:40,570 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 16:49:40,570 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 16:49:40,571 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-15 16:49:40,571 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 16:49:40,571 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 16:49:40,571 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 16:49:40,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 16:49:40,572 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 16:49:40,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 16:49:40,573 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 16:49:40,573 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 16:49:40,573 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 16:49:40,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 16:49:40,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 16:49:40,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 16:49:40,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 16:49:40,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 16:49:40,574 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 16:49:40,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 16:49:40,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 16:49:40,575 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 16:49:40,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 16:49:40,575 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 16:49:40,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 16:49:40,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 16:49:40,576 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 16:49:40,576 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 16:49:40,576 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 16:49:40,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 16:49:40,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 16:49:40,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 16:49:40,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 16:49:40,662 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 16:49:40,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label03_true-unreach-call.c [2018-09-15 16:49:41,009 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe424d29/d79b8b9b53e141c0be01370deec511b3/FLAG3457a168c [2018-09-15 16:49:41,372 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 16:49:41,373 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label03_true-unreach-call.c [2018-09-15 16:49:41,393 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe424d29/d79b8b9b53e141c0be01370deec511b3/FLAG3457a168c [2018-09-15 16:49:41,413 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe424d29/d79b8b9b53e141c0be01370deec511b3 [2018-09-15 16:49:41,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 16:49:41,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 16:49:41,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 16:49:41,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 16:49:41,443 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 16:49:41,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:49:41" (1/1) ... [2018-09-15 16:49:41,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58150d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:41, skipping insertion in model container [2018-09-15 16:49:41,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:49:41" (1/1) ... [2018-09-15 16:49:41,457 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 16:49:42,149 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 16:49:42,176 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 16:49:42,393 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 16:49:42,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42 WrapperNode [2018-09-15 16:49:42,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 16:49:42,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 16:49:42,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 16:49:42,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 16:49:42,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:42,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:42,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 16:49:42,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 16:49:42,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 16:49:42,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 16:49:42,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:42,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:42,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:42,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:43,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:43,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:43,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (1/1) ... [2018-09-15 16:49:43,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 16:49:43,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 16:49:43,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 16:49:43,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 16:49:43,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (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 16:49:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 16:49:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 16:49:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 16:49:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 16:49:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 16:49:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 16:49:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 16:49:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 16:49:47,575 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 16:49:47,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:49:47 BoogieIcfgContainer [2018-09-15 16:49:47,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 16:49:47,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 16:49:47,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 16:49:47,580 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 16:49:47,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 04:49:41" (1/3) ... [2018-09-15 16:49:47,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cfec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:49:47, skipping insertion in model container [2018-09-15 16:49:47,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:49:42" (2/3) ... [2018-09-15 16:49:47,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cfec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:49:47, skipping insertion in model container [2018-09-15 16:49:47,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:49:47" (3/3) ... [2018-09-15 16:49:47,585 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label03_true-unreach-call.c [2018-09-15 16:49:47,593 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 16:49:47,602 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 16:49:47,661 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 16:49:47,664 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 16:49:47,665 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 16:49:47,665 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 16:49:47,665 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 16:49:47,665 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 16:49:47,665 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 16:49:47,666 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 16:49:47,666 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 16:49:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-15 16:49:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-15 16:49:47,712 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:49:47,713 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 16:49:47,714 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:49:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -509521591, now seen corresponding path program 1 times [2018-09-15 16:49:47,721 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:49:47,722 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-09-15 16:49:47,724 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], [1088], [1092], [1098], [1102], [1109], [1110], [1111], [1113] [2018-09-15 16:49:47,756 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:49:47,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:49:48,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:49:48,006 INFO L272 AbstractInterpreter]: Visited 36 different actions 36 times. Never merged. Never widened. Never found a fixpoint. Largest state had 27 variables. [2018-09-15 16:49:48,050 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:49:48,173 INFO L232 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 74.15% of their original sizes. [2018-09-15 16:49:48,174 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:49:48,335 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:49:48,336 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:49:48,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-15 16:49:48,337 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:49:48,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-15 16:49:48,351 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-15 16:49:48,352 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-15 16:49:48,355 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 5 states. [2018-09-15 16:49:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:49:51,246 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2018-09-15 16:49:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-15 16:49:51,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-09-15 16:49:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:49:51,273 INFO L225 Difference]: With dead ends: 776 [2018-09-15 16:49:51,273 INFO L226 Difference]: Without dead ends: 481 [2018-09-15 16:49:51,281 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-15 16:49:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-15 16:49:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2018-09-15 16:49:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-15 16:49:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 682 transitions. [2018-09-15 16:49:51,363 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 682 transitions. Word has length 37 [2018-09-15 16:49:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:49:51,364 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 682 transitions. [2018-09-15 16:49:51,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-15 16:49:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 682 transitions. [2018-09-15 16:49:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-15 16:49:51,372 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:49:51,373 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, 1] [2018-09-15 16:49:51,373 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:49:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -127502623, now seen corresponding path program 1 times [2018-09-15 16:49:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:49:51,374 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-09-15 16:49:51,375 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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 16:49:51,380 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:49:51,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:49:57,614 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:49:57,615 INFO L272 AbstractInterpreter]: Visited 124 different actions 242 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-15 16:49:57,620 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:50:04,317 INFO L232 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 73.47% of their original sizes. [2018-09-15 16:50:04,317 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:50:04,733 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:50:04,734 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:50:04,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:50:04,734 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:50:04,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:50:04,736 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:50:04,736 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:50:04,736 INFO L87 Difference]: Start difference. First operand 479 states and 682 transitions. Second operand 9 states. [2018-09-15 16:50:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:50:08,554 INFO L93 Difference]: Finished difference Result 957 states and 1542 transitions. [2018-09-15 16:50:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-15 16:50:08,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 154 [2018-09-15 16:50:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:50:08,561 INFO L225 Difference]: With dead ends: 957 [2018-09-15 16:50:08,561 INFO L226 Difference]: Without dead ends: 674 [2018-09-15 16:50:08,565 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-15 16:50:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-09-15 16:50:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 668. [2018-09-15 16:50:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-09-15 16:50:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 897 transitions. [2018-09-15 16:50:08,608 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 897 transitions. Word has length 154 [2018-09-15 16:50:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:50:08,610 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 897 transitions. [2018-09-15 16:50:08,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:50:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 897 transitions. [2018-09-15 16:50:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-15 16:50:08,617 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:50:08,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:50:08,617 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:50:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1431053005, now seen corresponding path program 1 times [2018-09-15 16:50:08,618 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:50:08,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-09-15 16:50:08,619 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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 16:50:08,623 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:50:08,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:50:12,577 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:50:12,577 INFO L272 AbstractInterpreter]: Visited 139 different actions 272 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-15 16:50:12,583 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:50:17,861 INFO L232 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 73.52% of their original sizes. [2018-09-15 16:50:17,861 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:50:18,178 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:50:18,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:50:18,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 16:50:18,179 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:50:18,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 16:50:18,180 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 16:50:18,180 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 16:50:18,181 INFO L87 Difference]: Start difference. First operand 668 states and 897 transitions. Second operand 11 states. [2018-09-15 16:50:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:50:22,875 INFO L93 Difference]: Finished difference Result 1350 states and 2149 transitions. [2018-09-15 16:50:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:50:22,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-09-15 16:50:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:50:22,897 INFO L225 Difference]: With dead ends: 1350 [2018-09-15 16:50:22,898 INFO L226 Difference]: Without dead ends: 1067 [2018-09-15 16:50:22,901 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-09-15 16:50:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-15 16:50:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1060. [2018-09-15 16:50:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-09-15 16:50:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1330 transitions. [2018-09-15 16:50:22,937 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1330 transitions. Word has length 169 [2018-09-15 16:50:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:50:22,938 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1330 transitions. [2018-09-15 16:50:22,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 16:50:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1330 transitions. [2018-09-15 16:50:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-15 16:50:22,950 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:50:22,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:22,950 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:50:22,951 INFO L82 PathProgramCache]: Analyzing trace with hash -680068510, now seen corresponding path program 1 times [2018-09-15 16:50:22,951 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:50:22,951 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-09-15 16:50:22,952 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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 16:50:22,959 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:50:22,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:50:27,564 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:50:27,564 INFO L272 AbstractInterpreter]: Visited 155 different actions 304 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-15 16:50:27,570 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:50:33,437 INFO L232 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-15 16:50:33,437 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:50:33,589 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:50:33,589 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:50:33,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:50:33,589 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:50:33,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:50:33,590 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:50:33,590 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:50:33,590 INFO L87 Difference]: Start difference. First operand 1060 states and 1330 transitions. Second operand 9 states. [2018-09-15 16:50:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:50:38,309 INFO L93 Difference]: Finished difference Result 1541 states and 2194 transitions. [2018-09-15 16:50:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-15 16:50:38,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 185 [2018-09-15 16:50:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:50:38,325 INFO L225 Difference]: With dead ends: 1541 [2018-09-15 16:50:38,325 INFO L226 Difference]: Without dead ends: 1258 [2018-09-15 16:50:38,327 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-15 16:50:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-09-15 16:50:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1254. [2018-09-15 16:50:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-09-15 16:50:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1551 transitions. [2018-09-15 16:50:38,364 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1551 transitions. Word has length 185 [2018-09-15 16:50:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:50:38,364 INFO L480 AbstractCegarLoop]: Abstraction has 1254 states and 1551 transitions. [2018-09-15 16:50:38,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:50:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1551 transitions. [2018-09-15 16:50:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-15 16:50:38,368 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:50:38,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:38,369 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:50:38,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1477432241, now seen corresponding path program 1 times [2018-09-15 16:50:38,369 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:50:38,370 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-15 16:50:38,370 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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [960], [971], [975], [979], [983], [987], [991], [1002], [1013], [1017], [1021], [1032], [1036], [1040], [1044], [1055], [1059], [1063], [1067], [1070], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 16:50:38,382 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:50:38,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:50:44,675 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:50:44,675 INFO L272 AbstractInterpreter]: Visited 193 different actions 380 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-15 16:50:44,718 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:50:51,516 INFO L232 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 75.17% of their original sizes. [2018-09-15 16:50:51,516 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:50:51,609 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:50:51,610 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:50:51,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:50:51,610 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:50:51,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:50:51,611 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:50:51,611 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:50:51,611 INFO L87 Difference]: Start difference. First operand 1254 states and 1551 transitions. Second operand 9 states. [2018-09-15 16:50:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:50:55,447 INFO L93 Difference]: Finished difference Result 1735 states and 2414 transitions. [2018-09-15 16:50:55,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-15 16:50:55,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 223 [2018-09-15 16:50:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:50:55,460 INFO L225 Difference]: With dead ends: 1735 [2018-09-15 16:50:55,460 INFO L226 Difference]: Without dead ends: 1452 [2018-09-15 16:50:55,462 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-15 16:50:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2018-09-15 16:50:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1447. [2018-09-15 16:50:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-09-15 16:50:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1769 transitions. [2018-09-15 16:50:55,498 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1769 transitions. Word has length 223 [2018-09-15 16:50:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:50:55,499 INFO L480 AbstractCegarLoop]: Abstraction has 1447 states and 1769 transitions. [2018-09-15 16:50:55,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:50:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1769 transitions. [2018-09-15 16:50:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-15 16:50:55,502 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:50:55,503 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:50:55,503 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:50:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash -67580676, now seen corresponding path program 1 times [2018-09-15 16:50:55,503 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:50:55,504 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-09-15 16:50:55,504 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], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 16:50:55,506 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:50:55,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:51:01,400 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:51:01,400 INFO L272 AbstractInterpreter]: Visited 125 different actions 368 times. Merged at 7 different actions 15 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-09-15 16:51:01,406 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:51:01,799 INFO L232 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.49% of their original sizes. [2018-09-15 16:51:01,799 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:51:01,893 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:51:01,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:51:01,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:51:01,893 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:51:01,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:51:01,894 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:51:01,894 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:51:01,895 INFO L87 Difference]: Start difference. First operand 1447 states and 1769 transitions. Second operand 9 states. [2018-09-15 16:51:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:51:06,638 INFO L93 Difference]: Finished difference Result 2473 states and 3395 transitions. [2018-09-15 16:51:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:51:06,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 228 [2018-09-15 16:51:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:51:06,649 INFO L225 Difference]: With dead ends: 2473 [2018-09-15 16:51:06,649 INFO L226 Difference]: Without dead ends: 2190 [2018-09-15 16:51:06,652 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:51:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2018-09-15 16:51:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2166. [2018-09-15 16:51:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2018-09-15 16:51:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2644 transitions. [2018-09-15 16:51:06,709 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2644 transitions. Word has length 228 [2018-09-15 16:51:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:51:06,709 INFO L480 AbstractCegarLoop]: Abstraction has 2166 states and 2644 transitions. [2018-09-15 16:51:06,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:51:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2644 transitions. [2018-09-15 16:51:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-15 16:51:06,713 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:51:06,714 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:51:06,714 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:51:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1810805753, now seen corresponding path program 1 times [2018-09-15 16:51:06,715 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:51:06,715 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-09-15 16:51:06,715 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], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 16:51:06,716 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:51:06,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:51:11,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 16:51:11,946 INFO L272 AbstractInterpreter]: Visited 126 different actions 369 times. Merged at 7 different actions 15 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-09-15 16:51:11,954 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 16:51:11,988 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 16:51:11,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 04:51:11 BoogieIcfgContainer [2018-09-15 16:51:11,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 16:51:11,990 INFO L168 Benchmark]: Toolchain (without parser) took 90562.47 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-15 16:51:11,991 INFO L168 Benchmark]: CDTParser took 0.16 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 16:51:11,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1051.39 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-15 16:51:11,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 178.25 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 16:51:11,994 INFO L168 Benchmark]: Boogie Preprocessor took 398.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -944.5 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. [2018-09-15 16:51:11,995 INFO L168 Benchmark]: RCFGBuilder took 4514.39 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 7.1 GB. [2018-09-15 16:51:11,996 INFO L168 Benchmark]: TraceAbstraction took 84412.30 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-15 16:51:12,001 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.16 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 1051.39 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 178.25 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 398.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -944.5 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4514.39 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84412.30 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: 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 inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; [L1031] int output = -1; [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) [L526] COND TRUE ((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15))) [L527] a29 = (((((a29 % 52)- -193) * 5) % 52)- -169) [L528] a25 = 12 [L530] RET return 26; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND TRUE ((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1)) [L241] a29 = ((((a29 / 5) % 15)+ 260) + 1) [L242] a23 = (((((a23 / 5) % 90)- -47) - -159208) - 159206) [L243] a4 = 1 [L244] a25 = 11 [L246] RET return -1; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15)) [L96] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. UNKNOWN Result, 84.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 24.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1694 SDtfs, 4893 SDslu, 2319 SDs, 0 SdLazy, 15358 SolverSat, 1475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 1023 GetRequests, 950 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2166occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 32.6s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.997563905498688 AbsIntWeakeningRatio, 0.13434343434343435 AbsIntAvgWeakeningVarsNumRemoved, 4.816161616161616 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 48 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label03_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_16-51-12-017.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label03_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_16-51-12-017.csv Received shutdown request...