java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label09_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 12:30:45,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 12:30:45,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 12:30:45,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 12:30:45,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 12:30:45,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 12:30:45,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 12:30:45,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 12:30:45,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 12:30:45,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 12:30:45,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 12:30:45,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 12:30:45,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 12:30:45,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 12:30:45,636 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 12:30:45,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 12:30:45,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 12:30:45,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 12:30:45,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 12:30:45,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 12:30:45,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 12:30:45,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 12:30:45,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 12:30:45,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 12:30:45,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 12:30:45,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 12:30:45,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 12:30:45,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 12:30:45,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 12:30:45,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 12:30:45,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 12:30:45,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 12:30:45,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 12:30:45,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 12:30:45,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 12:30:45,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 12:30:45,658 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 12:30:45,683 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 12:30:45,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 12:30:45,685 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 12:30:45,686 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 12:30:45,686 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 12:30:45,686 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 12:30:45,686 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 12:30:45,686 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 12:30:45,687 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 12:30:45,687 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 12:30:45,687 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 12:30:45,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 12:30:45,693 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 12:30:45,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 12:30:45,693 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 12:30:45,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 12:30:45,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 12:30:45,694 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 12:30:45,694 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 12:30:45,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 12:30:45,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 12:30:45,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 12:30:45,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 12:30:45,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:30:45,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 12:30:45,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 12:30:45,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 12:30:45,696 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 12:30:45,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 12:30:45,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 12:30:45,696 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 12:30:45,697 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 12:30:45,697 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 12:30:45,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 12:30:45,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 12:30:45,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 12:30:45,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 12:30:45,777 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 12:30:45,778 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label09_false-unreach-call.c [2018-07-24 12:30:46,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8966ef10c/0f1229d421cb43bdbe2c0de5d2d4f80a/FLAGc1852ef71 [2018-07-24 12:30:46,524 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 12:30:46,525 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label09_false-unreach-call.c [2018-07-24 12:30:46,558 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8966ef10c/0f1229d421cb43bdbe2c0de5d2d4f80a/FLAGc1852ef71 [2018-07-24 12:30:46,579 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8966ef10c/0f1229d421cb43bdbe2c0de5d2d4f80a [2018-07-24 12:30:46,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 12:30:46,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 12:30:46,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 12:30:46,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 12:30:46,607 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 12:30:46,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:30:46" (1/1) ... [2018-07-24 12:30:46,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a501a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:46, skipping insertion in model container [2018-07-24 12:30:46,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:30:46" (1/1) ... [2018-07-24 12:30:46,935 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 12:30:47,731 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:30:47,748 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 12:30:48,225 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:30:48,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48 WrapperNode [2018-07-24 12:30:48,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 12:30:48,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 12:30:48,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 12:30:48,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 12:30:48,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:48,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:48,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 12:30:48,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 12:30:48,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 12:30:48,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 12:30:48,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:48,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:49,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:49,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:49,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:49,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:49,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (1/1) ... [2018-07-24 12:30:49,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 12:30:49,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 12:30:49,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 12:30:49,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 12:30:49,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (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-07-24 12:30:49,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 12:30:49,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 12:30:49,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 12:30:49,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 12:30:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 12:30:49,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 12:30:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output2 [2018-07-24 12:30:49,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output2 [2018-07-24 12:30:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output3 [2018-07-24 12:30:49,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output3 [2018-07-24 12:30:49,269 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 12:30:49,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 12:30:58,143 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 12:30:58,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:30:58 BoogieIcfgContainer [2018-07-24 12:30:58,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 12:30:58,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 12:30:58,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 12:30:58,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 12:30:58,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:30:46" (1/3) ... [2018-07-24 12:30:58,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a9084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:30:58, skipping insertion in model container [2018-07-24 12:30:58,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:30:48" (2/3) ... [2018-07-24 12:30:58,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a9084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:30:58, skipping insertion in model container [2018-07-24 12:30:58,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:30:58" (3/3) ... [2018-07-24 12:30:58,153 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label09_false-unreach-call.c [2018-07-24 12:30:58,163 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 12:30:58,172 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 12:30:58,232 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 12:30:58,233 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 12:30:58,233 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 12:30:58,233 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 12:30:58,233 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 12:30:58,234 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 12:30:58,234 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 12:30:58,234 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 12:30:58,234 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 12:30:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-07-24 12:30:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-24 12:30:58,278 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:30:58,279 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:30:58,279 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:30:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash -388026969, now seen corresponding path program 1 times [2018-07-24 12:30:58,288 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:30:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:58,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:58,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:30:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:58,685 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:30:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:30:58,714 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:30:58,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:30:58,714 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:30:58,720 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:30:58,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:30:58,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:30:58,734 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-07-24 12:31:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:07,149 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-07-24 12:31:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:31:07,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-24 12:31:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:07,183 INFO L225 Difference]: With dead ends: 2251 [2018-07-24 12:31:07,183 INFO L226 Difference]: Without dead ends: 1474 [2018-07-24 12:31:07,200 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:31:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-07-24 12:31:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-07-24 12:31:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-07-24 12:31:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2800 transitions. [2018-07-24 12:31:07,365 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2800 transitions. Word has length 17 [2018-07-24 12:31:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:07,366 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2800 transitions. [2018-07-24 12:31:07,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:31:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2800 transitions. [2018-07-24 12:31:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-24 12:31:07,371 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:07,371 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 12:31:07,372 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1898259944, now seen corresponding path program 1 times [2018-07-24 12:31:07,372 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:07,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:07,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:07,374 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:31:07,619 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:31:07,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:31:07,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:07,621 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:31:07,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:31:07,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:31:07,622 INFO L87 Difference]: Start difference. First operand 1474 states and 2800 transitions. Second operand 5 states. [2018-07-24 12:31:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:16,349 INFO L93 Difference]: Finished difference Result 4419 states and 8483 transitions. [2018-07-24 12:31:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:31:16,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-07-24 12:31:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:16,371 INFO L225 Difference]: With dead ends: 4419 [2018-07-24 12:31:16,371 INFO L226 Difference]: Without dead ends: 2951 [2018-07-24 12:31:16,377 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:31:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2018-07-24 12:31:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2925. [2018-07-24 12:31:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-07-24 12:31:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 5205 transitions. [2018-07-24 12:31:16,474 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 5205 transitions. Word has length 87 [2018-07-24 12:31:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:16,475 INFO L471 AbstractCegarLoop]: Abstraction has 2925 states and 5205 transitions. [2018-07-24 12:31:16,475 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:31:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 5205 transitions. [2018-07-24 12:31:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-24 12:31:16,482 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:16,483 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 12:31:16,483 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:16,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1948335269, now seen corresponding path program 1 times [2018-07-24 12:31:16,484 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:16,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:16,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:16,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:16,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:31:16,727 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:31:16,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:31:16,727 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:16,728 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:31:16,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:31:16,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:31:16,729 INFO L87 Difference]: Start difference. First operand 2925 states and 5205 transitions. Second operand 5 states. [2018-07-24 12:31:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:22,905 INFO L93 Difference]: Finished difference Result 7345 states and 13001 transitions. [2018-07-24 12:31:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:31:22,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-07-24 12:31:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:22,936 INFO L225 Difference]: With dead ends: 7345 [2018-07-24 12:31:22,936 INFO L226 Difference]: Without dead ends: 4426 [2018-07-24 12:31:22,945 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:31:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2018-07-24 12:31:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4391. [2018-07-24 12:31:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4391 states. [2018-07-24 12:31:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 6473 transitions. [2018-07-24 12:31:23,074 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 6473 transitions. Word has length 88 [2018-07-24 12:31:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 4391 states and 6473 transitions. [2018-07-24 12:31:23,075 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:31:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 6473 transitions. [2018-07-24 12:31:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-24 12:31:23,077 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:23,077 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 12:31:23,078 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash 973203593, now seen corresponding path program 1 times [2018-07-24 12:31:23,078 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:23,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:23,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:23,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:23,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:23,341 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:31:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:31:23,401 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:31:23,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:31:23,402 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:23,402 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:31:23,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:31:23,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:31:23,403 INFO L87 Difference]: Start difference. First operand 4391 states and 6473 transitions. Second operand 6 states. [2018-07-24 12:31:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:29,276 INFO L93 Difference]: Finished difference Result 11801 states and 17592 transitions. [2018-07-24 12:31:29,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:31:29,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-07-24 12:31:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:29,324 INFO L225 Difference]: With dead ends: 11801 [2018-07-24 12:31:29,325 INFO L226 Difference]: Without dead ends: 7416 [2018-07-24 12:31:29,338 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:31:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7416 states. [2018-07-24 12:31:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7416 to 7323. [2018-07-24 12:31:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7323 states. [2018-07-24 12:31:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7323 states to 7323 states and 10451 transitions. [2018-07-24 12:31:29,530 INFO L78 Accepts]: Start accepts. Automaton has 7323 states and 10451 transitions. Word has length 90 [2018-07-24 12:31:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 7323 states and 10451 transitions. [2018-07-24 12:31:29,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:31:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7323 states and 10451 transitions. [2018-07-24 12:31:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-24 12:31:29,533 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:29,533 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:31:29,533 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash 871286544, now seen corresponding path program 1 times [2018-07-24 12:31:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:29,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:29,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:29,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:31:29,999 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:29,999 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:31:30,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:30,020 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:30,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:31:30,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:31:31,498 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:31:31,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2018-07-24 12:31:31,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:31,499 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:31:31,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:31:31,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:31:31,500 INFO L87 Difference]: Start difference. First operand 7323 states and 10451 transitions. Second operand 5 states. [2018-07-24 12:31:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:43,397 INFO L93 Difference]: Finished difference Result 19225 states and 27840 transitions. [2018-07-24 12:31:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 12:31:43,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-07-24 12:31:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:43,449 INFO L225 Difference]: With dead ends: 19225 [2018-07-24 12:31:43,449 INFO L226 Difference]: Without dead ends: 11908 [2018-07-24 12:31:43,476 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-24 12:31:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11908 states. [2018-07-24 12:31:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11908 to 11786. [2018-07-24 12:31:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11786 states. [2018-07-24 12:31:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11786 states to 11786 states and 15785 transitions. [2018-07-24 12:31:43,774 INFO L78 Accepts]: Start accepts. Automaton has 11786 states and 15785 transitions. Word has length 115 [2018-07-24 12:31:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:43,775 INFO L471 AbstractCegarLoop]: Abstraction has 11786 states and 15785 transitions. [2018-07-24 12:31:43,775 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:31:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 11786 states and 15785 transitions. [2018-07-24 12:31:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-24 12:31:43,778 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:43,778 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 12:31:43,778 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:43,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1518635678, now seen corresponding path program 1 times [2018-07-24 12:31:43,779 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:43,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:43,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:43,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:43,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-07-24 12:31:43,929 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:31:43,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:31:43,930 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:43,930 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:31:43,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:31:43,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:31:43,931 INFO L87 Difference]: Start difference. First operand 11786 states and 15785 transitions. Second operand 3 states. [2018-07-24 12:31:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:49,002 INFO L93 Difference]: Finished difference Result 30700 states and 41418 transitions. [2018-07-24 12:31:49,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:31:49,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-07-24 12:31:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:49,062 INFO L225 Difference]: With dead ends: 30700 [2018-07-24 12:31:49,062 INFO L226 Difference]: Without dead ends: 18920 [2018-07-24 12:31:49,103 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:31:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18920 states. [2018-07-24 12:31:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18920 to 18914. [2018-07-24 12:31:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18914 states. [2018-07-24 12:31:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18914 states to 18914 states and 24014 transitions. [2018-07-24 12:31:49,466 INFO L78 Accepts]: Start accepts. Automaton has 18914 states and 24014 transitions. Word has length 194 [2018-07-24 12:31:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:49,466 INFO L471 AbstractCegarLoop]: Abstraction has 18914 states and 24014 transitions. [2018-07-24 12:31:49,467 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:31:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 18914 states and 24014 transitions. [2018-07-24 12:31:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-07-24 12:31:49,479 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:49,480 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:31:49,480 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1014526588, now seen corresponding path program 1 times [2018-07-24 12:31:49,481 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:49,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:49,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:49,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:50,185 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 12:31:50,385 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 12:31:50,603 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 12:31:50,978 WARN L169 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-07-24 12:31:51,470 WARN L169 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-07-24 12:31:52,136 WARN L169 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-07-24 12:31:52,355 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-24 12:31:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 89 proven. 219 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 12:31:52,731 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:52,731 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:31:52,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:52,748 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:52,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 300 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:31:53,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 140 proven. 87 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-07-24 12:31:54,369 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:54,369 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:31:54,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:54,386 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:54,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 249 proven. 53 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:31:55,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 40 proven. 268 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 12:31:56,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:31:56,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 5, 8, 8] total 27 [2018-07-24 12:31:56,186 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:31:56,187 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-24 12:31:56,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-24 12:31:56,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-07-24 12:31:56,188 INFO L87 Difference]: Start difference. First operand 18914 states and 24014 transitions. Second operand 16 states. [2018-07-24 12:32:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:32:24,163 INFO L93 Difference]: Finished difference Result 51913 states and 66871 transitions. [2018-07-24 12:32:24,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-24 12:32:24,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 399 [2018-07-24 12:32:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:32:24,239 INFO L225 Difference]: With dead ends: 51913 [2018-07-24 12:32:24,239 INFO L226 Difference]: Without dead ends: 31384 [2018-07-24 12:32:24,279 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1720 GetRequests, 1634 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1399, Invalid=5573, Unknown=0, NotChecked=0, Total=6972 [2018-07-24 12:32:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31384 states. [2018-07-24 12:32:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31384 to 30218. [2018-07-24 12:32:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2018-07-24 12:32:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 34969 transitions. [2018-07-24 12:32:24,794 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 34969 transitions. Word has length 399 [2018-07-24 12:32:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:32:24,794 INFO L471 AbstractCegarLoop]: Abstraction has 30218 states and 34969 transitions. [2018-07-24 12:32:24,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-24 12:32:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 34969 transitions. [2018-07-24 12:32:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-07-24 12:32:24,803 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:32:24,804 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:32:24,804 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:32:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 29522735, now seen corresponding path program 1 times [2018-07-24 12:32:24,805 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:32:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:32:24,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:32:24,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:32:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:25,753 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 12:32:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-07-24 12:32:26,268 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:32:26,269 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:32:26,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:26,278 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:32:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:26,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:32:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:32:26,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:32:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 20 proven. 93 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 12:32:27,194 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 12:32:27,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 12 [2018-07-24 12:32:27,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:32:27,195 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:32:27,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:32:27,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-07-24 12:32:27,196 INFO L87 Difference]: Start difference. First operand 30218 states and 34969 transitions. Second operand 5 states. [2018-07-24 12:32:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:32:34,722 INFO L93 Difference]: Finished difference Result 71338 states and 83445 transitions. [2018-07-24 12:32:34,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 12:32:34,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 423 [2018-07-24 12:32:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:32:34,803 INFO L225 Difference]: With dead ends: 71338 [2018-07-24 12:32:34,803 INFO L226 Difference]: Without dead ends: 41126 [2018-07-24 12:32:34,846 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 840 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-07-24 12:32:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41126 states. [2018-07-24 12:32:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41126 to 41045. [2018-07-24 12:32:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41045 states. [2018-07-24 12:32:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41045 states to 41045 states and 46285 transitions. [2018-07-24 12:32:35,483 INFO L78 Accepts]: Start accepts. Automaton has 41045 states and 46285 transitions. Word has length 423 [2018-07-24 12:32:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:32:35,484 INFO L471 AbstractCegarLoop]: Abstraction has 41045 states and 46285 transitions. [2018-07-24 12:32:35,484 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:32:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41045 states and 46285 transitions. [2018-07-24 12:32:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-07-24 12:32:35,520 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:32:35,521 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:32:35,521 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:32:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1186725904, now seen corresponding path program 1 times [2018-07-24 12:32:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:32:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:32:35,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:32:35,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:32:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 102 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:32:38,930 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:32:38,930 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:32:38,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:38,937 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:32:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:39,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:32:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-07-24 12:32:40,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:32:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-07-24 12:32:42,247 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:32:42,248 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:32:42,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:42,263 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:32:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:42,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:32:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 228 proven. 4 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-07-24 12:32:43,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:32:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-07-24 12:32:45,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:32:45,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5, 8, 5] total 33 [2018-07-24 12:32:45,891 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:32:45,893 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-24 12:32:45,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-24 12:32:45,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-07-24 12:32:45,894 INFO L87 Difference]: Start difference. First operand 41045 states and 46285 transitions. Second operand 26 states. [2018-07-24 12:33:08,252 WARN L169 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-07-24 12:33:33,492 WARN L169 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-07-24 12:33:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:33:57,002 INFO L93 Difference]: Finished difference Result 108609 states and 137749 transitions. [2018-07-24 12:33:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-24 12:33:57,002 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 951 [2018-07-24 12:33:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:33:57,300 INFO L225 Difference]: With dead ends: 108609 [2018-07-24 12:33:57,300 INFO L226 Difference]: Without dead ends: 68273 [2018-07-24 12:33:57,436 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4136 GetRequests, 3916 SyntacticMatches, 14 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17144 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=6291, Invalid=36765, Unknown=0, NotChecked=0, Total=43056 [2018-07-24 12:33:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68273 states. [2018-07-24 12:33:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68273 to 66572. [2018-07-24 12:33:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66572 states. [2018-07-24 12:33:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66572 states to 66572 states and 73432 transitions. [2018-07-24 12:33:58,861 INFO L78 Accepts]: Start accepts. Automaton has 66572 states and 73432 transitions. Word has length 951 [2018-07-24 12:33:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:33:58,862 INFO L471 AbstractCegarLoop]: Abstraction has 66572 states and 73432 transitions. [2018-07-24 12:33:58,862 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-24 12:33:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 66572 states and 73432 transitions. [2018-07-24 12:33:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2018-07-24 12:33:58,898 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:33:58,899 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:33:58,900 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:33:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2124198619, now seen corresponding path program 1 times [2018-07-24 12:33:58,900 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:33:58,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:33:58,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:33:58,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:33:58,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:33:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:34:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 5 proven. 45 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-07-24 12:34:00,462 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:34:00,462 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:34:00,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:34:00,470 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:34:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:34:00,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:34:02,960 WARN L1032 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse2 (* 9 v_prenex_1))) (let ((.cse0 (div .cse2 10))) (let ((.cse1 (mod (+ .cse0 1) 95))) (and (= 0 (mod .cse0 95)) (= .cse1 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_1) (not (= (mod .cse2 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse1 212)) (< .cse2 0)))))) (exists ((v_prenex_22 Int)) (let ((.cse5 (* 9 v_prenex_22))) (let ((.cse4 (div .cse5 10))) (let ((.cse3 (mod .cse4 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse3 117)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_22) (< .cse4 0) (= (mod (+ .cse4 1) 95) 0) (not (= 0 .cse3)) (= (mod .cse5 10) 0)))))) (exists ((v_prenex_20 Int)) (let ((.cse7 (* 9 v_prenex_20))) (let ((.cse6 (div .cse7 10))) (let ((.cse8 (mod (+ .cse6 1) 95))) (and (<= 0 .cse6) (not (= (mod .cse7 10) 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_20) (< .cse7 0) (= .cse8 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse8 212))))))) (exists ((v_prenex_5 Int)) (let ((.cse11 (* 9 v_prenex_5))) (let ((.cse12 (div .cse11 10))) (let ((.cse9 (+ .cse12 1)) (.cse10 (mod .cse12 95))) (and (not (= (mod .cse9 95) 0)) (< .cse9 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_5) (= 0 .cse10) (<= 0 .cse11) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse10 212))))))) (exists ((v_prenex_25 Int)) (let ((.cse14 (* 9 v_prenex_25))) (let ((.cse15 (div .cse14 10))) (let ((.cse13 (+ .cse15 1))) (and (< .cse13 0) (= (mod .cse14 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse15 95) 212)) (<= 0 .cse15) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_25) (not (= (mod .cse13 95) 0))))))) (exists ((v_prenex_21 Int)) (let ((.cse18 (* 9 v_prenex_21))) (let ((.cse17 (div .cse18 10))) (let ((.cse16 (+ .cse17 1))) (and (<= 0 .cse16) (not (= 0 (mod .cse17 95))) (< .cse17 0) (not (= (mod .cse18 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse16 95) 212)) (< .cse18 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_21)))))) (exists ((v_prenex_8 Int)) (let ((.cse20 (* 9 v_prenex_8))) (let ((.cse19 (div .cse20 10))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse19 95) 212)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_8) (<= 0 .cse19) (= (mod .cse20 10) 0) (<= 0 (+ .cse19 1)))))) (exists ((v_prenex_10 Int)) (let ((.cse21 (* 9 v_prenex_10))) (let ((.cse22 (div .cse21 10))) (let ((.cse23 (mod .cse22 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_10) (= (mod .cse21 10) 0) (< .cse22 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse23 117)) (<= 0 (+ .cse22 1)) (not (= 0 .cse23))))))) (exists ((v_prenex_26 Int)) (let ((.cse27 (* 9 v_prenex_26))) (let ((.cse24 (div .cse27 10))) (let ((.cse25 (mod .cse24 95)) (.cse26 (+ .cse24 1))) (and (< .cse24 0) (not (= 0 .cse25)) (not (= (mod .cse26 95) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse25 117)) (= (mod .cse27 10) 0) (< .cse26 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_26)))))) (exists ((v_prenex_17 Int)) (let ((.cse30 (* 9 v_prenex_17))) (let ((.cse28 (div .cse30 10))) (let ((.cse29 (mod .cse28 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_17) (< .cse28 0) (not (= 0 .cse29)) (<= 0 .cse30) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse29 117)) (= (mod (+ .cse28 1) 95) 0)))))) (exists ((v_prenex_13 Int)) (let ((.cse33 (* 9 v_prenex_13))) (let ((.cse34 (div .cse33 10))) (let ((.cse32 (+ .cse34 1))) (let ((.cse31 (mod .cse32 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse31 117)) (< .cse32 0) (< .cse33 0) (= 0 (mod .cse34 95)) (not (= (mod .cse33 10) 0)) (not (= .cse31 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_13))))))) (exists ((v_prenex_11 Int)) (let ((.cse36 (* 9 v_prenex_11))) (let ((.cse35 (div .cse36 10))) (let ((.cse37 (mod .cse35 95))) (and (< .cse35 0) (<= 0 .cse36) (<= 0 (+ .cse35 1)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse37 117)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_11) (not (= 0 .cse37))))))) (exists ((v_prenex_12 Int)) (let ((.cse41 (* 9 v_prenex_12))) (let ((.cse38 (div .cse41 10))) (let ((.cse39 (+ .cse38 1))) (let ((.cse40 (mod .cse39 95))) (and (<= 0 .cse38) (< .cse39 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse40 117)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_12) (not (= (mod .cse41 10) 0)) (not (= .cse40 0)) (< .cse41 0))))))) (exists ((v_prenex_18 Int)) (let ((.cse43 (* 9 v_prenex_18))) (let ((.cse42 (div .cse43 10))) (let ((.cse44 (mod .cse42 95)) (.cse45 (+ .cse42 1))) (and (< .cse42 0) (<= 0 .cse43) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse44 117)) (not (= 0 .cse44)) (< .cse45 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_18) (not (= (mod .cse45 95) 0))))))) (exists ((v_prenex_15 Int)) (let ((.cse48 (* 9 v_prenex_15))) (let ((.cse47 (div .cse48 10))) (let ((.cse46 (+ .cse47 1))) (and (not (= (mod .cse46 95) 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_15) (< .cse46 0) (<= 0 .cse47) (<= 0 .cse48) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse47 95) 212))))))) (exists ((v_prenex_9 Int)) (let ((.cse50 (* 9 v_prenex_9))) (let ((.cse51 (div .cse50 10))) (let ((.cse49 (mod (+ .cse51 1) 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse49 212)) (< .cse50 0) (not (= (mod .cse50 10) 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_9) (< .cse51 0) (not (= 0 (mod .cse51 95))) (= .cse49 0)))))) (exists ((v_prenex_19 Int)) (let ((.cse52 (* 9 v_prenex_19))) (let ((.cse53 (div .cse52 10))) (let ((.cse55 (+ .cse53 1))) (let ((.cse54 (mod .cse55 95))) (and (< .cse52 0) (not (= 0 (mod .cse53 95))) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse54 117)) (< .cse55 0) (not (= (mod .cse52 10) 0)) (< .cse53 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_19) (not (= .cse54 0)))))))) (exists ((v_prenex_6 Int)) (let ((.cse56 (* 9 v_prenex_6))) (let ((.cse58 (div .cse56 10))) (let ((.cse57 (+ .cse58 1))) (and (< .cse56 0) (not (= (mod .cse56 10) 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_6) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse57 95) 212)) (<= 0 .cse58) (<= 0 .cse57)))))) (exists ((v_prenex_24 Int)) (let ((.cse61 (* 9 v_prenex_24))) (let ((.cse60 (div .cse61 10))) (let ((.cse59 (mod .cse60 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_24) (= 0 .cse59) (= (mod (+ .cse60 1) 95) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse59 212)) (<= 0 .cse61)))))) (exists ((v_prenex_4 Int)) (let ((.cse63 (* 9 v_prenex_4))) (let ((.cse64 (div .cse63 10))) (let ((.cse62 (mod .cse64 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse62 212)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_4) (= (mod .cse63 10) 0) (= 0 .cse62) (= (mod (+ .cse64 1) 95) 0)))))) (exists ((v_prenex_14 Int)) (let ((.cse66 (* 9 v_prenex_14))) (let ((.cse68 (div .cse66 10))) (let ((.cse65 (mod .cse68 95)) (.cse67 (+ .cse68 1))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_14) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse65 212)) (= (mod .cse66 10) 0) (not (= (mod .cse67 95) 0)) (= 0 .cse65) (< .cse67 0)))))) (exists ((v_prenex_7 Int)) (let ((.cse70 (* 9 v_prenex_7))) (let ((.cse71 (div .cse70 10))) (let ((.cse69 (mod .cse71 95))) (and (= 0 .cse69) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse69 212)) (= (mod .cse70 10) 0) (<= 0 (+ .cse71 1)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_7)))))) (exists ((v_prenex_2 Int)) (let ((.cse73 (* 9 v_prenex_2))) (let ((.cse74 (div .cse73 10))) (let ((.cse72 (mod .cse74 95))) (and (= 0 .cse72) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_2) (<= 0 .cse73) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse72 212)) (<= 0 (+ .cse74 1))))))) (exists ((v_prenex_3 Int)) (let ((.cse75 (* 9 v_prenex_3))) (let ((.cse76 (div .cse75 10))) (and (<= 0 .cse75) (= (mod (+ .cse76 1) 95) 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_3) (<= 0 .cse76) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse76 95) 212)))))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2018 Int)) (let ((.cse78 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2018))) (let ((.cse77 (div .cse78 10))) (and (= (mod (+ .cse77 1) 95) 0) (= (mod .cse78 10) 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2018) (<= 0 .cse77) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse77 95) 212)))))) (exists ((v_prenex_23 Int)) (let ((.cse80 (* 9 v_prenex_23))) (let ((.cse79 (div .cse80 10))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_23) (<= 0 .cse79) (<= 0 .cse80) (<= 0 (+ .cse79 1)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse79 95) 212)))))) (exists ((v_prenex_16 Int)) (let ((.cse81 (* 9 v_prenex_16))) (let ((.cse83 (div .cse81 10))) (let ((.cse82 (+ .cse83 1))) (and (not (= (mod .cse81 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse82 95) 212)) (= 0 (mod .cse83 95)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_16) (<= 0 .cse82) (< .cse81 0))))))) is different from true [2018-07-24 12:34:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 5 proven. 262 refuted. 0 times theorem prover too weak. 302 trivial. 7 not checked. [2018-07-24 12:34:05,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:34:07,044 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-07-24 12:34:07,540 WARN L169 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-07-24 12:34:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-07-24 12:34:08,269 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:34:08,269 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:34:08,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:34:08,287 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:34:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:34:08,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:34:11,059 WARN L1032 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_133 Int)) (let ((.cse1 (* 9 v_prenex_133))) (let ((.cse0 (div .cse1 10))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse0 95) 212)) (<= 0 .cse0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_133) (<= 0 .cse1))))) (exists ((v_prenex_132 Int)) (let ((.cse4 (* 9 v_prenex_132))) (let ((.cse3 (div .cse4 10))) (let ((.cse2 (mod .cse3 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse2 117)) (< .cse3 0) (not (= .cse2 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_132) (<= 0 .cse4)))))) (exists ((v_prenex_134 Int)) (let ((.cse5 (* 9 v_prenex_134))) (let ((.cse6 (+ (div .cse5 10) 1))) (let ((.cse7 (mod .cse6 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_134) (< .cse5 0) (< .cse6 0) (not (= 0 .cse7)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse7 117)) (not (= (mod .cse5 10) 0))))))) (exists ((v_prenex_135 Int)) (let ((.cse9 (* 9 v_prenex_135))) (let ((.cse8 (div .cse9 10))) (let ((.cse10 (mod .cse8 95))) (and (< .cse8 0) (= (mod .cse9 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse10 117)) (not (= .cse10 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_135)))))) (exists ((v_prenex_131 Int)) (let ((.cse12 (* 9 v_prenex_131))) (let ((.cse11 (div .cse12 10))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_131) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse11 95) 212)) (= (mod .cse12 10) 0) (<= 0 .cse11))))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2082 Int)) (let ((.cse13 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2082))) (let ((.cse14 (+ (div .cse13 10) 1))) (and (< .cse13 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse14 95) 212)) (not (= (mod .cse13 10) 0)) (<= 0 .cse14) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2082))))) (exists ((v_prenex_136 Int)) (let ((.cse16 (* 9 v_prenex_136))) (let ((.cse15 (mod (+ (div .cse16 10) 1) 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_136) (= 0 .cse15) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse15 212)) (not (= (mod .cse16 10) 0)) (< .cse16 0))))) (exists ((v_prenex_138 Int)) (let ((.cse18 (* 9 v_prenex_138))) (let ((.cse17 (mod (div .cse18 10) 95))) (and (= .cse17 0) (<= 0 .cse18) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_138) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse17 212)))))) (exists ((v_prenex_137 Int)) (let ((.cse19 (* 9 v_prenex_137))) (let ((.cse20 (mod (div .cse19 10) 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_137) (= (mod .cse19 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse20 212)) (= .cse20 0)))))) is different from true [2018-07-24 12:34:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 5 proven. 262 refuted. 0 times theorem prover too weak. 302 trivial. 7 not checked. [2018-07-24 12:34:12,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:34:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-07-24 12:34:13,126 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:34:13,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6, 9, 6] total 15 [2018-07-24 12:34:13,126 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:34:13,128 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 12:34:13,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 12:34:13,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=117, Unknown=2, NotChecked=46, Total=210 [2018-07-24 12:34:13,129 INFO L87 Difference]: Start difference. First operand 66572 states and 73432 transitions. Second operand 11 states. Received shutdown request... [2018-07-24 12:34:46,294 WARN L177 SmtUtils]: Removed 20 from assertion stack [2018-07-24 12:34:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 12:34:46,295 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 12:34:46,300 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 12:34:46,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 12:34:46 BoogieIcfgContainer [2018-07-24 12:34:46,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 12:34:46,302 INFO L168 Benchmark]: Toolchain (without parser) took 239707.65 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -289.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-24 12:34:46,303 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 12:34:46,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1774.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 169.4 MB). Peak memory consumption was 169.4 MB. Max. memory is 7.1 GB. [2018-07-24 12:34:46,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-24 12:34:46,305 INFO L168 Benchmark]: Boogie Preprocessor took 628.28 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 849.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. [2018-07-24 12:34:46,306 INFO L168 Benchmark]: RCFGBuilder took 8951.05 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 541.3 MB). Peak memory consumption was 541.3 MB. Max. memory is 7.1 GB. [2018-07-24 12:34:46,306 INFO L168 Benchmark]: TraceAbstraction took 228155.37 ms. Allocated memory was 2.4 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 38.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-07-24 12:34:46,311 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1774.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 169.4 MB). Peak memory consumption was 169.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 192.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 628.28 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 849.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8951.05 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 541.3 MB). Peak memory consumption was 541.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228155.37 ms. Allocated memory was 2.4 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 38.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (66572states) and interpolant automaton (currently 5 states, 11 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 457. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 775 locations, 1 error locations. TIMEOUT Result, 228.0s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 186.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1990 SDtfs, 58202 SDslu, 4468 SDs, 0 SdLazy, 94640 SolverSat, 18317 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 118.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10903 GetRequests, 10509 SyntacticMatches, 43 SemanticMatches, 350 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 19506 ImplicationChecksByTransitivity, 27.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66572occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 3230 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 30.1s InterpolantComputationTime, 8518 NumberOfCodeBlocks, 8518 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 13674 ConstructedInterpolants, 10 QuantifiedInterpolants, 54112056 SizeOfPredicates, 24 NumberOfNonLiveVariables, 7118 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 5856/7619 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem18_label09_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_12-34-46-327.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem18_label09_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_12-34-46-327.csv Completed graceful shutdown