java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:31:59,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:31:59,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:31:59,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:31:59,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:31:59,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:31:59,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:31:59,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:31:59,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:31:59,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:31:59,102 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:31:59,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:31:59,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:31:59,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:31:59,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:31:59,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:31:59,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:31:59,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:31:59,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:31:59,117 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:31:59,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:31:59,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:31:59,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:31:59,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:31:59,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:31:59,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:31:59,124 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:31:59,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:31:59,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:31:59,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:31:59,127 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:31:59,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:31:59,128 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:31:59,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:31:59,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:31:59,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:31:59,130 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-09-10 11:31:59,147 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:31:59,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:31:59,148 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:31:59,149 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:31:59,149 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:31:59,149 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:31:59,149 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:31:59,149 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:31:59,150 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:31:59,150 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:31:59,150 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:31:59,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:31:59,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:31:59,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:31:59,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:31:59,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:31:59,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:31:59,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:31:59,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:31:59,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:31:59,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:31:59,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:31:59,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:31:59,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:31:59,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:31:59,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:31:59,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:31:59,154 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:31:59,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:31:59,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:31:59,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:31:59,154 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:31:59,155 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:31:59,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:31:59,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:31:59,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:31:59,217 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:31:59,217 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:31:59,218 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-09-10 11:31:59,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e7c3a67/b320fd810d0f4b648c10022902fc51d9/FLAGe764fb9e9 [2018-09-10 11:31:59,862 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:31:59,863 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-09-10 11:31:59,879 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e7c3a67/b320fd810d0f4b648c10022902fc51d9/FLAGe764fb9e9 [2018-09-10 11:31:59,896 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e7c3a67/b320fd810d0f4b648c10022902fc51d9 [2018-09-10 11:31:59,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:31:59,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:31:59,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:31:59,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:31:59,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:31:59,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:31:59" (1/1) ... [2018-09-10 11:31:59,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba2ae98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:59, skipping insertion in model container [2018-09-10 11:31:59,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:31:59" (1/1) ... [2018-09-10 11:32:00,138 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:32:00,428 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:32:00,448 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:32:00,577 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:32:00,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00 WrapperNode [2018-09-10 11:32:00,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:32:00,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:32:00,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:32:00,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:32:00,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:32:00,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:32:00,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:32:00,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:32:00,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... [2018-09-10 11:32:00,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:32:00,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:32:00,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:32:00,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:32:00,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:32:01,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:32:01,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:32:01,121 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:32:01,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:32:01,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:32:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:32:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:32:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:32:04,450 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:32:04,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:32:04 BoogieIcfgContainer [2018-09-10 11:32:04,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:32:04,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:32:04,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:32:04,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:32:04,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:31:59" (1/3) ... [2018-09-10 11:32:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b63cf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:32:04, skipping insertion in model container [2018-09-10 11:32:04,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:00" (2/3) ... [2018-09-10 11:32:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b63cf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:32:04, skipping insertion in model container [2018-09-10 11:32:04,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:32:04" (3/3) ... [2018-09-10 11:32:04,459 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label23_true-unreach-call.c [2018-09-10 11:32:04,469 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:32:04,479 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:32:04,537 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:32:04,538 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:32:04,538 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:32:04,538 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:32:04,538 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:32:04,538 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:32:04,540 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:32:04,540 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:32:04,540 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:32:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-10 11:32:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-10 11:32:04,583 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:04,584 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:04,585 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash 508483465, now seen corresponding path program 1 times [2018-09-10 11:32:04,594 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:04,645 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:05,105 WARN L175 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:05,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:05,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:32:05,251 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:05,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:32:05,275 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:32:05,276 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:32:05,279 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-09-10 11:32:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:07,029 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-09-10 11:32:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:32:07,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-09-10 11:32:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:07,053 INFO L225 Difference]: With dead ends: 574 [2018-09-10 11:32:07,054 INFO L226 Difference]: Without dead ends: 356 [2018-09-10 11:32:07,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-10 11:32:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-10 11:32:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-09-10 11:32:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-10 11:32:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-09-10 11:32:07,137 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 53 [2018-09-10 11:32:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:07,138 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-09-10 11:32:07,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:32:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-09-10 11:32:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-10 11:32:07,146 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:07,147 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:07,147 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1327667053, now seen corresponding path program 1 times [2018-09-10 11:32:07,148 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:07,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:07,150 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:07,556 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:07,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:07,556 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:07,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:07,560 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:07,560 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:07,561 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-09-10 11:32:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:10,147 INFO L93 Difference]: Finished difference Result 998 states and 1753 transitions. [2018-09-10 11:32:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:10,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-09-10 11:32:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:10,158 INFO L225 Difference]: With dead ends: 998 [2018-09-10 11:32:10,158 INFO L226 Difference]: Without dead ends: 648 [2018-09-10 11:32:10,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:32:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-09-10 11:32:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 639. [2018-09-10 11:32:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-09-10 11:32:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 994 transitions. [2018-09-10 11:32:10,219 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 994 transitions. Word has length 136 [2018-09-10 11:32:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:10,220 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 994 transitions. [2018-09-10 11:32:10,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 994 transitions. [2018-09-10 11:32:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-10 11:32:10,226 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:10,226 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:10,226 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash -734844493, now seen corresponding path program 1 times [2018-09-10 11:32:10,227 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:10,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:10,229 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:10,527 WARN L175 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:10,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:10,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:10,984 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:10,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:10,987 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:10,987 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:10,988 INFO L87 Difference]: Start difference. First operand 639 states and 994 transitions. Second operand 6 states. [2018-09-10 11:32:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:15,321 INFO L93 Difference]: Finished difference Result 1567 states and 2516 transitions. [2018-09-10 11:32:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:15,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2018-09-10 11:32:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:15,333 INFO L225 Difference]: With dead ends: 1567 [2018-09-10 11:32:15,333 INFO L226 Difference]: Without dead ends: 934 [2018-09-10 11:32:15,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:32:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-09-10 11:32:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 918. [2018-09-10 11:32:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-09-10 11:32:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1356 transitions. [2018-09-10 11:32:15,383 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1356 transitions. Word has length 152 [2018-09-10 11:32:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:15,387 INFO L480 AbstractCegarLoop]: Abstraction has 918 states and 1356 transitions. [2018-09-10 11:32:15,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1356 transitions. [2018-09-10 11:32:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-10 11:32:15,393 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:15,393 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:15,394 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash 565573439, now seen corresponding path program 1 times [2018-09-10 11:32:15,394 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:15,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:15,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:15,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:15,396 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:15,771 WARN L175 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:16,227 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:16,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:16,227 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:16,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:16,228 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:16,229 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:16,229 INFO L87 Difference]: Start difference. First operand 918 states and 1356 transitions. Second operand 6 states. [2018-09-10 11:32:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:19,706 INFO L93 Difference]: Finished difference Result 2394 states and 3682 transitions. [2018-09-10 11:32:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:19,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-09-10 11:32:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:19,721 INFO L225 Difference]: With dead ends: 2394 [2018-09-10 11:32:19,721 INFO L226 Difference]: Without dead ends: 1482 [2018-09-10 11:32:19,726 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:32:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-10 11:32:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1460. [2018-09-10 11:32:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2018-09-10 11:32:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2048 transitions. [2018-09-10 11:32:19,779 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2048 transitions. Word has length 174 [2018-09-10 11:32:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:19,780 INFO L480 AbstractCegarLoop]: Abstraction has 1460 states and 2048 transitions. [2018-09-10 11:32:19,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2048 transitions. [2018-09-10 11:32:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-10 11:32:19,785 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:19,786 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:19,786 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -829584541, now seen corresponding path program 1 times [2018-09-10 11:32:19,786 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:19,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:19,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:19,788 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:19,998 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:19,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:19,998 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:19,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:19,999 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:19,999 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:19,999 INFO L87 Difference]: Start difference. First operand 1460 states and 2048 transitions. Second operand 6 states. [2018-09-10 11:32:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:21,664 INFO L93 Difference]: Finished difference Result 3258 states and 4710 transitions. [2018-09-10 11:32:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:21,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-09-10 11:32:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:21,684 INFO L225 Difference]: With dead ends: 3258 [2018-09-10 11:32:21,684 INFO L226 Difference]: Without dead ends: 1804 [2018-09-10 11:32:21,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:32:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2018-09-10 11:32:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1766. [2018-09-10 11:32:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2018-09-10 11:32:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2376 transitions. [2018-09-10 11:32:21,769 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2376 transitions. Word has length 176 [2018-09-10 11:32:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:21,770 INFO L480 AbstractCegarLoop]: Abstraction has 1766 states and 2376 transitions. [2018-09-10 11:32:21,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2376 transitions. [2018-09-10 11:32:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-10 11:32:21,777 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:21,777 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:32:21,777 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1366596424, now seen corresponding path program 1 times [2018-09-10 11:32:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:21,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:21,779 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 92 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:32:22,058 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:22,058 INFO L197 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-09-10 11:32:22,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:22,070 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:22,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 11:32:22,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 92 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:32:22,946 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:32:22,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2018-09-10 11:32:22,947 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:22,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:32:22,947 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:32:22,947 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 11:32:22,948 INFO L87 Difference]: Start difference. First operand 1766 states and 2376 transitions. Second operand 5 states. [2018-09-10 11:32:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:26,137 INFO L93 Difference]: Finished difference Result 4440 states and 5970 transitions. [2018-09-10 11:32:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:26,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2018-09-10 11:32:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:26,156 INFO L225 Difference]: With dead ends: 4440 [2018-09-10 11:32:26,156 INFO L226 Difference]: Without dead ends: 2680 [2018-09-10 11:32:26,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 445 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-09-10 11:32:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2018-09-10 11:32:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2598. [2018-09-10 11:32:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2018-09-10 11:32:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3341 transitions. [2018-09-10 11:32:26,244 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3341 transitions. Word has length 224 [2018-09-10 11:32:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:26,244 INFO L480 AbstractCegarLoop]: Abstraction has 2598 states and 3341 transitions. [2018-09-10 11:32:26,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:32:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3341 transitions. [2018-09-10 11:32:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-10 11:32:26,257 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:26,257 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-10 11:32:26,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1240790714, now seen corresponding path program 1 times [2018-09-10 11:32:26,261 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:26,263 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:26,755 WARN L175 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 11:32:26,965 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 11:32:27,206 WARN L175 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-09-10 11:32:27,605 WARN L175 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-09-10 11:32:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 212 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:32:28,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:28,352 INFO L197 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-09-10 11:32:28,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:28,366 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:28,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 11:32:28,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:28,856 WARN L175 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 11:32:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 212 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:32:29,291 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:29,291 INFO L197 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-09-10 11:32:29,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:29,322 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:29,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 11:32:30,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 212 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:32:30,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:32:30,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5, 5, 5] total 22 [2018-09-10 11:32:30,463 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:32:30,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-10 11:32:30,465 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-10 11:32:30,465 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-09-10 11:32:30,465 INFO L87 Difference]: Start difference. First operand 2598 states and 3341 transitions. Second operand 16 states. [2018-09-10 11:32:34,097 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2018-09-10 11:32:34,568 WARN L175 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-09-10 11:32:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:38,016 INFO L93 Difference]: Finished difference Result 6851 states and 9580 transitions. [2018-09-10 11:32:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-10 11:32:38,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 295 [2018-09-10 11:32:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:38,049 INFO L225 Difference]: With dead ends: 6851 [2018-09-10 11:32:38,049 INFO L226 Difference]: Without dead ends: 4113 [2018-09-10 11:32:38,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1253 GetRequests, 1199 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-09-10 11:32:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-09-10 11:32:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3791. [2018-09-10 11:32:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3791 states. [2018-09-10 11:32:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 4697 transitions. [2018-09-10 11:32:38,198 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 4697 transitions. Word has length 295 [2018-09-10 11:32:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:38,198 INFO L480 AbstractCegarLoop]: Abstraction has 3791 states and 4697 transitions. [2018-09-10 11:32:38,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-10 11:32:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 4697 transitions. [2018-09-10 11:32:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-10 11:32:38,215 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:38,215 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:38,216 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash 414293357, now seen corresponding path program 1 times [2018-09-10 11:32:38,216 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:38,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:38,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:38,218 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:38,515 WARN L175 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 144 proven. 159 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 11:32:38,875 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:38,876 INFO L197 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-09-10 11:32:38,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:38,885 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:38,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 332 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 11:32:39,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 221 proven. 82 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 11:32:39,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:39,377 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:32:39,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:39,393 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:39,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 332 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 11:32:39,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 221 proven. 82 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 11:32:39,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:32:39,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 15 [2018-09-10 11:32:39,935 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:32:39,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-10 11:32:39,936 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-10 11:32:39,937 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-09-10 11:32:39,937 INFO L87 Difference]: Start difference. First operand 3791 states and 4697 transitions. Second operand 11 states. [2018-09-10 11:32:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:43,841 INFO L93 Difference]: Finished difference Result 9984 states and 12684 transitions. [2018-09-10 11:32:43,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-10 11:32:43,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 304 [2018-09-10 11:32:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:43,851 INFO L225 Difference]: With dead ends: 9984 [2018-09-10 11:32:43,852 INFO L226 Difference]: Without dead ends: 2256 [2018-09-10 11:32:43,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1249 GetRequests, 1216 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-09-10 11:32:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2018-09-10 11:32:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1624. [2018-09-10 11:32:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2018-09-10 11:32:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1817 transitions. [2018-09-10 11:32:43,932 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1817 transitions. Word has length 304 [2018-09-10 11:32:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:43,933 INFO L480 AbstractCegarLoop]: Abstraction has 1624 states and 1817 transitions. [2018-09-10 11:32:43,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-10 11:32:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1817 transitions. [2018-09-10 11:32:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-10 11:32:43,941 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:43,941 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-10 11:32:43,941 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1037984411, now seen corresponding path program 1 times [2018-09-10 11:32:43,942 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:43,943 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:44,304 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 11:32:44,725 WARN L175 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-10 11:32:44,963 WARN L175 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 11:32:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 229 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:32:45,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:45,553 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:32:45,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:45,561 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:45,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:46,801 WARN L175 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 37 [2018-09-10 11:32:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 341 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 11:32:47,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:47,957 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-10 11:32:48,088 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-10 11:32:48,626 WARN L175 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 22 [2018-09-10 11:32:48,895 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-09-10 11:32:48,952 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-09-10 11:32:49,277 WARN L175 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-09-10 11:32:49,281 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,433 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,613 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,675 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,722 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,787 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,847 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:49,954 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,005 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,091 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,280 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,337 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,451 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,507 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,634 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,689 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,802 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:50,871 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:51,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:51,353 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:51,691 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,011 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,563 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,626 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,701 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,774 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,835 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,895 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:52,953 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,056 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,115 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,250 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,307 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,502 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,613 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,675 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,747 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,806 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,866 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:53,922 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,083 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,139 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,192 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,256 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,309 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,461 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,570 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,622 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,681 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,797 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,851 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,906 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:54,967 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,021 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,077 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,205 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,263 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,317 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,372 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,509 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,563 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,624 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,735 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,864 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,919 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:55,978 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,092 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,257 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,319 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,488 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:56,869 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:57,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:57,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:57,787 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:57,855 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:57,904 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:57,953 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,030 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,081 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,138 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,193 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,539 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,651 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,706 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,761 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,813 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,868 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,923 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:58,979 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:59,036 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:59,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:59,153 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:59,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 11:32:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 148 proven. 239 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:32:59,993 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:59,993 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:33:00,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:00,008 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:33:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:00,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:33:03,735 WARN L175 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 189 DAG size of output: 42 [2018-09-10 11:33:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 341 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 11:33:04,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:33:23,968 WARN L175 SmtUtils]: Spent 18.30 s on a formula simplification. DAG size of input: 244 DAG size of output: 31 [2018-09-10 11:33:23,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-10 11:33:24,205 WARN L175 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-09-10 11:33:24,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2018-09-10 11:33:24,349 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 79 [2018-09-10 11:33:27,409 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 7765 disjunctions. This might take some time... [2018-09-10 11:33:27,460 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 29 disjunctions. [2018-09-10 11:33:28,083 WARN L175 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2018-09-10 11:33:28,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:28,207 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:28,318 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:28,431 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:28,548 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:28,673 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:28,829 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:29,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:29,525 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:29,641 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:29,785 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:29,911 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,025 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,185 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,299 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,419 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,570 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,686 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,813 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:30,936 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:31,139 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:31,333 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:31,453 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:31,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:31,713 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:31,834 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,005 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,128 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,867 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:32,996 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,106 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,216 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,344 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,475 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,739 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,867 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:33,990 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,238 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,350 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,473 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,591 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,852 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:34,969 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:35,250 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:35,535 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:35,662 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:35,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:35,919 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:36,044 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:36,166 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:36,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:36,503 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:36,629 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:36,749 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:36,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,122 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,344 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,590 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,709 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,831 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:37,943 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:38,054 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:38,171 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:38,289 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:38,446 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:38,566 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,026 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,159 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,399 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,513 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,632 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,752 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,869 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:39,997 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:40,291 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:40,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:40,535 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:40,651 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:40,780 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,117 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,234 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,344 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,573 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,821 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:41,943 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:42,061 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:42,167 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:42,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:42,758 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:42,884 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:43,007 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:43,124 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:43,245 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:43,537 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-09-10 11:33:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 146 proven. 241 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:33:44,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:33:44,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9, 10, 11] total 41 [2018-09-10 11:33:44,719 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:33:44,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-10 11:33:44,720 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-10 11:33:44,721 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2018-09-10 11:33:44,721 INFO L87 Difference]: Start difference. First operand 1624 states and 1817 transitions. Second operand 18 states. [2018-09-10 11:33:46,287 WARN L175 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2018-09-10 11:33:47,981 WARN L175 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-09-10 11:33:51,787 WARN L175 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-09-10 11:33:55,484 WARN L175 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2018-09-10 11:34:00,696 WARN L175 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-09-10 11:34:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:11,952 INFO L93 Difference]: Finished difference Result 4796 states and 5496 transitions. [2018-09-10 11:34:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-10 11:34:11,952 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 340 [2018-09-10 11:34:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:11,964 INFO L225 Difference]: With dead ends: 4796 [2018-09-10 11:34:11,964 INFO L226 Difference]: Without dead ends: 2917 [2018-09-10 11:34:11,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1435 GetRequests, 1142 SyntacticMatches, 221 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7925 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=946, Invalid=4456, Unknown=0, NotChecked=0, Total=5402 [2018-09-10 11:34:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2018-09-10 11:34:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2616. [2018-09-10 11:34:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2018-09-10 11:34:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 2969 transitions. [2018-09-10 11:34:12,043 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 2969 transitions. Word has length 340 [2018-09-10 11:34:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:12,044 INFO L480 AbstractCegarLoop]: Abstraction has 2616 states and 2969 transitions. [2018-09-10 11:34:12,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-10 11:34:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 2969 transitions. [2018-09-10 11:34:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-09-10 11:34:12,055 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:12,056 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-10 11:34:12,056 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash 935343302, now seen corresponding path program 1 times [2018-09-10 11:34:12,057 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:12,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:12,058 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-09-10 11:34:12,491 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:34:12,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:34:12,491 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:34:12,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:34:12,492 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:34:12,492 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:34:12,493 INFO L87 Difference]: Start difference. First operand 2616 states and 2969 transitions. Second operand 3 states. [2018-09-10 11:34:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:13,197 INFO L93 Difference]: Finished difference Result 5818 states and 6681 transitions. [2018-09-10 11:34:13,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:34:13,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2018-09-10 11:34:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:13,199 INFO L225 Difference]: With dead ends: 5818 [2018-09-10 11:34:13,199 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 11:34:13,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:34:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 11:34:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 11:34:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 11:34:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 11:34:13,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 359 [2018-09-10 11:34:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:13,210 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 11:34:13,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:34:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 11:34:13,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 11:34:13,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 11:34:13,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,586 WARN L175 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 161 [2018-09-10 11:34:13,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:34:13,821 WARN L175 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 161 [2018-09-10 11:34:14,358 WARN L175 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-09-10 11:34:15,206 WARN L175 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-09-10 11:34:16,507 WARN L175 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 197 DAG size of output: 53 [2018-09-10 11:34:17,526 WARN L175 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 163 DAG size of output: 64 [2018-09-10 11:34:18,364 WARN L175 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 64 [2018-09-10 11:34:18,367 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,368 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,369 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 11:34:18,370 INFO L426 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 11:34:18,371 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-09-10 11:34:18,372 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 11:34:18,373 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,374 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-09-10 11:34:18,375 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-09-10 11:34:18,376 INFO L426 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-09-10 11:34:18,377 INFO L426 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-09-10 11:34:18,378 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-09-10 11:34:18,379 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-09-10 11:34:18,380 INFO L426 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-09-10 11:34:18,381 INFO L426 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-09-10 11:34:18,382 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-09-10 11:34:18,383 INFO L426 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-09-10 11:34:18,384 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,385 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 11:34:18,386 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 11:34:18,387 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 11:34:18,387 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (let ((.cse4 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse3 (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse0 (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (.cse1 (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0))) (.cse2 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse8 (and .cse6 .cse7 .cse5))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7)) (or .cse0 .cse1 .cse3 .cse8 .cse4 (< (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 12) 0)) (or .cse0 .cse1 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (and .cse6 .cse7 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0))) (or (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) .cse0 .cse1 .cse3 .cse4 .cse8) (or (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse5 .cse6) (or .cse0 .cse1 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse2 .cse3)) (or .cse0 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse1 .cse2 .cse8 (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))))) [2018-09-10 11:34:18,387 INFO L426 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-09-10 11:34:18,387 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-09-10 11:34:18,387 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-09-10 11:34:18,387 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:34:18,387 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 14) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3)) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23)) [2018-09-10 11:34:18,388 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 11:34:18,388 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:34:18,388 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23)) (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) [2018-09-10 11:34:18,388 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:34:18,388 INFO L422 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4))) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3))) (.cse0 (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7)))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (and .cse0 (and .cse1 .cse2 .cse3)) (and .cse0 .cse2 (<= 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 12)) .cse3) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 1)) .cse2 .cse3) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse0 .cse1 .cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0) (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23)) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)))) [2018-09-10 11:34:18,388 INFO L426 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-09-10 11:34:18,388 INFO L426 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-09-10 11:34:18,388 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-09-10 11:34:18,389 INFO L422 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4))) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3))) (.cse0 (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7)))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (and .cse0 (and .cse1 .cse2 .cse3)) (and .cse0 .cse2 (<= 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 12)) .cse3) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 1)) .cse2 .cse3) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse0 .cse1 .cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0) (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23)) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)))) [2018-09-10 11:34:18,389 INFO L426 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:34:18,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:34:18 BoogieIcfgContainer [2018-09-10 11:34:18,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:34:18,421 INFO L168 Benchmark]: Toolchain (without parser) took 138508.26 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -745.1 MB). Peak memory consumption was 804.7 MB. Max. memory is 7.1 GB. [2018-09-10 11:34:18,422 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 11:34:18,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-10 11:34:18,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 11:34:18,424 INFO L168 Benchmark]: Boogie Preprocessor took 131.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 11:34:18,427 INFO L168 Benchmark]: RCFGBuilder took 3592.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -719.1 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2018-09-10 11:34:18,428 INFO L168 Benchmark]: TraceAbstraction took 133965.90 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 787.5 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -78.8 MB). Peak memory consumption was 708.7 MB. Max. memory is 7.1 GB. [2018-09-10 11:34:18,436 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 102.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.52 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. * RCFGBuilder took 3592.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -719.1 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 133965.90 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 787.5 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -78.8 MB). Peak memory consumption was 708.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((((((((((((((!(0 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) || 10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || 23 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) || (9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 4)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3))) || (((9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 4)) && 0 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 12) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3))) || 1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || 8 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || (((9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 4)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3))) || 4 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || 3 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || (((9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 10))) || (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || (((9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 8)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 7)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 <= 8)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1) < 23) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) && 23 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 23)) || !(14 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 133.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 56.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 751 SDtfs, 10282 SDslu, 1286 SDs, 0 SdLazy, 16917 SolverSat, 3251 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 42.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4443 GetRequests, 4015 SyntacticMatches, 242 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8809 ImplicationChecksByTransitivity, 64.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3791occurred in iteration=7, 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: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1422 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 115 PreInvPairs, 193 NumberOfFragments, 538 HoareAnnotationTreeSize, 115 FomulaSimplifications, 50067 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8571 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 68.4s InterpolantComputationTime, 4315 NumberOfCodeBlocks, 4315 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6393 ConstructedInterpolants, 247 QuantifiedInterpolants, 19277646 SizeOfPredicates, 25 NumberOfNonLiveVariables, 3539 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 5402/6781 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label23_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-34-18-473.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label23_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-34-18-473.csv Received shutdown request...