java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 13:56:19,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 13:56:19,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 13:56:19,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 13:56:19,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 13:56:19,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 13:56:19,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 13:56:19,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 13:56:19,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 13:56:19,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 13:56:19,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 13:56:19,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 13:56:19,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 13:56:19,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 13:56:19,156 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 13:56:19,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 13:56:19,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 13:56:19,159 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 13:56:19,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 13:56:19,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 13:56:19,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 13:56:19,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 13:56:19,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 13:56:19,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 13:56:19,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 13:56:19,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 13:56:19,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 13:56:19,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 13:56:19,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 13:56:19,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 13:56:19,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 13:56:19,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 13:56:19,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 13:56:19,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 13:56:19,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 13:56:19,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 13:56:19,176 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 13:56:19,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 13:56:19,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 13:56:19,193 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 13:56:19,193 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 13:56:19,193 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 13:56:19,194 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 13:56:19,194 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 13:56:19,194 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 13:56:19,194 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 13:56:19,195 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 13:56:19,195 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 13:56:19,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 13:56:19,196 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 13:56:19,196 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 13:56:19,196 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 13:56:19,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 13:56:19,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 13:56:19,197 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 13:56:19,197 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 13:56:19,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 13:56:19,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 13:56:19,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 13:56:19,198 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 13:56:19,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 13:56:19,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 13:56:19,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 13:56:19,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 13:56:19,199 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 13:56:19,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 13:56:19,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 13:56:19,199 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 13:56:19,199 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 13:56:19,200 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 13:56:19,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 13:56:19,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 13:56:19,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 13:56:19,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 13:56:19,263 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 13:56:19,264 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-07-24 13:56:19,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73eab2e24/1d54659e2aac4330923cdff775d145cb/FLAG20f7edde8 [2018-07-24 13:56:19,845 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 13:56:19,847 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-07-24 13:56:19,877 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73eab2e24/1d54659e2aac4330923cdff775d145cb/FLAG20f7edde8 [2018-07-24 13:56:19,893 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73eab2e24/1d54659e2aac4330923cdff775d145cb [2018-07-24 13:56:19,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 13:56:19,906 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 13:56:19,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 13:56:19,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 13:56:19,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 13:56:19,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:56:19" (1/1) ... [2018-07-24 13:56:19,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0fc1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:19, skipping insertion in model container [2018-07-24 13:56:19,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:56:19" (1/1) ... [2018-07-24 13:56:20,165 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 13:56:20,463 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 13:56:20,480 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 13:56:20,579 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 13:56:20,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20 WrapperNode [2018-07-24 13:56:20,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 13:56:20,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 13:56:20,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 13:56:20,627 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 13:56:20,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 13:56:20,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 13:56:20,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 13:56:20,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 13:56:20,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... [2018-07-24 13:56:20,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 13:56:20,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 13:56:20,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 13:56:20,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 13:56:20,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 13:56:21,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 13:56:21,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 13:56:21,059 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-07-24 13:56:21,059 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-07-24 13:56:21,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 13:56:21,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 13:56:21,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 13:56:21,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 13:56:24,749 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 13:56:24,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:56:24 BoogieIcfgContainer [2018-07-24 13:56:24,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 13:56:24,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 13:56:24,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 13:56:24,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 13:56:24,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:56:19" (1/3) ... [2018-07-24 13:56:24,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b659cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:56:24, skipping insertion in model container [2018-07-24 13:56:24,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:56:20" (2/3) ... [2018-07-24 13:56:24,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b659cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:56:24, skipping insertion in model container [2018-07-24 13:56:24,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:56:24" (3/3) ... [2018-07-24 13:56:24,759 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25_true-unreach-call.c [2018-07-24 13:56:24,768 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 13:56:24,776 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 13:56:24,826 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 13:56:24,826 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 13:56:24,827 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 13:56:24,827 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 13:56:24,827 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 13:56:24,827 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 13:56:24,829 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 13:56:24,829 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 13:56:24,829 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 13:56:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-07-24 13:56:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-24 13:56:24,868 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:24,870 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 13:56:24,870 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash 382760497, now seen corresponding path program 1 times [2018-07-24 13:56:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:24,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:24,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:25,420 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 13:56:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 13:56:25,549 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 13:56:25,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 13:56:25,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:56:25,556 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 13:56:25,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 13:56:25,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 13:56:25,578 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-07-24 13:56:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:56:27,694 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-07-24 13:56:27,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 13:56:27,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-07-24 13:56:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:56:27,717 INFO L225 Difference]: With dead ends: 574 [2018-07-24 13:56:27,717 INFO L226 Difference]: Without dead ends: 356 [2018-07-24 13:56:27,725 INFO L573 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-07-24 13:56:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-07-24 13:56:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-07-24 13:56:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-07-24 13:56:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-07-24 13:56:27,802 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 71 [2018-07-24 13:56:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:56:27,803 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-07-24 13:56:27,803 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 13:56:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-07-24 13:56:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-24 13:56:27,813 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:27,813 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 13:56:27,813 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash -35224101, now seen corresponding path program 1 times [2018-07-24 13:56:27,814 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:27,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:27,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:27,816 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 13:56:28,244 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 13:56:28,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 13:56:28,244 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:56:28,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 13:56:28,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 13:56:28,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 13:56:28,247 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-07-24 13:56:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:56:30,642 INFO L93 Difference]: Finished difference Result 998 states and 1753 transitions. [2018-07-24 13:56:30,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 13:56:30,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-07-24 13:56:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:56:30,653 INFO L225 Difference]: With dead ends: 998 [2018-07-24 13:56:30,653 INFO L226 Difference]: Without dead ends: 648 [2018-07-24 13:56:30,659 INFO L573 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-07-24 13:56:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-07-24 13:56:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 639. [2018-07-24 13:56:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-07-24 13:56:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 994 transitions. [2018-07-24 13:56:30,703 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 994 transitions. Word has length 154 [2018-07-24 13:56:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:56:30,704 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 994 transitions. [2018-07-24 13:56:30,704 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 13:56:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 994 transitions. [2018-07-24 13:56:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-24 13:56:30,712 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:30,712 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 13:56:30,712 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 884735739, now seen corresponding path program 1 times [2018-07-24 13:56:30,715 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:30,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:31,079 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 13:56:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 13:56:31,502 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 13:56:31,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 13:56:31,502 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:56:31,505 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 13:56:31,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 13:56:31,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 13:56:31,507 INFO L87 Difference]: Start difference. First operand 639 states and 994 transitions. Second operand 6 states. [2018-07-24 13:56:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:56:35,031 INFO L93 Difference]: Finished difference Result 1567 states and 2516 transitions. [2018-07-24 13:56:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 13:56:35,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-07-24 13:56:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:56:35,046 INFO L225 Difference]: With dead ends: 1567 [2018-07-24 13:56:35,046 INFO L226 Difference]: Without dead ends: 934 [2018-07-24 13:56:35,050 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 13:56:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-07-24 13:56:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 918. [2018-07-24 13:56:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-07-24 13:56:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1356 transitions. [2018-07-24 13:56:35,113 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1356 transitions. Word has length 170 [2018-07-24 13:56:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:56:35,113 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1356 transitions. [2018-07-24 13:56:35,113 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 13:56:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1356 transitions. [2018-07-24 13:56:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-24 13:56:35,121 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:35,121 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 13:56:35,121 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 364276103, now seen corresponding path program 1 times [2018-07-24 13:56:35,122 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:35,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:35,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:35,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:35,416 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 13:56:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 13:56:35,849 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 13:56:35,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 13:56:35,849 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:56:35,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 13:56:35,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 13:56:35,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 13:56:35,851 INFO L87 Difference]: Start difference. First operand 918 states and 1356 transitions. Second operand 6 states. [2018-07-24 13:56:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:56:39,784 INFO L93 Difference]: Finished difference Result 2394 states and 3682 transitions. [2018-07-24 13:56:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 13:56:39,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2018-07-24 13:56:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:56:39,795 INFO L225 Difference]: With dead ends: 2394 [2018-07-24 13:56:39,795 INFO L226 Difference]: Without dead ends: 1482 [2018-07-24 13:56:39,800 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 13:56:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-07-24 13:56:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1460. [2018-07-24 13:56:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2018-07-24 13:56:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2048 transitions. [2018-07-24 13:56:39,845 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2048 transitions. Word has length 192 [2018-07-24 13:56:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:56:39,846 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 2048 transitions. [2018-07-24 13:56:39,846 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 13:56:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2048 transitions. [2018-07-24 13:56:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-24 13:56:39,851 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:39,852 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 13:56:39,852 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash -774507349, now seen corresponding path program 1 times [2018-07-24 13:56:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:39,854 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:40,139 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 13:56:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 13:56:40,237 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 13:56:40,237 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 13:56:40,238 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:56:40,238 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 13:56:40,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 13:56:40,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 13:56:40,239 INFO L87 Difference]: Start difference. First operand 1460 states and 2048 transitions. Second operand 6 states. [2018-07-24 13:56:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:56:41,778 INFO L93 Difference]: Finished difference Result 3258 states and 4710 transitions. [2018-07-24 13:56:41,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 13:56:41,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-07-24 13:56:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:56:41,792 INFO L225 Difference]: With dead ends: 3258 [2018-07-24 13:56:41,793 INFO L226 Difference]: Without dead ends: 1804 [2018-07-24 13:56:41,799 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 13:56:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2018-07-24 13:56:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1766. [2018-07-24 13:56:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2018-07-24 13:56:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2376 transitions. [2018-07-24 13:56:41,878 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2376 transitions. Word has length 194 [2018-07-24 13:56:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:56:41,878 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2376 transitions. [2018-07-24 13:56:41,878 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 13:56:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2376 transitions. [2018-07-24 13:56:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-24 13:56:41,888 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:41,889 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 13:56:41,889 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1703489504, now seen corresponding path program 1 times [2018-07-24 13:56:41,890 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:41,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:41,891 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 128 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 13:56:42,510 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:56:42,510 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 13:56:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:42,586 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:56:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:42,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:56:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 13:56:43,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:56:43,376 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-07-24 13:56:43,535 WARN L169 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-07-24 13:56:44,057 WARN L169 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-07-24 13:56:44,244 WARN L169 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-24 13:56:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 128 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 13:56:44,767 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 13:56:44,767 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2018-07-24 13:56:44,767 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:56:44,768 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 13:56:44,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 13:56:44,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 13:56:44,769 INFO L87 Difference]: Start difference. First operand 1766 states and 2376 transitions. Second operand 5 states. [2018-07-24 13:56:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:56:47,752 INFO L93 Difference]: Finished difference Result 4440 states and 5969 transitions. [2018-07-24 13:56:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 13:56:47,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2018-07-24 13:56:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:56:47,771 INFO L225 Difference]: With dead ends: 4440 [2018-07-24 13:56:47,771 INFO L226 Difference]: Without dead ends: 2680 [2018-07-24 13:56:47,780 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 481 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-07-24 13:56:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2018-07-24 13:56:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2598. [2018-07-24 13:56:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2018-07-24 13:56:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3341 transitions. [2018-07-24 13:56:47,845 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3341 transitions. Word has length 242 [2018-07-24 13:56:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:56:47,846 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 3341 transitions. [2018-07-24 13:56:47,846 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 13:56:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3341 transitions. [2018-07-24 13:56:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-07-24 13:56:47,859 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:47,859 INFO L353 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, 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, 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-07-24 13:56:47,860 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:47,860 INFO L82 PathProgramCache]: Analyzing trace with hash -677086258, now seen corresponding path program 1 times [2018-07-24 13:56:47,860 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:47,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:47,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:47,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:47,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-07-24 13:56:49,198 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:56:49,198 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 13:56:49,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:49,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:56:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:49,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:56:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 13:56:49,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:56:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-07-24 13:56:50,147 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:56:50,147 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 13:56:50,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:50,164 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:56:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:50,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:56:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 13:56:50,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:56:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-07-24 13:56:50,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 13:56:50,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5, 5, 5] total 22 [2018-07-24 13:56:50,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 13:56:50,909 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-24 13:56:50,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-24 13:56:50,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-07-24 13:56:50,910 INFO L87 Difference]: Start difference. First operand 2598 states and 3341 transitions. Second operand 16 states. [2018-07-24 13:56:54,818 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2018-07-24 13:56:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:56:58,624 INFO L93 Difference]: Finished difference Result 6851 states and 9580 transitions. [2018-07-24 13:56:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-24 13:56:58,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 313 [2018-07-24 13:56:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:56:58,659 INFO L225 Difference]: With dead ends: 6851 [2018-07-24 13:56:58,660 INFO L226 Difference]: Without dead ends: 4113 [2018-07-24 13:56:58,686 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1325 GetRequests, 1271 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-07-24 13:56:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-07-24 13:56:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3791. [2018-07-24 13:56:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3791 states. [2018-07-24 13:56:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 4697 transitions. [2018-07-24 13:56:58,819 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 4697 transitions. Word has length 313 [2018-07-24 13:56:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:56:58,820 INFO L471 AbstractCegarLoop]: Abstraction has 3791 states and 4697 transitions. [2018-07-24 13:56:58,820 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-24 13:56:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 4697 transitions. [2018-07-24 13:56:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-07-24 13:56:58,839 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:56:58,839 INFO L353 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 13:56:58,839 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:56:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash 535614069, now seen corresponding path program 1 times [2018-07-24 13:56:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:56:58,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:58,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:58,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:56:58,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:56:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:59,153 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 13:56:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 198 proven. 159 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-07-24 13:56:59,738 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:56:59,738 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 13:56:59,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:56:59,745 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:56:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:56:59,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:57:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 368 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 13:57:00,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:57:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 275 proven. 82 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-07-24 13:57:00,404 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:57:00,404 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 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-07-24 13:57:00,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:57:00,422 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:57:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:57:00,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:57:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 368 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 13:57:00,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:57:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 275 proven. 82 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-07-24 13:57:01,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 13:57:01,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 15 [2018-07-24 13:57:01,054 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 13:57:01,055 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 13:57:01,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 13:57:01,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-24 13:57:01,055 INFO L87 Difference]: Start difference. First operand 3791 states and 4697 transitions. Second operand 11 states. [2018-07-24 13:57:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:57:05,567 INFO L93 Difference]: Finished difference Result 9984 states and 12684 transitions. [2018-07-24 13:57:05,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-24 13:57:05,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 322 [2018-07-24 13:57:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:57:05,576 INFO L225 Difference]: With dead ends: 9984 [2018-07-24 13:57:05,577 INFO L226 Difference]: Without dead ends: 2256 [2018-07-24 13:57:05,607 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1321 GetRequests, 1288 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-07-24 13:57:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2018-07-24 13:57:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1624. [2018-07-24 13:57:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2018-07-24 13:57:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1817 transitions. [2018-07-24 13:57:05,655 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1817 transitions. Word has length 322 [2018-07-24 13:57:05,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:57:05,655 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 1817 transitions. [2018-07-24 13:57:05,656 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 13:57:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1817 transitions. [2018-07-24 13:57:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-07-24 13:57:05,664 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:57:05,665 INFO L353 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, 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, 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-07-24 13:57:05,665 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:57:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash 765572205, now seen corresponding path program 1 times [2018-07-24 13:57:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:57:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:57:05,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:57:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:57:05,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:57:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:57:06,459 WARN L169 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-07-24 13:57:06,704 WARN L169 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-24 13:57:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 283 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 13:57:07,297 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:57:07,297 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-24 13:57:07,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:57:07,305 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:57:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:57:07,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:57:07,761 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 13:57:09,803 WARN L169 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 184 DAG size of output: 37 [2018-07-24 13:57:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 377 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 13:57:10,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:57:11,694 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-07-24 13:57:11,759 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-07-24 13:57:12,115 WARN L169 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-07-24 13:57:12,120 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,173 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,241 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,312 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,368 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,419 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,471 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,529 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,600 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,703 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,762 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:12,821 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:13,155 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:13,474 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:13,791 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:13,849 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:13,966 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,049 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,098 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,225 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,304 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,372 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,430 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,770 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:14,966 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,041 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,096 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,157 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,220 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,284 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,358 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,410 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,462 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,511 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,575 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,748 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,810 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:15,861 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,005 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,071 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,132 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,181 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,233 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,287 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,344 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,394 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,453 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,511 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,568 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,641 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,693 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,796 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,904 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:16,963 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,014 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,066 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,126 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,205 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,273 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,609 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,848 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,905 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:17,962 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,017 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,076 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,135 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,196 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,250 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,310 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,367 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,429 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,488 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,542 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,599 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,656 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,711 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,763 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,819 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:18,879 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,082 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,146 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,202 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,256 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,331 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,384 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,440 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:19,778 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,047 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,106 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,181 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,242 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,309 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,400 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,454 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,525 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,585 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,647 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,746 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,832 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,888 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:20,948 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:21,015 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:21,076 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:21,134 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:21,197 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:21,254 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:21,350 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:21,403 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-07-24 13:57:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 202 proven. 239 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 13:57:22,121 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:57:22,121 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 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-07-24 13:57:22,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:57:22,137 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:57:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:57:22,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:57:28,944 WARN L169 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 189 DAG size of output: 42 [2018-07-24 13:57:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 377 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 13:57:29,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:57:48,448 WARN L169 SmtUtils]: Spent 18.19 s on a formula simplification. DAG size of input: 244 DAG size of output: 31 [2018-07-24 13:57:48,450 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-07-24 13:57:48,686 WARN L169 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-07-24 13:57:48,691 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2018-07-24 13:57:48,968 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 79 [2018-07-24 13:57:50,212 WARN L172 XnfTransformerHelper]: Simplifying conjuction of 5921 disjunctions. This might take some time... [2018-07-24 13:57:50,244 INFO L188 XnfTransformerHelper]: Simplified to conjuction of 29 disjunctions. [2018-07-24 13:57:53,013 WARN L169 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2018-07-24 13:57:53,019 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:53,174 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:53,292 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:53,437 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:53,579 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:53,696 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:53,821 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:54,219 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:54,352 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:54,465 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:54,622 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:54,762 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:54,937 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:55,064 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:55,221 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:55,350 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:55,484 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:55,603 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:55,735 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:55,867 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:56,088 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:56,217 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:56,341 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:56,475 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:56,697 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:56,820 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:56,948 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:57,069 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:57,211 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:57,392 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:57,521 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:57,642 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:57,755 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:57,882 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,014 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,124 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,317 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,437 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,560 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,689 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,815 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:58,942 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,073 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,190 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,315 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,438 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,568 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,699 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,822 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:57:59,942 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:00,056 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:00,338 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:00,639 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:00,765 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:00,957 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:01,080 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:01,224 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:01,373 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:01,515 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:01,646 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:01,775 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:01,908 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,032 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,146 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,266 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,388 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,515 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,638 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,753 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,872 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:02,999 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:03,111 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:03,237 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:03,343 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:03,517 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:03,640 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,034 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,211 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,325 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,449 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,566 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,693 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,820 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:04,937 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:05,076 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:05,379 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:05,494 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:05,619 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:05,738 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:05,863 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,073 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,186 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,324 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,451 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,574 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,690 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,814 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:06,933 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:07,056 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:07,217 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:07,324 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:07,837 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:08,071 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:08,235 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:08,352 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:08,473 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:08,596 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:08,711 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-07-24 13:58:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 200 proven. 241 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 13:58:09,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 13:58:09,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9, 10, 11] total 41 [2018-07-24 13:58:09,866 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 13:58:09,867 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-24 13:58:09,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-24 13:58:09,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2018-07-24 13:58:09,869 INFO L87 Difference]: Start difference. First operand 1624 states and 1817 transitions. Second operand 18 states. [2018-07-24 13:58:17,099 WARN L169 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-07-24 13:58:25,237 WARN L169 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-07-24 13:58:32,549 WARN L169 SmtUtils]: Spent 6.71 s on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2018-07-24 13:58:37,511 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-07-24 13:59:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:59:00,045 INFO L93 Difference]: Finished difference Result 4893 states and 5592 transitions. [2018-07-24 13:59:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-24 13:59:00,045 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 358 [2018-07-24 13:59:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:59:00,059 INFO L225 Difference]: With dead ends: 4893 [2018-07-24 13:59:00,059 INFO L226 Difference]: Without dead ends: 3419 [2018-07-24 13:59:00,064 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1507 GetRequests, 1214 SyntacticMatches, 221 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7925 ImplicationChecksByTransitivity, 68.0s TimeCoverageRelationStatistics Valid=946, Invalid=4456, Unknown=0, NotChecked=0, Total=5402 [2018-07-24 13:59:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2018-07-24 13:59:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 2914. [2018-07-24 13:59:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2018-07-24 13:59:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3276 transitions. [2018-07-24 13:59:00,145 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3276 transitions. Word has length 358 [2018-07-24 13:59:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:59:00,145 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 3276 transitions. [2018-07-24 13:59:00,146 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-24 13:59:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3276 transitions. [2018-07-24 13:59:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-07-24 13:59:00,158 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:59:00,158 INFO L353 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, 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, 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-07-24 13:59:00,158 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:59:00,159 INFO L82 PathProgramCache]: Analyzing trace with hash 651085646, now seen corresponding path program 1 times [2018-07-24 13:59:00,159 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:59:00,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:59:00,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:59:00,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:59:00,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:59:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:59:00,587 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-07-24 13:59:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-07-24 13:59:00,670 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 13:59:00,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 13:59:00,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:59:00,674 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 13:59:00,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 13:59:00,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 13:59:00,675 INFO L87 Difference]: Start difference. First operand 2914 states and 3276 transitions. Second operand 4 states. [2018-07-24 13:59:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:59:02,542 INFO L93 Difference]: Finished difference Result 6404 states and 7259 transitions. [2018-07-24 13:59:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 13:59:02,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-07-24 13:59:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:59:02,556 INFO L225 Difference]: With dead ends: 6404 [2018-07-24 13:59:02,556 INFO L226 Difference]: Without dead ends: 3469 [2018-07-24 13:59:02,560 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 13:59:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2018-07-24 13:59:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3244. [2018-07-24 13:59:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2018-07-24 13:59:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 3695 transitions. [2018-07-24 13:59:02,645 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 3695 transitions. Word has length 377 [2018-07-24 13:59:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:59:02,646 INFO L471 AbstractCegarLoop]: Abstraction has 3244 states and 3695 transitions. [2018-07-24 13:59:02,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 13:59:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 3695 transitions. [2018-07-24 13:59:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-07-24 13:59:02,730 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:59:02,731 INFO L353 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, 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, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 13:59:02,731 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:59:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash -268100511, now seen corresponding path program 1 times [2018-07-24 13:59:02,732 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:59:02,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:59:02,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:59:02,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:59:02,733 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:59:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:59:03,095 WARN L169 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 13:59:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 269 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-07-24 13:59:03,509 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:59:03,509 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 13:59:03,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:59:03,516 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:59:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:59:03,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:59:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-07-24 13:59:03,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:59:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-07-24 13:59:03,996 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:59:03,996 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 13:59:04,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:59:04,013 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:59:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:59:04,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:59:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 390 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 13:59:04,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:59:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 392 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 13:59:04,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 13:59:04,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 13 [2018-07-24 13:59:04,653 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 13:59:04,656 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 13:59:04,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 13:59:04,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-07-24 13:59:04,656 INFO L87 Difference]: Start difference. First operand 3244 states and 3695 transitions. Second operand 11 states. [2018-07-24 13:59:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:59:07,354 INFO L93 Difference]: Finished difference Result 6757 states and 7945 transitions. [2018-07-24 13:59:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-24 13:59:07,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 396 [2018-07-24 13:59:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:59:07,375 INFO L225 Difference]: With dead ends: 6757 [2018-07-24 13:59:07,376 INFO L226 Difference]: Without dead ends: 3807 [2018-07-24 13:59:07,384 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1611 GetRequests, 1579 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2018-07-24 13:59:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2018-07-24 13:59:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3651. [2018-07-24 13:59:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3651 states. [2018-07-24 13:59:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4270 transitions. [2018-07-24 13:59:07,504 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4270 transitions. Word has length 396 [2018-07-24 13:59:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:59:07,505 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 4270 transitions. [2018-07-24 13:59:07,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 13:59:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4270 transitions. [2018-07-24 13:59:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-07-24 13:59:07,524 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 13:59:07,524 INFO L353 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 13:59:07,525 INFO L414 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 13:59:07,525 INFO L82 PathProgramCache]: Analyzing trace with hash 642099933, now seen corresponding path program 1 times [2018-07-24 13:59:07,525 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 13:59:07,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:59:07,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:59:07,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 13:59:07,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 13:59:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:59:08,017 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-07-24 13:59:08,225 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 13:59:08,751 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-24 13:59:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 182 proven. 222 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-07-24 13:59:09,229 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 13:59:09,229 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 13:59:09,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 13:59:09,239 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 13:59:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 13:59:09,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 13:59:13,209 WARN L169 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-07-24 13:59:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 479 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 13:59:15,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 13:59:15,978 WARN L169 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-07-24 13:59:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-07-24 13:59:16,194 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 13:59:16,194 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 12] total 19 [2018-07-24 13:59:16,194 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 13:59:16,195 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 13:59:16,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 13:59:16,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-07-24 13:59:16,195 INFO L87 Difference]: Start difference. First operand 3651 states and 4270 transitions. Second operand 3 states. [2018-07-24 13:59:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 13:59:17,127 INFO L93 Difference]: Finished difference Result 7906 states and 9370 transitions. [2018-07-24 13:59:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 13:59:17,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-07-24 13:59:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 13:59:17,138 INFO L225 Difference]: With dead ends: 7906 [2018-07-24 13:59:17,138 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 13:59:17,157 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 819 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-07-24 13:59:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 13:59:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 13:59:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 13:59:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 13:59:17,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 414 [2018-07-24 13:59:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 13:59:17,161 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 13:59:17,161 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 13:59:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 13:59:17,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 13:59:17,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 13:59:17,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,879 WARN L169 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 212 [2018-07-24 13:59:17,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:17,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:18,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 13:59:18,306 WARN L169 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 212 [2018-07-24 13:59:22,873 WARN L169 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 228 DAG size of output: 61 [2018-07-24 13:59:27,045 WARN L169 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 213 DAG size of output: 70 [2018-07-24 13:59:28,934 WARN L169 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 213 DAG size of output: 70 [2018-07-24 13:59:28,989 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-24 13:59:28,990 INFO L417 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-07-24 13:59:28,990 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-07-24 13:59:28,990 INFO L421 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-07-24 13:59:28,990 INFO L421 ceAbstractionStarter]: For program point L90'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,990 INFO L421 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-07-24 13:59:28,990 INFO L421 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-07-24 13:59:28,990 INFO L421 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-07-24 13:59:28,990 INFO L421 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION(line 196) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L81'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L93'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L60'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,991 INFO L421 ceAbstractionStarter]: For program point L72'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 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-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L180'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L192'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L84'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L96'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L99'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L51'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L63'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L75'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L87'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,992 INFO L421 ceAbstractionStarter]: For program point L162'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L150'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L186'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L174'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L198'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L195'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L183'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L171'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-07-24 13:59:28,993 INFO L421 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L153'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L141'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L177'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L165'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L189'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,994 INFO L421 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L66'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L78'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,995 INFO L421 ceAbstractionStarter]: For program point L30'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L42'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L54'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-07-24 13:59:28,996 INFO L421 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L33'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L45'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L57'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L69'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-07-24 13:59:28,997 INFO L421 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L417 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 ((.cse2 (= ~__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)|)) (.cse3 (= ~__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)|)) (.cse4 (= ~__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 ((.cse6 (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse8 (= 4 |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))) (.cse5 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse7 (and .cse2 .cse3 .cse4)) (.cse9 (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (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) .cse4 .cse2) (or .cse0 .cse1 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse5 .cse6 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| 2))) (or .cse7 (or .cse0 .cse1 .cse6 .cse8 (< 38 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|))) (or .cse0 .cse7 .cse1 .cse6 (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 218) .cse8 .cse9) (or (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) .cse0 .cse1 .cse6 .cse8 .cse7 .cse9) (or (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| 1) .cse7 (or .cse0 .cse1 .cse5 .cse6 .cse8)) (or .cse0 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse1 .cse5 .cse7 .cse9)))) [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L21''(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-07-24 13:59:28,998 INFO L421 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L159'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:28,999 INFO L421 ceAbstractionStarter]: For program point L147'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-07-24 13:59:29,000 INFO L421 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L120'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L144'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L132'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L168'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L156'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,001 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L48'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L24'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L36'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,002 INFO L421 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L27'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L39'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L126'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,003 INFO L421 ceAbstractionStarter]: For program point L114'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L138'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L102'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-07-24 13:59:29,004 INFO L421 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L135'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L111'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L123'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,005 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-07-24 13:59:29,006 INFO L421 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-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-07-24 13:59:29,007 INFO L421 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L201'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L105'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L117'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L129'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-07-24 13:59:29,008 INFO L421 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L108'(lines 20 574) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-07-24 13:59:29,009 INFO L421 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-07-24 13:59:29,010 INFO L417 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-07-24 13:59:29,010 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-24 13:59:29,010 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 13:59:29,010 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 13:59:29,010 INFO L421 ceAbstractionStarter]: For program point L582(lines 582 591) no Hoare annotation was computed. [2018-07-24 13:59:29,010 INFO L421 ceAbstractionStarter]: For program point L590'(line 590) no Hoare annotation was computed. [2018-07-24 13:59:29,010 INFO L417 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse5 (<= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7))) (.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__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))) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8))) (or (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)) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (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__a10~0 1)) .cse1 .cse2 .cse3) (= 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 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) .cse4 .cse2) (< |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)|) (= 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 (and .cse0 .cse4 .cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) .cse5) (and .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 38) .cse1 .cse3) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse5 (and .cse0 (and .cse4 .cse1 .cse3))) (and (< 218 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (and .cse0 .cse1 .cse3 .cse2)))) [2018-07-24 13:59:29,010 INFO L421 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-07-24 13:59:29,011 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-07-24 13:59:29,011 INFO L417 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)) (= 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) (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)) (= 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-07-24 13:59:29,011 INFO L421 ceAbstractionStarter]: For program point L582'''(lines 576 592) no Hoare annotation was computed. [2018-07-24 13:59:29,011 INFO L417 ceAbstractionStarter]: At program point L582''(lines 582 591) the Hoare annotation is: (let ((.cse5 (<= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7))) (.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__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))) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8))) (or (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)) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (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__a10~0 1)) .cse1 .cse2 .cse3) (= 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 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) .cse4 .cse2) (< |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)|) (= 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 (and .cse0 .cse4 .cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) .cse5) (and .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 38) .cse1 .cse3) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse5 (and .cse0 (and .cse4 .cse1 .cse3))) (and (< 218 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (and .cse0 .cse1 .cse3 .cse2)))) [2018-07-24 13:59:29,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:59:29 BoogieIcfgContainer [2018-07-24 13:59:29,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 13:59:29,035 INFO L168 Benchmark]: Toolchain (without parser) took 189130.66 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -237.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-07-24 13:59:29,037 INFO L168 Benchmark]: CDTParser took 0.23 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-07-24 13:59:29,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.92 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-07-24 13:59:29,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.47 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-07-24 13:59:29,039 INFO L168 Benchmark]: Boogie Preprocessor took 245.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2018-07-24 13:59:29,039 INFO L168 Benchmark]: RCFGBuilder took 3770.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 110.1 MB). Peak memory consumption was 110.1 MB. Max. memory is 7.1 GB. [2018-07-24 13:59:29,040 INFO L168 Benchmark]: TraceAbstraction took 184283.36 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 757.6 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 485.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-24 13:59:29,047 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.23 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 718.92 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 107.47 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 245.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3770.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 110.1 MB). Peak memory consumption was 110.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 184283.36 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 757.6 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 485.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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) || (((__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)) || 23 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) || (\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__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__a19 <= 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3))) || 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 == 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) || !(14 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4)) || 10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || 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__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)) && 1 <= __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__a1 <= 38) && !(__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)) || (1 <= __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 == 4)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3))) || (218 < __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__a10 == 4)) && !(__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 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 184.1s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 84.7s AutomataDifference, 0.0s DeadEndRemovalTime, 11.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1035 SDtfs, 11354 SDslu, 1446 SDs, 0 SdLazy, 19692 SolverSat, 3635 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 63.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7147 GetRequests, 6665 SyntacticMatches, 258 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8971 ImplicationChecksByTransitivity, 84.0s 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.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 2007 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 215 PreInvPairs, 363 NumberOfFragments, 638 HoareAnnotationTreeSize, 215 FomulaSimplifications, 104893 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18788 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 82.3s InterpolantComputationTime, 6637 NumberOfCodeBlocks, 6637 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10039 ConstructedInterpolants, 321 QuantifiedInterpolants, 26367658 SizeOfPredicates, 30 NumberOfNonLiveVariables, 5519 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 9479/11662 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_label25_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_13-59-29-082.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label25_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_13-59-29-082.csv Received shutdown request...