java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label01_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 14:47:36,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 14:47:36,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 14:47:36,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 14:47:36,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 14:47:36,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 14:47:36,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 14:47:36,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 14:47:36,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 14:47:36,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 14:47:36,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 14:47:36,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 14:47:36,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 14:47:36,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 14:47:36,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 14:47:36,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 14:47:36,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 14:47:36,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 14:47:36,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 14:47:36,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 14:47:36,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 14:47:36,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 14:47:36,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 14:47:36,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 14:47:36,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 14:47:36,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 14:47:36,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 14:47:36,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 14:47:36,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 14:47:36,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 14:47:36,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 14:47:36,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 14:47:36,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 14:47:36,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 14:47:36,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 14:47:36,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 14:47:36,254 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 14:47:36,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 14:47:36,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 14:47:36,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 14:47:36,286 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 14:47:36,286 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 14:47:36,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 14:47:36,287 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 14:47:36,287 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 14:47:36,287 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 14:47:36,287 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 14:47:36,288 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 14:47:36,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 14:47:36,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 14:47:36,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 14:47:36,289 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 14:47:36,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 14:47:36,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 14:47:36,290 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 14:47:36,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 14:47:36,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 14:47:36,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 14:47:36,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 14:47:36,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 14:47:36,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 14:47:36,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 14:47:36,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 14:47:36,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 14:47:36,294 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 14:47:36,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 14:47:36,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 14:47:36,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 14:47:36,295 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 14:47:36,295 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 14:47:36,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 14:47:36,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 14:47:36,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 14:47:36,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 14:47:36,381 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 14:47:36,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label01_true-unreach-call.c [2018-07-24 14:47:36,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8035055bc/43a50578de004138931902fdadda1cfa/FLAG6f517c8e5 [2018-07-24 14:47:37,155 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 14:47:37,156 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label01_true-unreach-call.c [2018-07-24 14:47:37,192 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8035055bc/43a50578de004138931902fdadda1cfa/FLAG6f517c8e5 [2018-07-24 14:47:37,209 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8035055bc/43a50578de004138931902fdadda1cfa [2018-07-24 14:47:37,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 14:47:37,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 14:47:37,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 14:47:37,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 14:47:37,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 14:47:37,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:47:37" (1/1) ... [2018-07-24 14:47:37,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec34fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:37, skipping insertion in model container [2018-07-24 14:47:37,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:47:37" (1/1) ... [2018-07-24 14:47:37,528 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 14:47:38,298 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 14:47:38,315 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 14:47:38,703 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 14:47:38,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38 WrapperNode [2018-07-24 14:47:38,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 14:47:38,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 14:47:38,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 14:47:38,937 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 14:47:38,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:39,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:39,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 14:47:39,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 14:47:39,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 14:47:39,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 14:47:39,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:39,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:39,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:39,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:40,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:40,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:40,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... [2018-07-24 14:47:40,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 14:47:40,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 14:47:40,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 14:47:40,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 14:47:40,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 14:47:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 14:47:40,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 14:47:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-07-24 14:47:40,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-07-24 14:47:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 14:47:40,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 14:47:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 14:47:40,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 14:47:40,275 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-07-24 14:47:40,275 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-07-24 14:47:49,850 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 14:47:49,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:47:49 BoogieIcfgContainer [2018-07-24 14:47:49,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 14:47:49,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 14:47:49,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 14:47:49,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 14:47:49,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 02:47:37" (1/3) ... [2018-07-24 14:47:49,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5f0764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:47:49, skipping insertion in model container [2018-07-24 14:47:49,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:47:38" (2/3) ... [2018-07-24 14:47:49,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5f0764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:47:49, skipping insertion in model container [2018-07-24 14:47:49,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:47:49" (3/3) ... [2018-07-24 14:47:49,860 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label01_true-unreach-call.c [2018-07-24 14:47:49,870 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 14:47:49,880 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 14:47:49,939 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 14:47:49,940 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 14:47:49,940 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 14:47:49,940 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 14:47:49,940 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 14:47:49,940 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 14:47:49,940 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 14:47:49,941 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 14:47:49,941 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 14:47:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-07-24 14:47:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-24 14:47:49,990 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:47:49,991 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 14:47:49,992 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:47:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1975899401, now seen corresponding path program 1 times [2018-07-24 14:47:49,999 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:47:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:47:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:47:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:47:50,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:47:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:47:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 14:47:50,545 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 14:47:50,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 14:47:50,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 14:47:50,561 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 14:47:50,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 14:47:50,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 14:47:50,593 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-07-24 14:48:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:48:03,464 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-07-24 14:48:03,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 14:48:03,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-07-24 14:48:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:48:03,515 INFO L225 Difference]: With dead ends: 2166 [2018-07-24 14:48:03,516 INFO L226 Difference]: Without dead ends: 1556 [2018-07-24 14:48:03,525 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-07-24 14:48:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-07-24 14:48:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-07-24 14:48:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-07-24 14:48:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-07-24 14:48:03,664 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 53 [2018-07-24 14:48:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:48:03,665 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-07-24 14:48:03,665 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 14:48:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-07-24 14:48:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-24 14:48:03,678 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:48:03,679 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 14:48:03,680 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:48:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1528848190, now seen corresponding path program 1 times [2018-07-24 14:48:03,681 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:48:03,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:03,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:03,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:03,683 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:48:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 14:48:04,020 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 14:48:04,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 14:48:04,021 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 14:48:04,022 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 14:48:04,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 14:48:04,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 14:48:04,023 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-07-24 14:48:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:48:12,502 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-07-24 14:48:12,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 14:48:12,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-07-24 14:48:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:48:12,525 INFO L225 Difference]: With dead ends: 3059 [2018-07-24 14:48:12,525 INFO L226 Difference]: Without dead ends: 1997 [2018-07-24 14:48:12,530 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 14:48:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-07-24 14:48:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-07-24 14:48:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-07-24 14:48:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-07-24 14:48:12,605 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 129 [2018-07-24 14:48:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:48:12,606 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-07-24 14:48:12,606 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 14:48:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-07-24 14:48:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-24 14:48:12,611 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:48:12,612 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 14:48:12,612 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:48:12,612 INFO L82 PathProgramCache]: Analyzing trace with hash 304825738, now seen corresponding path program 1 times [2018-07-24 14:48:12,613 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:48:12,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:12,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:12,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:12,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:48:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:12,946 WARN L169 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 14:48:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 14:48:13,277 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 14:48:13,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 14:48:13,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 14:48:13,278 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 14:48:13,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 14:48:13,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 14:48:13,279 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-07-24 14:48:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:48:19,570 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-07-24 14:48:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 14:48:19,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-07-24 14:48:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:48:19,591 INFO L225 Difference]: With dead ends: 4880 [2018-07-24 14:48:19,591 INFO L226 Difference]: Without dead ends: 2911 [2018-07-24 14:48:19,600 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 14:48:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-07-24 14:48:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-07-24 14:48:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-07-24 14:48:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-07-24 14:48:19,691 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 133 [2018-07-24 14:48:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:48:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-07-24 14:48:19,692 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 14:48:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-07-24 14:48:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-24 14:48:19,697 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:48:19,697 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 14:48:19,697 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:48:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1998016877, now seen corresponding path program 1 times [2018-07-24 14:48:19,698 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:48:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:19,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:48:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 14:48:19,982 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 14:48:19,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 14:48:19,983 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 14:48:19,983 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 14:48:19,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 14:48:19,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 14:48:19,984 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-07-24 14:48:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:48:25,969 INFO L93 Difference]: Finished difference Result 5754 states and 7882 transitions. [2018-07-24 14:48:25,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 14:48:25,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-07-24 14:48:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:48:25,984 INFO L225 Difference]: With dead ends: 5754 [2018-07-24 14:48:25,984 INFO L226 Difference]: Without dead ends: 2880 [2018-07-24 14:48:25,995 INFO L573 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-07-24 14:48:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-07-24 14:48:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2018-07-24 14:48:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-07-24 14:48:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3720 transitions. [2018-07-24 14:48:26,060 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3720 transitions. Word has length 163 [2018-07-24 14:48:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:48:26,061 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 3720 transitions. [2018-07-24 14:48:26,061 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 14:48:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3720 transitions. [2018-07-24 14:48:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-24 14:48:26,064 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:48:26,065 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 14:48:26,065 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:48:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1645409491, now seen corresponding path program 1 times [2018-07-24 14:48:26,065 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:48:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:26,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:26,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:48:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-07-24 14:48:26,273 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 14:48:26,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 14:48:26,273 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 14:48:26,274 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 14:48:26,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 14:48:26,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 14:48:26,274 INFO L87 Difference]: Start difference. First operand 2880 states and 3720 transitions. Second operand 4 states. [2018-07-24 14:48:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:48:34,437 INFO L93 Difference]: Finished difference Result 11062 states and 14732 transitions. [2018-07-24 14:48:34,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 14:48:34,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2018-07-24 14:48:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:48:34,474 INFO L225 Difference]: With dead ends: 11062 [2018-07-24 14:48:34,474 INFO L226 Difference]: Without dead ends: 8188 [2018-07-24 14:48:34,486 INFO L573 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-07-24 14:48:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8188 states. [2018-07-24 14:48:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8188 to 8188. [2018-07-24 14:48:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8188 states. [2018-07-24 14:48:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8188 states to 8188 states and 10116 transitions. [2018-07-24 14:48:34,679 INFO L78 Accepts]: Start accepts. Automaton has 8188 states and 10116 transitions. Word has length 217 [2018-07-24 14:48:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:48:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 8188 states and 10116 transitions. [2018-07-24 14:48:34,680 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 14:48:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 8188 states and 10116 transitions. [2018-07-24 14:48:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-24 14:48:34,689 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:48:34,689 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-07-24 14:48:34,690 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:48:34,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1846307545, now seen corresponding path program 1 times [2018-07-24 14:48:34,690 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:48:34,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:34,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:34,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:48:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 92 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 14:48:35,250 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 14:48:35,251 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 14:48:35,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:35,260 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 14:48:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:35,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 14:48:35,918 WARN L169 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2018-07-24 14:48:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-07-24 14:48:35,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 14:48:36,534 WARN L169 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-07-24 14:48:37,655 WARN L169 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-07-24 14:48:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 92 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 14:48:37,936 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 14:48:37,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2018-07-24 14:48:37,936 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 14:48:37,937 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 14:48:37,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 14:48:37,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-07-24 14:48:37,938 INFO L87 Difference]: Start difference. First operand 8188 states and 10116 transitions. Second operand 5 states. [2018-07-24 14:48:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:48:48,867 INFO L93 Difference]: Finished difference Result 19547 states and 23953 transitions. [2018-07-24 14:48:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 14:48:48,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2018-07-24 14:48:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:48:48,936 INFO L225 Difference]: With dead ends: 19547 [2018-07-24 14:48:48,936 INFO L226 Difference]: Without dead ends: 11365 [2018-07-24 14:48:48,965 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-07-24 14:48:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2018-07-24 14:48:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 11288. [2018-07-24 14:48:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11288 states. [2018-07-24 14:48:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11288 states to 11288 states and 13550 transitions. [2018-07-24 14:48:49,264 INFO L78 Accepts]: Start accepts. Automaton has 11288 states and 13550 transitions. Word has length 240 [2018-07-24 14:48:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:48:49,265 INFO L471 AbstractCegarLoop]: Abstraction has 11288 states and 13550 transitions. [2018-07-24 14:48:49,265 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 14:48:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11288 states and 13550 transitions. [2018-07-24 14:48:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-24 14:48:49,277 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:48:49,278 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 14:48:49,278 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:48:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash 235689615, now seen corresponding path program 1 times [2018-07-24 14:48:49,279 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:48:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:49,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:48:49,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:48:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 148 proven. 209 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 14:48:50,262 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 14:48:50,262 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 14:48:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:50,281 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 14:48:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:50,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 14:48:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-07-24 14:48:50,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 14:48:53,319 WARN L169 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 39 DAG size of output: 15 [2018-07-24 14:48:55,758 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-07-24 14:48:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 148 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 14:48:56,367 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 14:48:56,367 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 14:48:56,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:48:56,390 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 14:48:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:48:56,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 14:48:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-07-24 14:48:56,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 14:48:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 148 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 14:48:57,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 14:48:57,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 7, 8] total 17 [2018-07-24 14:48:57,597 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 14:48:57,597 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 14:48:57,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 14:48:57,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=193, Unknown=1, NotChecked=0, Total=272 [2018-07-24 14:48:57,598 INFO L87 Difference]: Start difference. First operand 11288 states and 13550 transitions. Second operand 11 states. [2018-07-24 14:49:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:49:33,207 INFO L93 Difference]: Finished difference Result 35828 states and 45453 transitions. [2018-07-24 14:49:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-24 14:49:33,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 292 [2018-07-24 14:49:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:49:33,303 INFO L225 Difference]: With dead ends: 35828 [2018-07-24 14:49:33,303 INFO L226 Difference]: Without dead ends: 24983 [2018-07-24 14:49:33,340 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1163 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=168, Invalid=383, Unknown=1, NotChecked=0, Total=552 [2018-07-24 14:49:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24983 states. [2018-07-24 14:49:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24983 to 23591. [2018-07-24 14:49:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23591 states. [2018-07-24 14:49:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23591 states to 23591 states and 28913 transitions. [2018-07-24 14:49:33,866 INFO L78 Accepts]: Start accepts. Automaton has 23591 states and 28913 transitions. Word has length 292 [2018-07-24 14:49:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:49:33,867 INFO L471 AbstractCegarLoop]: Abstraction has 23591 states and 28913 transitions. [2018-07-24 14:49:33,867 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 14:49:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23591 states and 28913 transitions. [2018-07-24 14:49:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-07-24 14:49:33,878 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:49:33,878 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-07-24 14:49:33,878 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:49:33,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1431354697, now seen corresponding path program 1 times [2018-07-24 14:49:33,879 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:49:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:49:33,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:49:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:49:33,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:49:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:49:34,347 WARN L169 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-07-24 14:49:34,838 WARN L169 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-07-24 14:49:35,286 WARN L169 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 14:49:35,616 WARN L169 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 14:49:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 144 proven. 214 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 14:49:36,061 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 14:49:36,061 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 14:49:36,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:49:36,073 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 14:49:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:49:36,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 14:49:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 316 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-07-24 14:49:36,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 14:49:37,167 WARN L169 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 14:49:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 216 proven. 76 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-07-24 14:49:37,835 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 14:49:37,835 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 14:49:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:49:37,870 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 14:49:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:49:38,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 14:49:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-07-24 14:49:38,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 14:49:38,935 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-07-24 14:49:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 146 proven. 142 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-07-24 14:49:39,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 14:49:39,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 18 [2018-07-24 14:49:39,394 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 14:49:39,395 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 14:49:39,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 14:49:39,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-07-24 14:49:39,395 INFO L87 Difference]: Start difference. First operand 23591 states and 28913 transitions. Second operand 12 states. [2018-07-24 14:50:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 14:50:06,623 INFO L93 Difference]: Finished difference Result 58180 states and 73436 transitions. [2018-07-24 14:50:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-24 14:50:06,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 315 [2018-07-24 14:50:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 14:50:06,774 INFO L225 Difference]: With dead ends: 58180 [2018-07-24 14:50:06,775 INFO L226 Difference]: Without dead ends: 32712 [2018-07-24 14:50:07,077 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1380 GetRequests, 1306 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=921, Invalid=4481, Unknown=0, NotChecked=0, Total=5402 [2018-07-24 14:50:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32712 states. [2018-07-24 14:50:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32712 to 30605. [2018-07-24 14:50:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30605 states. [2018-07-24 14:50:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30605 states to 30605 states and 36609 transitions. [2018-07-24 14:50:07,740 INFO L78 Accepts]: Start accepts. Automaton has 30605 states and 36609 transitions. Word has length 315 [2018-07-24 14:50:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 14:50:07,740 INFO L471 AbstractCegarLoop]: Abstraction has 30605 states and 36609 transitions. [2018-07-24 14:50:07,740 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 14:50:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 30605 states and 36609 transitions. [2018-07-24 14:50:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-24 14:50:07,751 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 14:50:07,751 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 14:50:07,752 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 14:50:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash -665866497, now seen corresponding path program 1 times [2018-07-24 14:50:07,752 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 14:50:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:50:07,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:50:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 14:50:07,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 14:50:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:50:08,423 WARN L169 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-07-24 14:50:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 140 proven. 124 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-07-24 14:50:08,639 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 14:50:08,639 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 14:50:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:50:08,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 14:50:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:50:08,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 14:50:15,880 WARN L1010 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_38 Int)) (let ((.cse1 (* 9 v_prenex_38))) (let ((.cse0 (div .cse1 10))) (and (= (mod (+ .cse0 1) 5) 0) (<= 0 .cse1) (<= v_prenex_38 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= 0 .cse0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse0 5)))))) (exists ((v_prenex_34 Int)) (let ((.cse3 (* 9 v_prenex_34))) (let ((.cse4 (div .cse3 10))) (let ((.cse2 (+ .cse4 1))) (and (= (mod .cse2 5) 0) (<= v_prenex_34 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse2 5)) (< .cse3 0) (<= 0 .cse4) (not (= 0 (mod .cse3 10)))))))) (exists ((v_prenex_33 Int)) (let ((.cse6 (* 9 v_prenex_33))) (let ((.cse5 (div .cse6 10))) (and (< .cse5 0) (not (= (mod .cse5 5) 0)) (= 0 (mod .cse6 10)) (<= 0 (+ .cse5 1)) (<= v_prenex_33 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse5 5)))))) (exists ((v_prenex_28 Int)) (let ((.cse8 (* 9 v_prenex_28))) (let ((.cse9 (div .cse8 10))) (let ((.cse7 (+ .cse9 1))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse7 5)) (not (= 0 (mod .cse8 10))) (<= v_prenex_28 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= (mod .cse9 5) 0) (< .cse8 0) (= (mod .cse7 5) 0)))))) (exists ((v_prenex_44 Int)) (let ((.cse11 (* 9 v_prenex_44))) (let ((.cse10 (div .cse11 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse10 5)) (= (mod .cse10 5) 0) (= (mod (+ .cse10 1) 5) 0) (<= v_prenex_44 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= 0 (mod .cse11 10)))))) (exists ((v_prenex_40 Int)) (let ((.cse12 (* 9 v_prenex_40))) (let ((.cse13 (div .cse12 10))) (and (<= 0 .cse12) (<= v_prenex_40 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= 0 (+ .cse13 1)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse13 5)) (= (mod .cse13 5) 0))))) (exists ((v_prenex_30 Int)) (let ((.cse15 (* 9 v_prenex_30))) (let ((.cse16 (div .cse15 10))) (let ((.cse14 (+ .cse16 1))) (and (<= v_prenex_30 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (< .cse14 0) (<= 0 .cse15) (not (= (mod .cse16 5) 0)) (not (= (mod .cse14 5) 0)) (< .cse16 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse16 5))))))) (exists ((v_prenex_21 Int)) (let ((.cse18 (* 9 v_prenex_21))) (let ((.cse17 (div .cse18 10))) (and (<= 0 (+ .cse17 1)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse17 5)) (= (mod .cse17 5) 0) (<= v_prenex_21 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= 0 (mod .cse18 10)))))) (exists ((v_prenex_27 Int)) (let ((.cse20 (* 9 v_prenex_27))) (let ((.cse21 (div .cse20 10))) (let ((.cse19 (+ .cse21 1))) (and (<= v_prenex_27 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse19 5)) (< .cse19 0) (not (= 0 (mod .cse20 10))) (<= 0 .cse21) (not (= (mod .cse19 5) 0)) (< .cse20 0)))))) (exists ((v_prenex_39 Int)) (let ((.cse23 (* 9 v_prenex_39))) (let ((.cse24 (div .cse23 10))) (let ((.cse22 (+ .cse24 1))) (and (<= 0 .cse22) (<= v_prenex_39 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (< .cse23 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse22 5)) (= (mod .cse24 5) 0) (not (= 0 (mod .cse23 10)))))))) (exists ((v_prenex_37 Int)) (let ((.cse27 (* 9 v_prenex_37))) (let ((.cse26 (div .cse27 10))) (let ((.cse25 (+ .cse26 1))) (and (< .cse25 0) (<= 0 .cse26) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse26 5)) (<= 0 .cse27) (<= v_prenex_37 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (not (= (mod .cse25 5) 0))))))) (exists ((v_prenex_42 Int)) (let ((.cse29 (* 9 v_prenex_42))) (let ((.cse28 (div .cse29 10))) (and (not (= (mod .cse28 5) 0)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse28 5)) (= (mod (+ .cse28 1) 5) 0) (<= v_prenex_42 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= 0 (mod .cse29 10)) (< .cse28 0))))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1407 Int)) (let ((.cse30 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1407))) (let ((.cse31 (div .cse30 10))) (and (= 0 (mod .cse30 10)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse31 5)) (<= 0 .cse31) (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1407 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= 0 (+ .cse31 1)))))) (exists ((v_prenex_19 Int)) (let ((.cse33 (* 9 v_prenex_19))) (let ((.cse32 (div .cse33 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse32 5)) (= (mod (+ .cse32 1) 5) 0) (not (= (mod .cse32 5) 0)) (<= 0 .cse33) (< .cse32 0) (<= v_prenex_19 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|))))) (exists ((v_prenex_32 Int)) (let ((.cse35 (* 9 v_prenex_32))) (let ((.cse36 (div .cse35 10))) (let ((.cse34 (+ .cse36 1))) (and (<= 0 .cse34) (not (= 0 (mod .cse35 10))) (<= v_prenex_32 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse34 5)) (< .cse35 0) (<= 0 .cse36)))))) (exists ((v_prenex_23 Int)) (let ((.cse39 (* 9 v_prenex_23))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (+ .cse38 1))) (and (not (= (mod .cse37 5) 0)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse38 5)) (<= 0 .cse38) (< .cse37 0) (<= v_prenex_23 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= 0 (mod .cse39 10))))))) (exists ((v_prenex_22 Int)) (let ((.cse42 (* 9 v_prenex_22))) (let ((.cse41 (div .cse42 10))) (let ((.cse40 (+ .cse41 1))) (and (not (= (mod .cse40 5) 0)) (< .cse41 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse41 5)) (< .cse40 0) (<= v_prenex_22 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= 0 (mod .cse42 10)) (not (= (mod .cse41 5) 0))))))) (exists ((v_prenex_20 Int)) (let ((.cse44 (* 9 v_prenex_20))) (let ((.cse43 (div .cse44 10))) (and (= (mod .cse43 5) 0) (<= 0 .cse44) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse43 5)) (<= v_prenex_20 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= (mod (+ .cse43 1) 5) 0))))) (exists ((v_prenex_31 Int)) (let ((.cse47 (* 9 v_prenex_31))) (let ((.cse45 (div .cse47 10))) (let ((.cse46 (+ .cse45 1))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse45 5)) (<= v_prenex_31 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (= (mod .cse45 5) 0) (< .cse46 0) (not (= (mod .cse46 5) 0)) (= 0 (mod .cse47 10))))))) (exists ((v_prenex_24 Int)) (let ((.cse49 (* 9 v_prenex_24))) (let ((.cse48 (div .cse49 10))) (and (<= 0 (+ .cse48 1)) (<= v_prenex_24 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= 0 .cse48) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse48 5)) (<= 0 .cse49))))) (exists ((v_prenex_36 Int)) (let ((.cse51 (* 9 v_prenex_36))) (let ((.cse52 (div .cse51 10))) (let ((.cse50 (+ .cse52 1))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse50 5)) (not (= 0 (mod .cse51 10))) (not (= (mod .cse50 5) 0)) (< .cse51 0) (= (mod .cse52 5) 0) (<= v_prenex_36 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (< .cse50 0)))))) (exists ((v_prenex_25 Int)) (let ((.cse54 (* 9 v_prenex_25))) (let ((.cse53 (div .cse54 10))) (and (= (mod (+ .cse53 1) 5) 0) (= 0 (mod .cse54 10)) (<= 0 .cse53) (<= v_prenex_25 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse53 5)))))) (exists ((v_prenex_29 Int)) (let ((.cse56 (* 9 v_prenex_29))) (let ((.cse55 (div .cse56 10))) (and (< .cse55 0) (<= 0 .cse56) (<= v_prenex_29 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (not (= (mod .cse55 5) 0)) (<= 0 (+ .cse55 1)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse55 5)))))) (exists ((v_prenex_35 Int)) (let ((.cse59 (* 9 v_prenex_35))) (let ((.cse57 (div .cse59 10))) (let ((.cse58 (+ .cse57 1))) (and (< .cse57 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse58 5)) (not (= (mod .cse57 5) 0)) (< .cse59 0) (= (mod .cse58 5) 0) (<= v_prenex_35 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (not (= 0 (mod .cse59 10)))))))) (exists ((v_prenex_43 Int)) (let ((.cse61 (* 9 v_prenex_43))) (let ((.cse60 (div .cse61 10))) (let ((.cse62 (+ .cse60 1))) (and (< .cse60 0) (< .cse61 0) (<= v_prenex_43 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (not (= (mod .cse62 5) 0)) (not (= (mod .cse60 5) 0)) (< .cse62 0) (not (= 0 (mod .cse61 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225073) (div .cse62 5))))))) (exists ((v_prenex_41 Int)) (let ((.cse65 (* 9 v_prenex_41))) (let ((.cse64 (div .cse65 10))) (let ((.cse63 (+ .cse64 1))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse63 5)) (< .cse64 0) (not (= (mod .cse64 5) 0)) (< .cse65 0) (not (= 0 (mod .cse65 10))) (<= 0 .cse63) (<= v_prenex_41 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|)))))) (exists ((v_prenex_26 Int)) (let ((.cse68 (* 9 v_prenex_26))) (let ((.cse66 (div .cse68 10))) (let ((.cse67 (+ .cse66 1))) (and (= (mod .cse66 5) 0) (not (= (mod .cse67 5) 0)) (< .cse67 0) (<= v_prenex_26 |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0)|) (<= 0 .cse68) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 225074) (div .cse66 5)))))))) is different from false [2018-07-24 14:50:23,191 WARN L169 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 772 DAG size of output: 37 [2018-07-24 14:50:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 13 proven. 247 refuted. 0 times theorem prover too weak. 136 trivial. 4 not checked. [2018-07-24 14:50:23,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 14:50:33,093 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 126 DAG size of output: 16 [2018-07-24 14:50:35,152 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2018-07-24 14:50:44,289 WARN L169 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 76 DAG size of output: 26 [2018-07-24 14:50:44,790 WARN L169 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-07-24 14:50:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 14:50:45,436 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 14:50:45,436 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 14:50:45,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 14:50:45,453 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 14:50:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 14:50:45,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-07-24 14:51:49,701 WARN L177 SmtUtils]: Removed 19 from assertion stack [2018-07-24 14:51:49,702 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-07-24 14:51:49,903 WARN L512 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 14:51:49,903 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 14:51:49,908 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 14:51:49,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 02:51:49 BoogieIcfgContainer [2018-07-24 14:51:49,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 14:51:49,909 INFO L168 Benchmark]: Toolchain (without parser) took 252687.27 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 506.3 MB. Max. memory is 7.1 GB. [2018-07-24 14:51:49,910 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 14:51:49,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1711.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-07-24 14:51:49,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 266.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2018-07-24 14:51:49,912 INFO L168 Benchmark]: Boogie Preprocessor took 992.53 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 930.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 123.7 MB. Max. memory is 7.1 GB. [2018-07-24 14:51:49,913 INFO L168 Benchmark]: RCFGBuilder took 9655.64 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 490.1 MB). Peak memory consumption was 490.1 MB. Max. memory is 7.1 GB. [2018-07-24 14:51:49,914 INFO L168 Benchmark]: TraceAbstraction took 240056.10 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 751.3 MB). Free memory was 1.8 GB in the beginning and 2.6 GB in the end (delta: -745.6 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2018-07-24 14:51:49,921 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.24 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 1711.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 266.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 992.53 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 930.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 123.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9655.64 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 490.1 MB). Peak memory consumption was 490.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240056.10 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 751.3 MB). Free memory was 1.8 GB in the beginning and 2.6 GB in the end (delta: -745.6 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 146). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 176. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 239.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 116.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2636 SDtfs, 22520 SDslu, 3188 SDs, 0 SdLazy, 35022 SolverSat, 8377 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 102.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3095 GetRequests, 2960 SyntacticMatches, 9 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30605occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4117 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 2996 NumberOfCodeBlocks, 2996 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4432 ConstructedInterpolants, 186 QuantifiedInterpolants, 6579190 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2571 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 3243/4458 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label01_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_14-51-49-935.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label01_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_14-51-49-935.csv Completed graceful shutdown