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/Problem15_label57_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:14:49,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:14:49,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:14:49,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:14:49,844 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:14:49,845 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:14:49,846 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:14:49,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:14:49,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:14:49,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:14:49,851 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:14:49,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:14:49,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:14:49,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:14:49,855 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:14:49,855 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:14:49,856 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:14:49,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:14:49,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:14:49,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:14:49,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:14:49,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:14:49,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:14:49,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:14:49,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:14:49,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:14:49,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:14:49,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:14:49,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:14:49,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:14:49,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:14:49,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:14:49,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:14:49,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:14:49,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:14:49,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:14:49,892 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 12:14:49,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:14:49,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:14:49,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:14:49,923 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:14:49,923 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:14:49,923 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:14:49,923 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:14:49,924 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:14:49,924 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:14:49,924 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:14:49,924 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:14:49,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:14:49,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:14:49,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:14:49,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:14:49,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:14:49,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:14:49,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:14:49,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:14:49,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:14:49,926 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:14:49,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:14:49,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:14:49,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:14:49,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:14:49,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:14:49,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:14:49,928 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:14:49,928 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:14:49,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:14:49,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:14:49,929 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:14:49,929 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:14:49,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:14:49,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:14:50,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:14:50,002 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:14:50,003 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:14:50,004 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label57_true-unreach-call.c [2018-09-10 12:14:50,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f908ef587/28b33602a1df49ce832c4cad3ef43d83/FLAG56fbde519 [2018-09-10 12:14:50,720 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:14:50,721 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label57_true-unreach-call.c [2018-09-10 12:14:50,741 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f908ef587/28b33602a1df49ce832c4cad3ef43d83/FLAG56fbde519 [2018-09-10 12:14:50,756 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f908ef587/28b33602a1df49ce832c4cad3ef43d83 [2018-09-10 12:14:50,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:14:50,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:14:50,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:14:50,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:14:50,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:14:50,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:14:50" (1/1) ... [2018-09-10 12:14:50,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3d4853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:50, skipping insertion in model container [2018-09-10 12:14:50,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:14:50" (1/1) ... [2018-09-10 12:14:51,086 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:14:51,775 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:14:51,795 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:14:52,117 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:14:52,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52 WrapperNode [2018-09-10 12:14:52,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:14:52,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:14:52,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:14:52,261 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:14:52,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:52,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:52,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:14:52,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:14:52,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:14:52,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:14:52,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:52,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:52,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:52,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:52,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:53,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:53,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (1/1) ... [2018-09-10 12:14:53,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:14:53,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:14:53,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:14:53,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:14:53,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (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 12:14:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:14:53,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:14:53,138 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 12:14:53,138 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 12:14:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:14:53,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:14:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:14:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:14:53,139 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_output2 [2018-09-10 12:14:53,139 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_output2 [2018-09-10 12:15:00,602 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:15:00,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:15:00 BoogieIcfgContainer [2018-09-10 12:15:00,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:15:00,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:15:00,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:15:00,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:15:00,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:14:50" (1/3) ... [2018-09-10 12:15:00,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b3850a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:15:00, skipping insertion in model container [2018-09-10 12:15:00,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:14:52" (2/3) ... [2018-09-10 12:15:00,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b3850a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:15:00, skipping insertion in model container [2018-09-10 12:15:00,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:15:00" (3/3) ... [2018-09-10 12:15:00,615 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label57_true-unreach-call.c [2018-09-10 12:15:00,626 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:15:00,635 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:15:00,691 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:15:00,691 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:15:00,691 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:15:00,692 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:15:00,692 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:15:00,692 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:15:00,692 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:15:00,692 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:15:00,692 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:15:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-09-10 12:15:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-10 12:15:00,745 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:15:00,746 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:15:00,747 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 12:15:00,751 INFO L82 PathProgramCache]: Analyzing trace with hash -616882708, now seen corresponding path program 1 times [2018-09-10 12:15:00,754 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:15:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:00,800 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:15:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:01,320 WARN L175 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-09-10 12:15:01,340 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 12:15:01,343 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:15:01,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:15:01,343 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:15:01,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:15:01,365 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:15:01,366 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:15:01,369 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-09-10 12:15:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:15:10,735 INFO L93 Difference]: Finished difference Result 1550 states and 2835 transitions. [2018-09-10 12:15:10,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:15:10,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-09-10 12:15:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:15:10,782 INFO L225 Difference]: With dead ends: 1550 [2018-09-10 12:15:10,782 INFO L226 Difference]: Without dead ends: 1106 [2018-09-10 12:15:10,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:15:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-09-10 12:15:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 762. [2018-09-10 12:15:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-10 12:15:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1263 transitions. [2018-09-10 12:15:10,958 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1263 transitions. Word has length 48 [2018-09-10 12:15:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:15:10,958 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 1263 transitions. [2018-09-10 12:15:10,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:15:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1263 transitions. [2018-09-10 12:15:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-10 12:15:10,967 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:15:10,967 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:10,969 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 12:15:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash 755368794, now seen corresponding path program 1 times [2018-09-10 12:15:10,969 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:15:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:10,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:10,971 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:15:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:15:11,226 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:15:11,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 12:15:11,226 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:15:11,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:15:11,228 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:15:11,229 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 12:15:11,229 INFO L87 Difference]: Start difference. First operand 762 states and 1263 transitions. Second operand 5 states. [2018-09-10 12:15:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:15:22,852 INFO L93 Difference]: Finished difference Result 2780 states and 4777 transitions. [2018-09-10 12:15:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:15:22,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-09-10 12:15:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:15:22,869 INFO L225 Difference]: With dead ends: 2780 [2018-09-10 12:15:22,869 INFO L226 Difference]: Without dead ends: 2024 [2018-09-10 12:15:22,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 12:15:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2018-09-10 12:15:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1995. [2018-09-10 12:15:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-09-10 12:15:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2717 transitions. [2018-09-10 12:15:22,964 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2717 transitions. Word has length 121 [2018-09-10 12:15:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:15:22,965 INFO L480 AbstractCegarLoop]: Abstraction has 1995 states and 2717 transitions. [2018-09-10 12:15:22,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:15:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2717 transitions. [2018-09-10 12:15:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-10 12:15:22,973 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:15:22,973 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:22,974 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 12:15:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash 48985162, now seen corresponding path program 1 times [2018-09-10 12:15:22,974 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:15:22,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:22,977 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:15:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:15:23,200 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:15:23,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:15:23,200 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:15:23,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:15:23,201 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:15:23,201 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:15:23,202 INFO L87 Difference]: Start difference. First operand 1995 states and 2717 transitions. Second operand 4 states. [2018-09-10 12:15:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:15:28,740 INFO L93 Difference]: Finished difference Result 7279 states and 10206 transitions. [2018-09-10 12:15:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:15:28,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-09-10 12:15:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:15:28,771 INFO L225 Difference]: With dead ends: 7279 [2018-09-10 12:15:28,772 INFO L226 Difference]: Without dead ends: 5290 [2018-09-10 12:15:28,787 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 12:15:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2018-09-10 12:15:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 5290. [2018-09-10 12:15:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2018-09-10 12:15:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 6779 transitions. [2018-09-10 12:15:28,930 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 6779 transitions. Word has length 129 [2018-09-10 12:15:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:15:28,931 INFO L480 AbstractCegarLoop]: Abstraction has 5290 states and 6779 transitions. [2018-09-10 12:15:28,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:15:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 6779 transitions. [2018-09-10 12:15:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-10 12:15:28,938 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:15:28,938 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-09-10 12:15:28,939 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 12:15:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 286221791, now seen corresponding path program 1 times [2018-09-10 12:15:28,939 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:15:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:28,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:28,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:28,944 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:15:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 83 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 12:15:29,304 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:15:29,304 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 12:15:29,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:29,314 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:15:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:29,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:15:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 12:15:29,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:15:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 12:15:30,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:15:30,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2018-09-10 12:15:30,439 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:15:30,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:15:30,440 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:15:30,440 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:15:30,441 INFO L87 Difference]: Start difference. First operand 5290 states and 6779 transitions. Second operand 5 states. [2018-09-10 12:15:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:15:36,596 INFO L93 Difference]: Finished difference Result 12798 states and 17136 transitions. [2018-09-10 12:15:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 12:15:36,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2018-09-10 12:15:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:15:36,650 INFO L225 Difference]: With dead ends: 12798 [2018-09-10 12:15:36,651 INFO L226 Difference]: Without dead ends: 7514 [2018-09-10 12:15:36,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 402 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-09-10 12:15:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7514 states. [2018-09-10 12:15:36,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7514 to 7416. [2018-09-10 12:15:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2018-09-10 12:15:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 9284 transitions. [2018-09-10 12:15:36,867 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 9284 transitions. Word has length 202 [2018-09-10 12:15:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:15:36,868 INFO L480 AbstractCegarLoop]: Abstraction has 7416 states and 9284 transitions. [2018-09-10 12:15:36,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:15:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 9284 transitions. [2018-09-10 12:15:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-10 12:15:36,877 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:15:36,878 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:15:36,878 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 12:15:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1839989040, now seen corresponding path program 1 times [2018-09-10 12:15:36,879 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:15:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:36,881 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:15:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 82 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:15:37,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:15:37,150 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 12:15:37,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:37,158 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:15:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:37,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:15:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:15:37,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:15:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 82 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:15:37,555 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:15:37,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 12:15:37,556 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:15:37,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:15:37,556 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:15:37,557 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:15:37,557 INFO L87 Difference]: Start difference. First operand 7416 states and 9284 transitions. Second operand 5 states. [2018-09-10 12:15:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:15:43,751 INFO L93 Difference]: Finished difference Result 20271 states and 25586 transitions. [2018-09-10 12:15:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:15:43,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2018-09-10 12:15:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:15:43,803 INFO L225 Difference]: With dead ends: 20271 [2018-09-10 12:15:43,803 INFO L226 Difference]: Without dead ends: 12861 [2018-09-10 12:15:43,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 425 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-10 12:15:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2018-09-10 12:15:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12494. [2018-09-10 12:15:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12494 states. [2018-09-10 12:15:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12494 states to 12494 states and 15076 transitions. [2018-09-10 12:15:44,136 INFO L78 Accepts]: Start accepts. Automaton has 12494 states and 15076 transitions. Word has length 215 [2018-09-10 12:15:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:15:44,136 INFO L480 AbstractCegarLoop]: Abstraction has 12494 states and 15076 transitions. [2018-09-10 12:15:44,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:15:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 12494 states and 15076 transitions. [2018-09-10 12:15:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-09-10 12:15:44,159 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:15:44,159 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:44,160 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 12:15:44,160 INFO L82 PathProgramCache]: Analyzing trace with hash 477743455, now seen corresponding path program 1 times [2018-09-10 12:15:44,160 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:15:44,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:44,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:44,161 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:15:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 211 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 12:15:44,810 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:15:44,810 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:15:44,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:44,818 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:15:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:44,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:15:45,158 WARN L175 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 3 [2018-09-10 12:15:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-09-10 12:15:45,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:15:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-09-10 12:15:45,438 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:15:45,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 7 [2018-09-10 12:15:45,439 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:15:45,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:15:45,440 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:15:45,440 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-10 12:15:45,440 INFO L87 Difference]: Start difference. First operand 12494 states and 15076 transitions. Second operand 3 states. [2018-09-10 12:15:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:15:49,653 INFO L93 Difference]: Finished difference Result 30612 states and 37800 transitions. [2018-09-10 12:15:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:15:49,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2018-09-10 12:15:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:15:49,728 INFO L225 Difference]: With dead ends: 30612 [2018-09-10 12:15:49,728 INFO L226 Difference]: Without dead ends: 18124 [2018-09-10 12:15:49,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-10 12:15:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18124 states. [2018-09-10 12:15:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18124 to 18087. [2018-09-10 12:15:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18087 states. [2018-09-10 12:15:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18087 states to 18087 states and 22165 transitions. [2018-09-10 12:15:50,158 INFO L78 Accepts]: Start accepts. Automaton has 18087 states and 22165 transitions. Word has length 416 [2018-09-10 12:15:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:15:50,158 INFO L480 AbstractCegarLoop]: Abstraction has 18087 states and 22165 transitions. [2018-09-10 12:15:50,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:15:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 18087 states and 22165 transitions. [2018-09-10 12:15:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-09-10 12:15:50,193 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:15:50,193 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:50,194 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 12:15:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2116443073, now seen corresponding path program 1 times [2018-09-10 12:15:50,194 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:15:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:50,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:15:50,195 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:15:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 211 proven. 82 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-09-10 12:15:50,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:15:50,905 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:15:50,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:50,920 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:15:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:51,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:15:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 330 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:15:51,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:15:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 211 proven. 82 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-09-10 12:15:51,807 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:15:51,807 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:15:51,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:15:51,824 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:15:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:15:52,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:15:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 330 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:15:52,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:15:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 211 proven. 82 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-09-10 12:15:52,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:15:52,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:15:52,518 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:15:52,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:15:52,520 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:15:52,520 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:15:52,520 INFO L87 Difference]: Start difference. First operand 18087 states and 22165 transitions. Second operand 9 states. [2018-09-10 12:16:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:16:02,680 INFO L93 Difference]: Finished difference Result 38545 states and 51418 transitions. [2018-09-10 12:16:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-10 12:16:02,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 419 [2018-09-10 12:16:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:16:02,813 INFO L225 Difference]: With dead ends: 38545 [2018-09-10 12:16:02,813 INFO L226 Difference]: Without dead ends: 20464 [2018-09-10 12:16:02,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1702 GetRequests, 1678 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-09-10 12:16:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20464 states. [2018-09-10 12:16:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20464 to 20387. [2018-09-10 12:16:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20387 states. [2018-09-10 12:16:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20387 states to 20387 states and 26475 transitions. [2018-09-10 12:16:03,515 INFO L78 Accepts]: Start accepts. Automaton has 20387 states and 26475 transitions. Word has length 419 [2018-09-10 12:16:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:16:03,516 INFO L480 AbstractCegarLoop]: Abstraction has 20387 states and 26475 transitions. [2018-09-10 12:16:03,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:16:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 20387 states and 26475 transitions. [2018-09-10 12:16:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-09-10 12:16:03,558 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:16:03,558 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:03,559 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 12:16:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash -903053447, now seen corresponding path program 1 times [2018-09-10 12:16:03,559 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:16:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:03,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:03,560 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:16:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:16:04,036 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:16:04,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 12:16:04,036 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:16:04,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:16:04,037 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:16:04,037 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:16:04,038 INFO L87 Difference]: Start difference. First operand 20387 states and 26475 transitions. Second operand 3 states. [2018-09-10 12:16:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:16:07,774 INFO L93 Difference]: Finished difference Result 43603 states and 58176 transitions. [2018-09-10 12:16:07,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:16:07,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2018-09-10 12:16:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:16:07,891 INFO L225 Difference]: With dead ends: 43603 [2018-09-10 12:16:07,891 INFO L226 Difference]: Without dead ends: 23222 [2018-09-10 12:16:08,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:16:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23222 states. [2018-09-10 12:16:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23222 to 23222. [2018-09-10 12:16:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23222 states. [2018-09-10 12:16:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23222 states to 23222 states and 30319 transitions. [2018-09-10 12:16:08,614 INFO L78 Accepts]: Start accepts. Automaton has 23222 states and 30319 transitions. Word has length 507 [2018-09-10 12:16:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:16:08,615 INFO L480 AbstractCegarLoop]: Abstraction has 23222 states and 30319 transitions. [2018-09-10 12:16:08,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:16:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 23222 states and 30319 transitions. [2018-09-10 12:16:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-09-10 12:16:08,650 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:16:08,651 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:08,652 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:16:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1705855345, now seen corresponding path program 1 times [2018-09-10 12:16:08,652 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:16:08,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:08,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:08,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:08,654 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:16:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 125 proven. 15 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-09-10 12:16:09,919 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:16:09,919 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:16:09,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:09,932 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:16:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:10,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:16:11,363 WARN L175 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-09-10 12:16:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-09-10 12:16:11,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:16:12,475 WARN L175 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-09-10 12:16:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 123 proven. 199 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-09-10 12:16:13,586 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:16:13,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2018-09-10 12:16:13,587 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:16:13,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:16:13,588 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:16:13,588 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:16:13,588 INFO L87 Difference]: Start difference. First operand 23222 states and 30319 transitions. Second operand 5 states. [2018-09-10 12:16:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:16:21,210 INFO L93 Difference]: Finished difference Result 48728 states and 64444 transitions. [2018-09-10 12:16:21,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:16:21,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 511 [2018-09-10 12:16:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:16:21,351 INFO L225 Difference]: With dead ends: 48728 [2018-09-10 12:16:21,351 INFO L226 Difference]: Without dead ends: 25512 [2018-09-10 12:16:21,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1019 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-10 12:16:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25512 states. [2018-09-10 12:16:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25512 to 25478. [2018-09-10 12:16:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25478 states. [2018-09-10 12:16:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25478 states to 25478 states and 33437 transitions. [2018-09-10 12:16:22,170 INFO L78 Accepts]: Start accepts. Automaton has 25478 states and 33437 transitions. Word has length 511 [2018-09-10 12:16:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:16:22,171 INFO L480 AbstractCegarLoop]: Abstraction has 25478 states and 33437 transitions. [2018-09-10 12:16:22,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:16:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 25478 states and 33437 transitions. [2018-09-10 12:16:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-09-10 12:16:22,212 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:16:22,213 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:22,213 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:16:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2095836220, now seen corresponding path program 1 times [2018-09-10 12:16:22,215 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:16:22,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:22,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:22,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:22,216 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:16:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 347 proven. 39 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:16:22,722 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:16:22,722 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:16:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:22,732 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:16:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:22,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:16:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-09-10 12:16:23,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:16:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-09-10 12:16:23,261 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:16:23,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 4 [2018-09-10 12:16:23,262 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:16:23,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:16:23,263 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:16:23,263 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:16:23,264 INFO L87 Difference]: Start difference. First operand 25478 states and 33437 transitions. Second operand 3 states. [2018-09-10 12:16:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:16:26,135 INFO L93 Difference]: Finished difference Result 53394 states and 70626 transitions. [2018-09-10 12:16:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:16:26,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2018-09-10 12:16:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:16:26,276 INFO L225 Difference]: With dead ends: 53394 [2018-09-10 12:16:26,276 INFO L226 Difference]: Without dead ends: 28230 [2018-09-10 12:16:26,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1028 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:16:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28230 states. [2018-09-10 12:16:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28230 to 27917. [2018-09-10 12:16:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27917 states. [2018-09-10 12:16:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27917 states to 27917 states and 36443 transitions. [2018-09-10 12:16:27,098 INFO L78 Accepts]: Start accepts. Automaton has 27917 states and 36443 transitions. Word has length 514 [2018-09-10 12:16:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:16:27,099 INFO L480 AbstractCegarLoop]: Abstraction has 27917 states and 36443 transitions. [2018-09-10 12:16:27,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:16:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 27917 states and 36443 transitions. [2018-09-10 12:16:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-09-10 12:16:27,110 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:16:27,111 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:27,111 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:16:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -149086347, now seen corresponding path program 1 times [2018-09-10 12:16:27,111 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:16:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:27,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:27,112 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:16:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 251 proven. 83 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-10 12:16:27,965 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:16:27,966 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:16:27,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:27,981 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:16:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:28,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:16:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 372 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:16:28,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:16:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 251 proven. 83 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-10 12:16:29,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:16:29,025 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:16:29,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:29,042 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:16:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:29,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:16:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 372 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:16:29,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:16:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 251 proven. 83 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-10 12:16:29,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:16:29,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:16:29,866 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:16:29,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:16:29,867 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:16:29,867 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:16:29,867 INFO L87 Difference]: Start difference. First operand 27917 states and 36443 transitions. Second operand 9 states. [2018-09-10 12:16:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:16:39,047 INFO L93 Difference]: Finished difference Result 58484 states and 86043 transitions. [2018-09-10 12:16:39,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-10 12:16:39,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 546 [2018-09-10 12:16:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:16:39,333 INFO L225 Difference]: With dead ends: 58484 [2018-09-10 12:16:39,334 INFO L226 Difference]: Without dead ends: 30881 [2018-09-10 12:16:39,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2214 GetRequests, 2188 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-09-10 12:16:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30881 states. [2018-09-10 12:16:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30881 to 30828. [2018-09-10 12:16:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30828 states. [2018-09-10 12:16:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30828 states to 30828 states and 46833 transitions. [2018-09-10 12:16:40,718 INFO L78 Accepts]: Start accepts. Automaton has 30828 states and 46833 transitions. Word has length 546 [2018-09-10 12:16:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:16:40,719 INFO L480 AbstractCegarLoop]: Abstraction has 30828 states and 46833 transitions. [2018-09-10 12:16:40,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:16:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30828 states and 46833 transitions. [2018-09-10 12:16:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-09-10 12:16:40,734 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:16:40,735 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:16:40,735 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:16:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -892406168, now seen corresponding path program 1 times [2018-09-10 12:16:40,736 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:16:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:40,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:16:40,737 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:16:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 268 proven. 371 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-09-10 12:16:42,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:16:42,607 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:16:42,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:42,615 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:16:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:42,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:16:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 524 proven. 41 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-09-10 12:16:43,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:16:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 179 proven. 460 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-09-10 12:16:44,683 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:16:44,684 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 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:16:44,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:16:44,700 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:16:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:16:45,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:16:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 474 proven. 41 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-09-10 12:16:46,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:16:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 179 proven. 460 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-09-10 12:16:47,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:16:47,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 8, 9] total 23 [2018-09-10 12:16:47,474 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:16:47,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 12:16:47,475 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 12:16:47,476 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2018-09-10 12:16:47,476 INFO L87 Difference]: Start difference. First operand 30828 states and 46833 transitions. Second operand 13 states. [2018-09-10 12:17:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:10,650 INFO L93 Difference]: Finished difference Result 73074 states and 111878 transitions. [2018-09-10 12:17:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-10 12:17:10,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 607 [2018-09-10 12:17:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:10,959 INFO L225 Difference]: With dead ends: 73074 [2018-09-10 12:17:10,960 INFO L226 Difference]: Without dead ends: 41336 [2018-09-10 12:17:11,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2483 GetRequests, 2437 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=492, Invalid=1578, Unknown=0, NotChecked=0, Total=2070 [2018-09-10 12:17:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41336 states. [2018-09-10 12:17:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41336 to 40685. [2018-09-10 12:17:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40685 states. [2018-09-10 12:17:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40685 states to 40685 states and 61393 transitions. [2018-09-10 12:17:13,719 INFO L78 Accepts]: Start accepts. Automaton has 40685 states and 61393 transitions. Word has length 607 [2018-09-10 12:17:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:13,719 INFO L480 AbstractCegarLoop]: Abstraction has 40685 states and 61393 transitions. [2018-09-10 12:17:13,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 12:17:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 40685 states and 61393 transitions. [2018-09-10 12:17:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-09-10 12:17:13,743 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:13,744 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:17:13,744 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash -841146554, now seen corresponding path program 1 times [2018-09-10 12:17:13,745 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:13,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:13,748 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-09-10 12:17:14,520 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:14,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:17:14,520 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:14,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:17:14,521 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:17:14,521 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:17:14,522 INFO L87 Difference]: Start difference. First operand 40685 states and 61393 transitions. Second operand 4 states. [2018-09-10 12:17:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:23,009 INFO L93 Difference]: Finished difference Result 102497 states and 152682 transitions. [2018-09-10 12:17:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:17:23,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 610 [2018-09-10 12:17:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:23,163 INFO L225 Difference]: With dead ends: 102497 [2018-09-10 12:17:23,163 INFO L226 Difference]: Without dead ends: 27837 [2018-09-10 12:17:24,655 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 12:17:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27837 states. [2018-09-10 12:17:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27837 to 24722. [2018-09-10 12:17:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24722 states. [2018-09-10 12:17:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24722 states to 24722 states and 31269 transitions. [2018-09-10 12:17:25,344 INFO L78 Accepts]: Start accepts. Automaton has 24722 states and 31269 transitions. Word has length 610 [2018-09-10 12:17:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:25,345 INFO L480 AbstractCegarLoop]: Abstraction has 24722 states and 31269 transitions. [2018-09-10 12:17:25,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:17:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 24722 states and 31269 transitions. [2018-09-10 12:17:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-09-10 12:17:25,382 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:25,383 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:25,383 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1297944384, now seen corresponding path program 1 times [2018-09-10 12:17:25,384 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:25,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:25,385 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 7 proven. 184 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2018-09-10 12:17:26,637 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:17:26,637 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:17:26,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:26,645 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:17:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:26,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:17:31,755 WARN L175 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-09-10 12:17:32,821 WARN L1032 $PredicateComparison]: unable to prove that (or (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0_994 Int)) (let ((.cse0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0_994 299926))) (and (<= .cse0 (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 300074)) (<= (+ v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0_994 44) 0) (= .cse0 0)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (not (= .cse1 0)) (<= .cse1 (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 600000)))))) is different from true [2018-09-10 12:17:39,215 WARN L175 SmtUtils]: Spent 6.05 s on a formula simplification that was a NOOP. DAG size: 39 [2018-09-10 12:17:44,667 WARN L175 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 115 DAG size of output: 23 [2018-09-10 12:17:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 582 refuted. 0 times theorem prover too weak. 491 trivial. 19 not checked. [2018-09-10 12:17:46,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:17:50,177 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 18 [2018-09-10 12:17:52,979 WARN L175 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-09-10 12:17:52,985 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 12:17:55,102 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 12:17:57,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 12:17:59,750 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 12:17:59,890 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 12:18:02,136 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-10 12:18:05,027 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:05,028 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:945) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-09-10 12:18:05,033 INFO L168 Benchmark]: Toolchain (without parser) took 194264.75 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -340.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-10 12:18:05,034 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 12:18:05,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1487.62 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: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-09-10 12:18:05,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 219.42 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-10 12:18:05,036 INFO L168 Benchmark]: Boogie Preprocessor took 589.70 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 899.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2018-09-10 12:18:05,037 INFO L168 Benchmark]: RCFGBuilder took 7533.85 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 326.0 MB). Peak memory consumption was 326.0 MB. Max. memory is 7.1 GB. [2018-09-10 12:18:05,038 INFO L168 Benchmark]: TraceAbstraction took 184427.55 ms. Allocated memory was 2.4 GB in the beginning and 3.9 GB in the end (delta: 1.5 GB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 225.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-10 12:18:05,050 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1487.62 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: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 219.42 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 589.70 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 899.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7533.85 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 326.0 MB). Peak memory consumption was 326.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 184427.55 ms. Allocated memory was 2.4 GB in the beginning and 3.9 GB in the end (delta: 1.5 GB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 225.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem15_label57_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-18-05-070.csv Received shutdown request...