java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:31:16,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:31:16,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:31:16,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:31:16,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:31:16,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:31:16,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:31:16,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:31:16,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:31:16,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:31:16,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:31:16,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:31:16,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:31:16,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:31:16,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:31:16,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:31:16,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:31:16,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:31:16,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:31:16,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:31:16,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:31:16,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:31:16,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:31:16,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:31:16,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:31:16,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:31:16,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:31:16,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:31:16,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:31:16,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:31:16,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:31:16,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:31:16,774 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:31:16,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:31:16,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:31:16,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:31:16,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 11:31:16,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:31:16,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:31:16,795 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:31:16,795 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:31:16,796 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:31:16,796 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:31:16,796 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:31:16,796 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:31:16,796 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:31:16,797 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:31:16,797 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:31:16,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:31:16,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:31:16,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:31:16,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:31:16,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:31:16,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:31:16,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:31:16,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:31:16,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:31:16,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:31:16,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:31:16,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:31:16,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:31:16,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:31:16,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:31:16,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:31:16,801 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:31:16,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:31:16,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:31:16,802 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:31:16,802 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:31:16,802 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:31:16,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:31:16,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:31:16,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:31:16,887 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:31:16,887 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:31:16,888 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c [2018-09-10 11:31:17,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d83dba97/1153dd87c5634889931d82a38c124899/FLAG0e8608695 [2018-09-10 11:31:17,556 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:31:17,557 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c [2018-09-10 11:31:17,576 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d83dba97/1153dd87c5634889931d82a38c124899/FLAG0e8608695 [2018-09-10 11:31:17,592 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d83dba97/1153dd87c5634889931d82a38c124899 [2018-09-10 11:31:17,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:31:17,606 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:31:17,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:31:17,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:31:17,620 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:31:17,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:31:17" (1/1) ... [2018-09-10 11:31:17,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2931cab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:17, skipping insertion in model container [2018-09-10 11:31:17,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:31:17" (1/1) ... [2018-09-10 11:31:17,840 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:31:18,113 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:31:18,146 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:31:18,288 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:31:18,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18 WrapperNode [2018-09-10 11:31:18,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:31:18,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:31:18,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:31:18,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:31:18,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:31:18,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:31:18,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:31:18,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:31:18,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... [2018-09-10 11:31:18,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:31:18,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:31:18,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:31:18,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:31:18,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:31:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:31:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:31:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:31:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:31:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:31:18,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:31:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:31:18,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:31:22,182 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:31:22,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:31:22 BoogieIcfgContainer [2018-09-10 11:31:22,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:31:22,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:31:22,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:31:22,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:31:22,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:31:17" (1/3) ... [2018-09-10 11:31:22,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1105dabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:31:22, skipping insertion in model container [2018-09-10 11:31:22,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:18" (2/3) ... [2018-09-10 11:31:22,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1105dabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:31:22, skipping insertion in model container [2018-09-10 11:31:22,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:31:22" (3/3) ... [2018-09-10 11:31:22,192 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label17_true-unreach-call.c [2018-09-10 11:31:22,201 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:31:22,208 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:31:22,256 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:31:22,257 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:31:22,257 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:31:22,258 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:31:22,258 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:31:22,258 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:31:22,258 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:31:22,258 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:31:22,259 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:31:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-10 11:31:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-10 11:31:22,298 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:22,299 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:31:22,301 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1893194825, now seen corresponding path program 1 times [2018-09-10 11:31:22,309 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:22,362 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:22,778 WARN L175 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:31:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:22,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:22,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:31:22,808 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:22,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:31:22,827 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:31:22,827 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:31:22,830 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-09-10 11:31:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:24,656 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-09-10 11:31:24,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:31:24,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-10 11:31:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:24,679 INFO L225 Difference]: With dead ends: 574 [2018-09-10 11:31:24,680 INFO L226 Difference]: Without dead ends: 356 [2018-09-10 11:31:24,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:31:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-10 11:31:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-09-10 11:31:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-10 11:31:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 607 transitions. [2018-09-10 11:31:24,777 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 607 transitions. Word has length 37 [2018-09-10 11:31:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:24,778 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 607 transitions. [2018-09-10 11:31:24,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:31:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 607 transitions. [2018-09-10 11:31:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-10 11:31:24,786 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:24,786 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:31:24,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash 667598660, now seen corresponding path program 1 times [2018-09-10 11:31:24,787 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:24,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:24,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:24,789 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 11:31:25,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:25,188 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:31:25,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:25,207 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:25,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:25,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:25,669 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 11:31:25,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-09-10 11:31:25,670 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:25,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:31:25,671 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:31:25,672 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:31:25,672 INFO L87 Difference]: Start difference. First operand 356 states and 607 transitions. Second operand 3 states. [2018-09-10 11:31:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:26,940 INFO L93 Difference]: Finished difference Result 994 states and 1764 transitions. [2018-09-10 11:31:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:31:26,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-09-10 11:31:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:26,954 INFO L225 Difference]: With dead ends: 994 [2018-09-10 11:31:26,955 INFO L226 Difference]: Without dead ends: 644 [2018-09-10 11:31:26,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:31:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-09-10 11:31:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2018-09-10 11:31:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-09-10 11:31:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1047 transitions. [2018-09-10 11:31:27,010 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1047 transitions. Word has length 125 [2018-09-10 11:31:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:27,011 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1047 transitions. [2018-09-10 11:31:27,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:31:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1047 transitions. [2018-09-10 11:31:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-10 11:31:27,017 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:27,017 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:31:27,017 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash 214472880, now seen corresponding path program 1 times [2018-09-10 11:31:27,018 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:27,020 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:27,333 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:27,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:31:27,334 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:27,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:31:27,335 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:31:27,335 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:31:27,335 INFO L87 Difference]: Start difference. First operand 644 states and 1047 transitions. Second operand 6 states. [2018-09-10 11:31:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:29,489 INFO L93 Difference]: Finished difference Result 1452 states and 2371 transitions. [2018-09-10 11:31:29,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:31:29,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-09-10 11:31:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:29,508 INFO L225 Difference]: With dead ends: 1452 [2018-09-10 11:31:29,508 INFO L226 Difference]: Without dead ends: 814 [2018-09-10 11:31:29,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:31:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-09-10 11:31:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 802. [2018-09-10 11:31:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2018-09-10 11:31:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1180 transitions. [2018-09-10 11:31:29,545 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1180 transitions. Word has length 163 [2018-09-10 11:31:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:29,545 INFO L480 AbstractCegarLoop]: Abstraction has 802 states and 1180 transitions. [2018-09-10 11:31:29,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:31:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1180 transitions. [2018-09-10 11:31:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-10 11:31:29,550 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:29,550 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:31:29,550 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash 280194000, now seen corresponding path program 1 times [2018-09-10 11:31:29,551 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:29,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:29,552 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:29,867 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:29,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:31:29,868 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:29,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:31:29,868 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:31:29,868 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:31:29,869 INFO L87 Difference]: Start difference. First operand 802 states and 1180 transitions. Second operand 6 states. [2018-09-10 11:31:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:32,900 INFO L93 Difference]: Finished difference Result 2205 states and 3363 transitions. [2018-09-10 11:31:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:31:32,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2018-09-10 11:31:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:32,916 INFO L225 Difference]: With dead ends: 2205 [2018-09-10 11:31:32,916 INFO L226 Difference]: Without dead ends: 1409 [2018-09-10 11:31:32,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:31:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2018-09-10 11:31:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1388. [2018-09-10 11:31:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2018-09-10 11:31:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1933 transitions. [2018-09-10 11:31:32,975 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1933 transitions. Word has length 179 [2018-09-10 11:31:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:32,975 INFO L480 AbstractCegarLoop]: Abstraction has 1388 states and 1933 transitions. [2018-09-10 11:31:32,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:31:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1933 transitions. [2018-09-10 11:31:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-10 11:31:32,983 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:32,983 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:31:32,984 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:32,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1596428024, now seen corresponding path program 1 times [2018-09-10 11:31:32,984 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:32,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:32,985 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-09-10 11:31:33,225 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:33,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:31:33,225 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:33,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:31:33,226 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:31:33,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:31:33,227 INFO L87 Difference]: Start difference. First operand 1388 states and 1933 transitions. Second operand 3 states. [2018-09-10 11:31:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:36,246 INFO L93 Difference]: Finished difference Result 3910 states and 5641 transitions. [2018-09-10 11:31:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:31:36,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2018-09-10 11:31:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:36,262 INFO L225 Difference]: With dead ends: 3910 [2018-09-10 11:31:36,262 INFO L226 Difference]: Without dead ends: 2528 [2018-09-10 11:31:36,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:31:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2018-09-10 11:31:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2516. [2018-09-10 11:31:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2018-09-10 11:31:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 3342 transitions. [2018-09-10 11:31:36,340 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 3342 transitions. Word has length 216 [2018-09-10 11:31:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:36,340 INFO L480 AbstractCegarLoop]: Abstraction has 2516 states and 3342 transitions. [2018-09-10 11:31:36,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:31:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 3342 transitions. [2018-09-10 11:31:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-10 11:31:36,351 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:36,351 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:31:36,351 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:36,352 INFO L82 PathProgramCache]: Analyzing trace with hash -561988101, now seen corresponding path program 1 times [2018-09-10 11:31:36,352 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:36,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:36,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:36,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:36,353 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:36,740 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 11:31:36,935 WARN L175 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 11:31:37,481 WARN L175 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-10 11:31:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:37,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:37,992 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:31:38,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:38,003 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:38,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:38,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:38,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:38,506 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:31:38,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:38,523 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:38,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:38,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:39,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:31:39,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5, 5, 5] total 20 [2018-09-10 11:31:39,202 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:31:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-10 11:31:39,203 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-10 11:31:39,210 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-09-10 11:31:39,210 INFO L87 Difference]: Start difference. First operand 2516 states and 3342 transitions. Second operand 14 states. [2018-09-10 11:31:40,846 WARN L175 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-09-10 11:31:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:45,253 INFO L93 Difference]: Finished difference Result 6587 states and 8905 transitions. [2018-09-10 11:31:45,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-10 11:31:45,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 259 [2018-09-10 11:31:45,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:45,266 INFO L225 Difference]: With dead ends: 6587 [2018-09-10 11:31:45,266 INFO L226 Difference]: Without dead ends: 2075 [2018-09-10 11:31:45,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 1038 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2018-09-10 11:31:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2018-09-10 11:31:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1792. [2018-09-10 11:31:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2018-09-10 11:31:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2186 transitions. [2018-09-10 11:31:45,354 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2186 transitions. Word has length 259 [2018-09-10 11:31:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:45,355 INFO L480 AbstractCegarLoop]: Abstraction has 1792 states and 2186 transitions. [2018-09-10 11:31:45,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-10 11:31:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2186 transitions. [2018-09-10 11:31:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-10 11:31:45,363 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:45,363 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:31:45,364 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash 61983491, now seen corresponding path program 1 times [2018-09-10 11:31:45,364 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:45,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:45,366 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-09-10 11:31:45,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:45,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:31:45,651 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:45,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:31:45,652 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:31:45,652 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:31:45,653 INFO L87 Difference]: Start difference. First operand 1792 states and 2186 transitions. Second operand 4 states. [2018-09-10 11:31:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:46,924 INFO L93 Difference]: Finished difference Result 2236 states and 2662 transitions. [2018-09-10 11:31:46,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:31:46,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2018-09-10 11:31:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:46,934 INFO L225 Difference]: With dead ends: 2236 [2018-09-10 11:31:46,934 INFO L226 Difference]: Without dead ends: 1784 [2018-09-10 11:31:46,937 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:31:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2018-09-10 11:31:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2018-09-10 11:31:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-09-10 11:31:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2162 transitions. [2018-09-10 11:31:46,984 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2162 transitions. Word has length 295 [2018-09-10 11:31:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:46,984 INFO L480 AbstractCegarLoop]: Abstraction has 1784 states and 2162 transitions. [2018-09-10 11:31:46,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:31:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2162 transitions. [2018-09-10 11:31:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-09-10 11:31:46,995 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:46,995 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:31:46,995 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash -50650118, now seen corresponding path program 1 times [2018-09-10 11:31:46,996 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:46,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:46,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:46,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:46,997 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-09-10 11:31:47,279 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:47,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:31:47,279 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:47,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:31:47,280 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:31:47,280 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:31:47,280 INFO L87 Difference]: Start difference. First operand 1784 states and 2162 transitions. Second operand 4 states. [2018-09-10 11:31:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:50,863 INFO L93 Difference]: Finished difference Result 4593 states and 5816 transitions. [2018-09-10 11:31:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:31:50,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-09-10 11:31:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:50,873 INFO L225 Difference]: With dead ends: 4593 [2018-09-10 11:31:50,873 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 11:31:50,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:31:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 11:31:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 11:31:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 11:31:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 11:31:50,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 365 [2018-09-10 11:31:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:50,884 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 11:31:50,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:31:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 11:31:50,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 11:31:50,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 11:31:50,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:50,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:50,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:31:51,511 WARN L175 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-09-10 11:31:51,821 WARN L175 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2018-09-10 11:31:53,440 WARN L175 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 149 DAG size of output: 66 [2018-09-10 11:31:53,748 WARN L175 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2018-09-10 11:31:54,078 WARN L175 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2018-09-10 11:31:54,081 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:31:54,081 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) [2018-09-10 11:31:54,081 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:31:54,081 INFO L426 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-09-10 11:31:54,082 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-09-10 11:31:54,083 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-09-10 11:31:54,084 INFO L426 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-09-10 11:31:54,085 INFO L426 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 11:31:54,086 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-09-10 11:31:54,087 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 11:31:54,088 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,089 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-09-10 11:31:54,090 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 11:31:54,091 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,092 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 11:31:54,093 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 94) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-09-10 11:31:54,094 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,095 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 11:31:54,096 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,097 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 11:31:54,098 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-09-10 11:31:54,099 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-09-10 11:31:54,100 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 11:31:54,100 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 11:31:54,100 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 11:31:54,100 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 11:31:54,100 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 11:31:54,100 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 11:31:54,100 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse13 (= ~__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)|)) (.cse14 (= ~__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)|)) (.cse11 (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse2 (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (.cse8 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9)) (.cse4 (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0))) (.cse16 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (let ((.cse1 (or .cse11 .cse2 .cse8 .cse4 .cse16)) (.cse10 (< 38 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 38)) (.cse0 (and .cse13 .cse14)) (.cse5 (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse3 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 219)) (.cse7 (<= 219 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)) (.cse6 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse12 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 333899) 0)) (.cse15 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 333899)))) (and (or .cse0 .cse1) (or .cse2 .cse0 .cse3 .cse4 .cse5) (or .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse2 .cse0 .cse4 .cse6) (or .cse2 .cse8 .cse4 .cse6 .cse9 .cse10) (or .cse11 .cse2 .cse4 (and .cse12 .cse13 .cse14) .cse15 .cse5) (or .cse1 .cse10 .cse9) (or .cse2 .cse4 (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse0 .cse5) (or (not .cse11) .cse2 (< 218 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) .cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 218) (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (or .cse2 .cse3 .cse4 .cse16 .cse7) (or .cse2 .cse8 .cse4 .cse6 .cse12 .cse15)))) [2018-09-10 11:31:54,101 INFO L426 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-09-10 11:31:54,101 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-09-10 11:31:54,101 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-09-10 11:31:54,101 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:31:54,101 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 1)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 38) (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) (<= 9 ~__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__a12~0 0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) [2018-09-10 11:31:54,101 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 11:31:54,101 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:31:54,102 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) (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 38) (= ~__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)|)) (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)|) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (< 38 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|)) [2018-09-10 11:31:54,102 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:31:54,102 INFO L422 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10)))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4)) (= 1 |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)|) (< 38 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (and (<= 219 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) .cse0) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 333899) 0) .cse0) (and (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) .cse0) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)))) [2018-09-10 11:31:54,102 INFO L426 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-09-10 11:31:54,102 INFO L426 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-09-10 11:31:54,102 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-09-10 11:31:54,103 INFO L422 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10)))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4)) (= 1 |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)|) (< 38 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (and (<= 219 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) .cse0) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 333899) 0) .cse0) (and (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) .cse0) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)))) [2018-09-10 11:31:54,103 INFO L426 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:31:54,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:31:54 BoogieIcfgContainer [2018-09-10 11:31:54,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:31:54,122 INFO L168 Benchmark]: Toolchain (without parser) took 36518.71 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -901.9 MB). Peak memory consumption was 893.6 MB. Max. memory is 7.1 GB. [2018-09-10 11:31:54,123 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 11:31:54,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-10 11:31:54,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 11:31:54,126 INFO L168 Benchmark]: Boogie Preprocessor took 241.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 737.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -837.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-10 11:31:54,127 INFO L168 Benchmark]: RCFGBuilder took 3473.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 110.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. [2018-09-10 11:31:54,127 INFO L168 Benchmark]: TraceAbstraction took 31937.08 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 394.3 MB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -227.2 MB). Peak memory consumption was 831.1 MB. Max. memory is 7.1 GB. [2018-09-10 11:31:54,133 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 121.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 241.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 737.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -837.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3473.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 110.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31937.08 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 394.3 MB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -227.2 MB). Peak memory consumption was 831.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: 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) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) < 9) || 10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 4)) || 1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || 4 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || 38 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) || (219 <= __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 == 10))) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 333899 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 10))) || (!(6 == __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 == 10))) || !(14 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 31.8s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 935 SDtfs, 5053 SDslu, 650 SDs, 0 SdLazy, 7673 SolverSat, 1749 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1371 GetRequests, 1302 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2516occurred in iteration=5, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 328 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 84 PreInvPairs, 148 NumberOfFragments, 450 HoareAnnotationTreeSize, 84 FomulaSimplifications, 3675 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4750 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2282 NumberOfCodeBlocks, 2282 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2911 ConstructedInterpolants, 0 QuantifiedInterpolants, 2779671 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1134 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 1516/1552 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_label17_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-31-54-150.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label17_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-31-54-150.csv Received shutdown request...