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/Problem10_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 18:56:03,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 18:56:03,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 18:56:03,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 18:56:03,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 18:56:03,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 18:56:03,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 18:56:03,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 18:56:03,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 18:56:03,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 18:56:03,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 18:56:03,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 18:56:03,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 18:56:03,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 18:56:03,559 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 18:56:03,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 18:56:03,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 18:56:03,563 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 18:56:03,565 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 18:56:03,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 18:56:03,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 18:56:03,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 18:56:03,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 18:56:03,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 18:56:03,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 18:56:03,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 18:56:03,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 18:56:03,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 18:56:03,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 18:56:03,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 18:56:03,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 18:56:03,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 18:56:03,578 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 18:56:03,578 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 18:56:03,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 18:56:03,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 18:56:03,580 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-11 18:56:03,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 18:56:03,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 18:56:03,599 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 18:56:03,600 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 18:56:03,600 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 18:56:03,600 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 18:56:03,600 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 18:56:03,604 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-11 18:56:03,604 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-11 18:56:03,604 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 18:56:03,604 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 18:56:03,604 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 18:56:03,605 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 18:56:03,605 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 18:56:03,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 18:56:03,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 18:56:03,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 18:56:03,607 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 18:56:03,607 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 18:56:03,607 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 18:56:03,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 18:56:03,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 18:56:03,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 18:56:03,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 18:56:03,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 18:56:03,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 18:56:03,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 18:56:03,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 18:56:03,610 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 18:56:03,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 18:56:03,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 18:56:03,611 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 18:56:03,611 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 18:56:03,611 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 18:56:03,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 18:56:03,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 18:56:03,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 18:56:03,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 18:56:03,682 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 18:56:03,683 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label05_true-unreach-call.c [2018-09-11 18:56:04,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0b64a8c/acfec866a9774a3ba42202d13a02c268/FLAG5eb8188fb [2018-09-11 18:56:04,351 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 18:56:04,354 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label05_true-unreach-call.c [2018-09-11 18:56:04,373 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0b64a8c/acfec866a9774a3ba42202d13a02c268/FLAG5eb8188fb [2018-09-11 18:56:04,396 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0b64a8c/acfec866a9774a3ba42202d13a02c268 [2018-09-11 18:56:04,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 18:56:04,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 18:56:04,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 18:56:04,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 18:56:04,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 18:56:04,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 06:56:04" (1/1) ... [2018-09-11 18:56:04,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc2c2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:04, skipping insertion in model container [2018-09-11 18:56:04,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 06:56:04" (1/1) ... [2018-09-11 18:56:04,677 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 18:56:04,995 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 18:56:05,014 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 18:56:05,153 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 18:56:05,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05 WrapperNode [2018-09-11 18:56:05,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 18:56:05,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 18:56:05,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 18:56:05,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 18:56:05,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 18:56:05,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 18:56:05,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 18:56:05,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 18:56:05,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (1/1) ... [2018-09-11 18:56:05,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 18:56:05,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 18:56:05,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 18:56:05,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 18:56:05,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (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-11 18:56:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 18:56:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 18:56:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 18:56:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 18:56:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 18:56:05,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 18:56:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 18:56:05,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 18:56:09,173 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 18:56:09,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 06:56:09 BoogieIcfgContainer [2018-09-11 18:56:09,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 18:56:09,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 18:56:09,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 18:56:09,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 18:56:09,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 06:56:04" (1/3) ... [2018-09-11 18:56:09,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f820c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 06:56:09, skipping insertion in model container [2018-09-11 18:56:09,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:56:05" (2/3) ... [2018-09-11 18:56:09,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f820c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 06:56:09, skipping insertion in model container [2018-09-11 18:56:09,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 06:56:09" (3/3) ... [2018-09-11 18:56:09,182 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label05_true-unreach-call.c [2018-09-11 18:56:09,192 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 18:56:09,200 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 18:56:09,252 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 18:56:09,253 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 18:56:09,253 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 18:56:09,253 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 18:56:09,253 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 18:56:09,254 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 18:56:09,254 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 18:56:09,254 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 18:56:09,254 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 18:56:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-11 18:56:09,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-11 18:56:09,298 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:09,300 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 18:56:09,301 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1746557377, now seen corresponding path program 1 times [2018-09-11 18:56:09,312 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:09,313 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-09-11 18:56:09,316 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-11 18:56:09,353 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:09,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:09,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:56:09,548 INFO L272 AbstractInterpreter]: Visited 58 different actions 58 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-11 18:56:09,596 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:56:09,787 INFO L232 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 75.53% of their original sizes. [2018-09-11 18:56:09,788 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:56:09,909 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:56:09,910 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:56:09,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-11 18:56:09,911 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:56:09,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-11 18:56:09,924 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-11 18:56:09,925 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-11 18:56:09,927 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 5 states. [2018-09-11 18:56:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:56:12,056 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-11 18:56:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-11 18:56:12,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-09-11 18:56:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:56:12,076 INFO L225 Difference]: With dead ends: 576 [2018-09-11 18:56:12,076 INFO L226 Difference]: Without dead ends: 358 [2018-09-11 18:56:12,083 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 55 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-11 18:56:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-11 18:56:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-11 18:56:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-11 18:56:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-11 18:56:12,153 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 59 [2018-09-11 18:56:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:56:12,153 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-11 18:56:12,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-11 18:56:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-11 18:56:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-11 18:56:12,161 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:12,161 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-11 18:56:12,162 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:12,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1006827731, now seen corresponding path program 1 times [2018-09-11 18:56:12,162 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:12,163 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-09-11 18:56:12,163 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:56:12,168 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:12,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:12,325 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:56:12,325 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-11 18:56:12,366 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:56:12,606 INFO L232 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 74.1% of their original sizes. [2018-09-11 18:56:12,606 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:56:13,030 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:56:13,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:56:13,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:56:13,031 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:56:13,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:56:13,032 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:56:13,033 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:56:13,033 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 9 states. [2018-09-11 18:56:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:56:16,433 INFO L93 Difference]: Finished difference Result 719 states and 1134 transitions. [2018-09-11 18:56:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:56:16,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2018-09-11 18:56:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:56:16,442 INFO L225 Difference]: With dead ends: 719 [2018-09-11 18:56:16,443 INFO L226 Difference]: Without dead ends: 513 [2018-09-11 18:56:16,445 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 136 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:56:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-11 18:56:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504. [2018-09-11 18:56:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-11 18:56:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 662 transitions. [2018-09-11 18:56:16,477 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 662 transitions. Word has length 130 [2018-09-11 18:56:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:56:16,478 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 662 transitions. [2018-09-11 18:56:16,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:56:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 662 transitions. [2018-09-11 18:56:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-11 18:56:16,485 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:16,485 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:56:16,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash -846934132, now seen corresponding path program 1 times [2018-09-11 18:56:16,488 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:16,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-09-11 18:56:16,492 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:56:16,495 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:16,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:16,597 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:56:16,598 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-11 18:56:16,634 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:56:16,797 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 74.08% of their original sizes. [2018-09-11 18:56:16,798 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:56:17,272 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:56:17,272 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:56:17,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:56:17,273 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:56:17,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:56:17,274 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:56:17,274 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:56:17,274 INFO L87 Difference]: Start difference. First operand 504 states and 662 transitions. Second operand 9 states. [2018-09-11 18:56:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:56:20,447 INFO L93 Difference]: Finished difference Result 1139 states and 1712 transitions. [2018-09-11 18:56:20,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-11 18:56:20,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-09-11 18:56:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:56:20,453 INFO L225 Difference]: With dead ends: 1139 [2018-09-11 18:56:20,453 INFO L226 Difference]: Without dead ends: 785 [2018-09-11 18:56:20,456 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:56:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-09-11 18:56:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 778. [2018-09-11 18:56:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-09-11 18:56:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 957 transitions. [2018-09-11 18:56:20,489 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 957 transitions. Word has length 139 [2018-09-11 18:56:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:56:20,490 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 957 transitions. [2018-09-11 18:56:20,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:56:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 957 transitions. [2018-09-11 18:56:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-11 18:56:20,496 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:20,496 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:56:20,497 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1729493868, now seen corresponding path program 1 times [2018-09-11 18:56:20,497 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:20,497 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-09-11 18:56:20,498 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:56:20,501 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:20,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:20,649 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:56:20,649 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-11 18:56:20,686 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:56:20,880 INFO L232 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 73.8% of their original sizes. [2018-09-11 18:56:20,881 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:56:21,285 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:56:21,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:56:21,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:56:21,286 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:56:21,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:56:21,287 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:56:21,287 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:56:21,288 INFO L87 Difference]: Start difference. First operand 778 states and 957 transitions. Second operand 9 states. [2018-09-11 18:56:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:56:27,171 INFO L93 Difference]: Finished difference Result 1563 states and 2059 transitions. [2018-09-11 18:56:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:56:27,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2018-09-11 18:56:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:56:27,180 INFO L225 Difference]: With dead ends: 1563 [2018-09-11 18:56:27,180 INFO L226 Difference]: Without dead ends: 935 [2018-09-11 18:56:27,183 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:56:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-09-11 18:56:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 928. [2018-09-11 18:56:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-09-11 18:56:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1133 transitions. [2018-09-11 18:56:27,226 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1133 transitions. Word has length 175 [2018-09-11 18:56:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:56:27,227 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1133 transitions. [2018-09-11 18:56:27,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:56:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1133 transitions. [2018-09-11 18:56:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-11 18:56:27,232 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:27,232 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:56:27,233 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1509450413, now seen corresponding path program 1 times [2018-09-11 18:56:27,233 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:27,234 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-09-11 18:56:27,235 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:56:27,245 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:27,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:27,428 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:56:27,428 INFO L272 AbstractInterpreter]: Visited 142 different actions 414 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-11 18:56:27,459 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:56:27,564 INFO L232 lantSequenceWeakener]: Weakened 191 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-11 18:56:27,565 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:56:28,000 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:56:28,000 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:56:28,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:56:28,000 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:56:28,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:56:28,001 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:56:28,002 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:56:28,002 INFO L87 Difference]: Start difference. First operand 928 states and 1133 transitions. Second operand 9 states. [2018-09-11 18:56:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:56:30,832 INFO L93 Difference]: Finished difference Result 1942 states and 2573 transitions. [2018-09-11 18:56:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:56:30,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2018-09-11 18:56:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:56:30,844 INFO L225 Difference]: With dead ends: 1942 [2018-09-11 18:56:30,845 INFO L226 Difference]: Without dead ends: 1164 [2018-09-11 18:56:30,848 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:56:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-09-11 18:56:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1157. [2018-09-11 18:56:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-09-11 18:56:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1390 transitions. [2018-09-11 18:56:30,892 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1390 transitions. Word has length 194 [2018-09-11 18:56:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:56:30,893 INFO L480 AbstractCegarLoop]: Abstraction has 1157 states and 1390 transitions. [2018-09-11 18:56:30,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:56:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1390 transitions. [2018-09-11 18:56:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-11 18:56:30,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:30,899 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 18:56:30,899 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash -465748319, now seen corresponding path program 1 times [2018-09-11 18:56:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:30,900 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-09-11 18:56:30,900 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:56:30,904 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:30,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:30,996 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:56:30,996 INFO L272 AbstractInterpreter]: Visited 95 different actions 368 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-11 18:56:31,039 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:56:31,154 INFO L232 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 75.92% of their original sizes. [2018-09-11 18:56:31,155 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:56:31,422 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:56:31,423 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:56:31,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:56:31,423 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:56:31,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:56:31,424 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:56:31,424 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:56:31,424 INFO L87 Difference]: Start difference. First operand 1157 states and 1390 transitions. Second operand 9 states. [2018-09-11 18:56:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:56:33,584 INFO L93 Difference]: Finished difference Result 2420 states and 3040 transitions. [2018-09-11 18:56:33,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:56:33,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2018-09-11 18:56:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:56:33,601 INFO L225 Difference]: With dead ends: 2420 [2018-09-11 18:56:33,602 INFO L226 Difference]: Without dead ends: 1413 [2018-09-11 18:56:33,605 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:56:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2018-09-11 18:56:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1392. [2018-09-11 18:56:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-09-11 18:56:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1678 transitions. [2018-09-11 18:56:33,653 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1678 transitions. Word has length 217 [2018-09-11 18:56:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:56:33,654 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1678 transitions. [2018-09-11 18:56:33,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:56:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1678 transitions. [2018-09-11 18:56:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-11 18:56:33,663 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:33,663 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 18:56:33,664 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1222408203, now seen corresponding path program 1 times [2018-09-11 18:56:33,664 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:33,664 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-09-11 18:56:33,665 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:56:33,667 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:33,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:33,793 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:56:33,793 INFO L272 AbstractInterpreter]: Visited 121 different actions 472 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-11 18:56:33,826 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:56:33,926 INFO L232 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 75.82% of their original sizes. [2018-09-11 18:56:33,926 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:56:34,365 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:56:34,366 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:56:34,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:56:34,366 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:56:34,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:56:34,367 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:56:34,367 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:56:34,367 INFO L87 Difference]: Start difference. First operand 1392 states and 1678 transitions. Second operand 9 states. [2018-09-11 18:56:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:56:37,724 INFO L93 Difference]: Finished difference Result 3072 states and 3947 transitions. [2018-09-11 18:56:37,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:56:37,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 243 [2018-09-11 18:56:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:56:37,740 INFO L225 Difference]: With dead ends: 3072 [2018-09-11 18:56:37,740 INFO L226 Difference]: Without dead ends: 1830 [2018-09-11 18:56:37,745 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 249 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:56:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-09-11 18:56:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1796. [2018-09-11 18:56:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-09-11 18:56:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2263 transitions. [2018-09-11 18:56:37,798 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2263 transitions. Word has length 243 [2018-09-11 18:56:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:56:37,799 INFO L480 AbstractCegarLoop]: Abstraction has 1796 states and 2263 transitions. [2018-09-11 18:56:37,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:56:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2263 transitions. [2018-09-11 18:56:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-11 18:56:37,807 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:56:37,807 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 18:56:37,807 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:56:37,808 INFO L82 PathProgramCache]: Analyzing trace with hash 852438148, now seen corresponding path program 1 times [2018-09-11 18:56:37,808 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:56:37,808 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2018-09-11 18:56:37,808 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:56:37,811 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:56:37,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:56:37,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 18:56:37,982 INFO L272 AbstractInterpreter]: Visited 125 different actions 365 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-11 18:56:38,003 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 18:56:38,042 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 18:56:38,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 06:56:38 BoogieIcfgContainer [2018-09-11 18:56:38,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 18:56:38,044 INFO L168 Benchmark]: Toolchain (without parser) took 33634.65 ms. Allocated memory was 1.6 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -321.5 MB). Peak memory consumption was 806.2 MB. Max. memory is 7.1 GB. [2018-09-11 18:56:38,046 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-11 18:56:38,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-11 18:56:38,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.03 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-11 18:56:38,048 INFO L168 Benchmark]: Boogie Preprocessor took 208.21 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 791.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-11 18:56:38,049 INFO L168 Benchmark]: RCFGBuilder took 3650.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 132.1 MB). Peak memory consumption was 132.1 MB. Max. memory is 7.1 GB. [2018-09-11 18:56:38,050 INFO L168 Benchmark]: TraceAbstraction took 28868.42 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 336.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 379.1 MB). Peak memory consumption was 715.7 MB. Max. memory is 7.1 GB. [2018-09-11 18:56:38,055 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.03 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 208.21 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 791.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3650.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 132.1 MB). Peak memory consumption was 132.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28868.42 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 336.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 379.1 MB). Peak memory consumption was 715.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 160]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L222] a19 = 10 [L224] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND TRUE (((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)) [L160] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 28.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1360 SDtfs, 4719 SDslu, 1400 SDs, 0 SdLazy, 9699 SolverSat, 1439 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1192 GetRequests, 1105 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1796occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9968805899436691 AbsIntWeakeningRatio, 0.12695652173913044 AbsIntAvgWeakeningVarsNumRemoved, 9.335652173913044 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 87 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label05_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_18-56-38-071.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label05_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_18-56-38-071.csv Received shutdown request...