java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:30:40,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:30:40,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:30:40,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:30:40,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:30:40,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:30:40,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:30:40,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:30:40,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:30:40,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:30:40,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:30:40,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:30:40,524 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:30:40,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:30:40,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:30:40,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:30:40,528 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:30:40,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:30:40,532 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:30:40,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:30:40,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:30:40,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:30:40,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:30:40,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:30:40,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:30:40,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:30:40,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:30:40,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:30:40,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:30:40,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:30:40,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:30:40,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:30:40,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:30:40,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:30:40,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:30:40,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:30:40,554 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:30:40,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:30:40,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:30:40,588 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:30:40,588 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:30:40,589 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:30:40,589 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:30:40,589 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:30:40,589 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:30:40,589 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:30:40,590 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:30:40,590 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:30:40,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:30:40,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:30:40,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:30:40,591 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:30:40,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:30:40,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:30:40,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:30:40,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:30:40,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:30:40,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:30:40,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:30:40,593 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:30:40,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:30:40,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:30:40,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:30:40,594 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:30:40,594 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:30:40,594 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:30:40,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:30:40,595 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:30:40,595 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:30:40,595 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:30:40,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:30:40,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:30:40,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:30:40,675 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:30:40,676 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:30:40,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-09-10 10:30:41,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d9318c9/a65e9367b4b4434daadef3d383d39054/FLAGbe399dd1d [2018-09-10 10:30:41,473 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:30:41,474 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-09-10 10:30:41,500 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d9318c9/a65e9367b4b4434daadef3d383d39054/FLAGbe399dd1d [2018-09-10 10:30:41,516 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d9318c9/a65e9367b4b4434daadef3d383d39054 [2018-09-10 10:30:41,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:30:41,531 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:30:41,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:30:41,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:30:41,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:30:41,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:30:41" (1/1) ... [2018-09-10 10:30:41,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674bafe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:41, skipping insertion in model container [2018-09-10 10:30:41,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:30:41" (1/1) ... [2018-09-10 10:30:41,797 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:30:42,327 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:30:42,348 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:30:42,643 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:30:42,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42 WrapperNode [2018-09-10 10:30:42,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:30:42,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:30:42,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:30:42,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:30:42,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:42,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:42,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:30:42,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:30:42,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:30:42,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:30:43,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:43,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:43,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:43,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:43,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:43,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:43,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... [2018-09-10 10:30:43,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:30:43,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:30:43,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:30:43,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:30:43,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:30:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:30:43,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:30:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 10:30:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 10:30:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:30:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:30:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:30:43,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:30:48,263 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:30:48,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:30:48 BoogieIcfgContainer [2018-09-10 10:30:48,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:30:48,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:30:48,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:30:48,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:30:48,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:30:41" (1/3) ... [2018-09-10 10:30:48,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615bb1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:30:48, skipping insertion in model container [2018-09-10 10:30:48,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:30:42" (2/3) ... [2018-09-10 10:30:48,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615bb1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:30:48, skipping insertion in model container [2018-09-10 10:30:48,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:30:48" (3/3) ... [2018-09-10 10:30:48,275 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label51_true-unreach-call.c [2018-09-10 10:30:48,286 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:30:48,296 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:30:48,370 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:30:48,371 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:30:48,371 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:30:48,372 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:30:48,372 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:30:48,372 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:30:48,372 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:30:48,372 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:30:48,372 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:30:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-10 10:30:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-10 10:30:48,446 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:30:48,449 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:30:48,451 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:30:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1377037548, now seen corresponding path program 1 times [2018-09-10 10:30:48,460 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:30:48,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:30:48,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:30:48,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:30:48,518 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:30:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:30:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:30:49,775 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:30:49,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:30:49,776 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:30:49,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:30:49,792 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:30:49,793 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:30:49,795 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-09-10 10:30:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:30:53,464 INFO L93 Difference]: Finished difference Result 1057 states and 1905 transitions. [2018-09-10 10:30:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:30:53,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-09-10 10:30:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:30:53,495 INFO L225 Difference]: With dead ends: 1057 [2018-09-10 10:30:53,495 INFO L226 Difference]: Without dead ends: 739 [2018-09-10 10:30:53,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:30:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-09-10 10:30:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 528. [2018-09-10 10:30:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-09-10 10:30:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 879 transitions. [2018-09-10 10:30:53,604 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 879 transitions. Word has length 195 [2018-09-10 10:30:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:30:53,605 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 879 transitions. [2018-09-10 10:30:53,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:30:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 879 transitions. [2018-09-10 10:30:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-10 10:30:53,614 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:30:53,614 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:30:53,615 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:30:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1645009688, now seen corresponding path program 1 times [2018-09-10 10:30:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:30:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:30:53,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:30:53,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:30:53,617 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:30:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:30:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:30:54,374 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:30:54,374 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:30:54,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:30:54,384 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:30:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:30:54,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:30:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:30:54,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:30:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:30:55,435 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:30:55,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-09-10 10:30:55,436 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:30:55,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:30:55,439 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:30:55,441 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:30:55,442 INFO L87 Difference]: Start difference. First operand 528 states and 879 transitions. Second operand 3 states. [2018-09-10 10:30:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:30:58,189 INFO L93 Difference]: Finished difference Result 1470 states and 2525 transitions. [2018-09-10 10:30:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:30:58,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-09-10 10:30:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:30:58,198 INFO L225 Difference]: With dead ends: 1470 [2018-09-10 10:30:58,198 INFO L226 Difference]: Without dead ends: 948 [2018-09-10 10:30:58,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 416 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:30:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2018-09-10 10:30:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 946. [2018-09-10 10:30:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-09-10 10:30:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1433 transitions. [2018-09-10 10:30:58,251 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1433 transitions. Word has length 208 [2018-09-10 10:30:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:30:58,252 INFO L480 AbstractCegarLoop]: Abstraction has 946 states and 1433 transitions. [2018-09-10 10:30:58,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:30:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1433 transitions. [2018-09-10 10:30:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-10 10:30:58,258 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:30:58,258 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:30:58,259 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:30:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 603155710, now seen corresponding path program 1 times [2018-09-10 10:30:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:30:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:30:58,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:30:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:30:58,261 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:30:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:30:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:30:58,530 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:30:58,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:30:58,530 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:30:58,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:30:58,533 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:30:58,533 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:30:58,533 INFO L87 Difference]: Start difference. First operand 946 states and 1433 transitions. Second operand 6 states. [2018-09-10 10:31:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:02,901 INFO L93 Difference]: Finished difference Result 2018 states and 3070 transitions. [2018-09-10 10:31:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:31:02,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2018-09-10 10:31:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:02,915 INFO L225 Difference]: With dead ends: 2018 [2018-09-10 10:31:02,915 INFO L226 Difference]: Without dead ends: 1078 [2018-09-10 10:31:02,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:31:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2018-09-10 10:31:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 958. [2018-09-10 10:31:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-09-10 10:31:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1373 transitions. [2018-09-10 10:31:02,964 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1373 transitions. Word has length 220 [2018-09-10 10:31:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:02,964 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1373 transitions. [2018-09-10 10:31:02,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:31:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1373 transitions. [2018-09-10 10:31:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-10 10:31:02,969 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:02,970 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:02,970 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash 233310665, now seen corresponding path program 1 times [2018-09-10 10:31:02,970 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:02,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:02,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:02,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:02,973 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:03,196 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:31:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:31:03,260 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:31:03,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:31:03,260 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:03,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:31:03,261 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:31:03,261 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:31:03,262 INFO L87 Difference]: Start difference. First operand 958 states and 1373 transitions. Second operand 6 states. [2018-09-10 10:31:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:05,802 INFO L93 Difference]: Finished difference Result 3051 states and 4546 transitions. [2018-09-10 10:31:05,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:31:05,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2018-09-10 10:31:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:05,823 INFO L225 Difference]: With dead ends: 3051 [2018-09-10 10:31:05,823 INFO L226 Difference]: Without dead ends: 2099 [2018-09-10 10:31:05,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:31:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2018-09-10 10:31:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1999. [2018-09-10 10:31:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2018-09-10 10:31:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2764 transitions. [2018-09-10 10:31:05,908 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2764 transitions. Word has length 223 [2018-09-10 10:31:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:05,909 INFO L480 AbstractCegarLoop]: Abstraction has 1999 states and 2764 transitions. [2018-09-10 10:31:05,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:31:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2764 transitions. [2018-09-10 10:31:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-10 10:31:05,918 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:05,918 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:05,918 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash 599648386, now seen corresponding path program 1 times [2018-09-10 10:31:05,919 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:05,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:05,920 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:31:06,232 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:06,232 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:31:06,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:06,241 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:06,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:31:06,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:31:07,111 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:31:07,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:31:07,112 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:31:07,113 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:31:07,113 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:31:07,114 INFO L87 Difference]: Start difference. First operand 1999 states and 2764 transitions. Second operand 3 states. [2018-09-10 10:31:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:08,678 INFO L93 Difference]: Finished difference Result 4843 states and 6932 transitions. [2018-09-10 10:31:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:31:08,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-09-10 10:31:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:08,705 INFO L225 Difference]: With dead ends: 4843 [2018-09-10 10:31:08,705 INFO L226 Difference]: Without dead ends: 2850 [2018-09-10 10:31:08,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 464 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:31:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2018-09-10 10:31:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2847. [2018-09-10 10:31:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2847 states. [2018-09-10 10:31:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 4020 transitions. [2018-09-10 10:31:08,791 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 4020 transitions. Word has length 233 [2018-09-10 10:31:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:08,792 INFO L480 AbstractCegarLoop]: Abstraction has 2847 states and 4020 transitions. [2018-09-10 10:31:08,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:31:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 4020 transitions. [2018-09-10 10:31:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-10 10:31:08,803 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:08,804 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:08,804 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 735234804, now seen corresponding path program 1 times [2018-09-10 10:31:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:08,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:08,806 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:31:09,127 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:31:09,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:31:09,127 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:09,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:31:09,128 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:31:09,129 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:31:09,129 INFO L87 Difference]: Start difference. First operand 2847 states and 4020 transitions. Second operand 3 states. [2018-09-10 10:31:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:10,886 INFO L93 Difference]: Finished difference Result 8368 states and 12172 transitions. [2018-09-10 10:31:10,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:31:10,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-09-10 10:31:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:10,917 INFO L225 Difference]: With dead ends: 8368 [2018-09-10 10:31:10,917 INFO L226 Difference]: Without dead ends: 5527 [2018-09-10 10:31:10,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:31:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5527 states. [2018-09-10 10:31:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5527 to 5519. [2018-09-10 10:31:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2018-09-10 10:31:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 7757 transitions. [2018-09-10 10:31:11,067 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 7757 transitions. Word has length 241 [2018-09-10 10:31:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:11,068 INFO L480 AbstractCegarLoop]: Abstraction has 5519 states and 7757 transitions. [2018-09-10 10:31:11,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:31:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 7757 transitions. [2018-09-10 10:31:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-10 10:31:11,089 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:11,089 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:11,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1041536929, now seen corresponding path program 1 times [2018-09-10 10:31:11,090 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:11,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:11,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:11,091 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:31:11,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:11,598 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:31:11,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:11,616 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:11,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:31:12,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:31:12,294 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:12,294 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:31:12,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:12,312 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:12,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:31:13,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:31:13,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:31:13,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-10 10:31:13,658 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:31:13,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:31:13,659 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:31:13,660 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:31:13,660 INFO L87 Difference]: Start difference. First operand 5519 states and 7757 transitions. Second operand 9 states. [2018-09-10 10:31:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:17,500 INFO L93 Difference]: Finished difference Result 17094 states and 27314 transitions. [2018-09-10 10:31:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 10:31:17,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2018-09-10 10:31:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:17,595 INFO L225 Difference]: With dead ends: 17094 [2018-09-10 10:31:17,595 INFO L226 Difference]: Without dead ends: 11581 [2018-09-10 10:31:17,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1039 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:31:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11581 states. [2018-09-10 10:31:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11581 to 10418. [2018-09-10 10:31:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10418 states. [2018-09-10 10:31:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10418 states to 10418 states and 14517 transitions. [2018-09-10 10:31:18,018 INFO L78 Accepts]: Start accepts. Automaton has 10418 states and 14517 transitions. Word has length 261 [2018-09-10 10:31:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:18,019 INFO L480 AbstractCegarLoop]: Abstraction has 10418 states and 14517 transitions. [2018-09-10 10:31:18,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:31:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 10418 states and 14517 transitions. [2018-09-10 10:31:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-10 10:31:18,056 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:18,056 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:18,057 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1789229086, now seen corresponding path program 1 times [2018-09-10 10:31:18,057 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:18,058 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:18,369 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:31:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:31:18,568 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:31:18,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:31:18,568 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:18,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:31:18,569 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:31:18,569 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:31:18,569 INFO L87 Difference]: Start difference. First operand 10418 states and 14517 transitions. Second operand 6 states. [2018-09-10 10:31:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:22,423 INFO L93 Difference]: Finished difference Result 20982 states and 29925 transitions. [2018-09-10 10:31:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:31:22,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2018-09-10 10:31:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:22,463 INFO L225 Difference]: With dead ends: 20982 [2018-09-10 10:31:22,463 INFO L226 Difference]: Without dead ends: 10570 [2018-09-10 10:31:22,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:31:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2018-09-10 10:31:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 10456. [2018-09-10 10:31:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10456 states. [2018-09-10 10:31:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10456 states to 10456 states and 13552 transitions. [2018-09-10 10:31:22,754 INFO L78 Accepts]: Start accepts. Automaton has 10456 states and 13552 transitions. Word has length 276 [2018-09-10 10:31:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:22,755 INFO L480 AbstractCegarLoop]: Abstraction has 10456 states and 13552 transitions. [2018-09-10 10:31:22,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:31:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10456 states and 13552 transitions. [2018-09-10 10:31:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-10 10:31:22,792 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:22,793 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:22,793 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1241165023, now seen corresponding path program 1 times [2018-09-10 10:31:22,793 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:22,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:22,794 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:23,155 WARN L175 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:31:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 117 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:23,295 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:23,295 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:31:23,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:23,306 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:23,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:31:23,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 117 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:24,247 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:31:24,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2018-09-10 10:31:24,247 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:24,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:31:24,248 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:31:24,248 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:31:24,248 INFO L87 Difference]: Start difference. First operand 10456 states and 13552 transitions. Second operand 6 states. [2018-09-10 10:31:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:26,658 INFO L93 Difference]: Finished difference Result 21454 states and 28811 transitions. [2018-09-10 10:31:26,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 10:31:26,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 320 [2018-09-10 10:31:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:26,711 INFO L225 Difference]: With dead ends: 21454 [2018-09-10 10:31:26,711 INFO L226 Difference]: Without dead ends: 11003 [2018-09-10 10:31:26,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 632 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-09-10 10:31:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11003 states. [2018-09-10 10:31:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11003 to 10692. [2018-09-10 10:31:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10692 states. [2018-09-10 10:31:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10692 states to 10692 states and 13776 transitions. [2018-09-10 10:31:27,152 INFO L78 Accepts]: Start accepts. Automaton has 10692 states and 13776 transitions. Word has length 320 [2018-09-10 10:31:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:27,153 INFO L480 AbstractCegarLoop]: Abstraction has 10692 states and 13776 transitions. [2018-09-10 10:31:27,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:31:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 10692 states and 13776 transitions. [2018-09-10 10:31:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-10 10:31:27,196 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:27,196 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:27,196 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2105881650, now seen corresponding path program 1 times [2018-09-10 10:31:27,197 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:27,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:27,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:27,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:27,199 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 121 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:27,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:27,595 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:31:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:27,603 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:27,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:31:27,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 121 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:28,213 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:31:28,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 10:31:28,213 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:28,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:31:28,214 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:31:28,214 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:31:28,215 INFO L87 Difference]: Start difference. First operand 10692 states and 13776 transitions. Second operand 5 states. [2018-09-10 10:31:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:30,328 INFO L93 Difference]: Finished difference Result 28857 states and 38078 transitions. [2018-09-10 10:31:30,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:31:30,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2018-09-10 10:31:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:30,394 INFO L225 Difference]: With dead ends: 28857 [2018-09-10 10:31:30,395 INFO L226 Difference]: Without dead ends: 18171 [2018-09-10 10:31:30,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 639 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:31:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2018-09-10 10:31:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 17193. [2018-09-10 10:31:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17193 states. [2018-09-10 10:31:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17193 states to 17193 states and 22241 transitions. [2018-09-10 10:31:30,841 INFO L78 Accepts]: Start accepts. Automaton has 17193 states and 22241 transitions. Word has length 322 [2018-09-10 10:31:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:30,842 INFO L480 AbstractCegarLoop]: Abstraction has 17193 states and 22241 transitions. [2018-09-10 10:31:30,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:31:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 17193 states and 22241 transitions. [2018-09-10 10:31:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-10 10:31:30,879 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:30,880 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:30,880 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash 681995704, now seen corresponding path program 1 times [2018-09-10 10:31:30,880 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:30,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:30,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:30,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:30,882 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:31,697 WARN L175 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-09-10 10:31:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:31:32,481 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:31:32,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-10 10:31:32,482 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:32,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:31:32,482 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:31:32,483 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:31:32,483 INFO L87 Difference]: Start difference. First operand 17193 states and 22241 transitions. Second operand 7 states. [2018-09-10 10:31:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:35,312 INFO L93 Difference]: Finished difference Result 43595 states and 56266 transitions. [2018-09-10 10:31:35,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-10 10:31:35,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 330 [2018-09-10 10:31:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:35,390 INFO L225 Difference]: With dead ends: 43595 [2018-09-10 10:31:35,390 INFO L226 Difference]: Without dead ends: 26408 [2018-09-10 10:31:35,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:31:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26408 states. [2018-09-10 10:31:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26408 to 26199. [2018-09-10 10:31:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26199 states. [2018-09-10 10:31:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26199 states to 26199 states and 33052 transitions. [2018-09-10 10:31:35,978 INFO L78 Accepts]: Start accepts. Automaton has 26199 states and 33052 transitions. Word has length 330 [2018-09-10 10:31:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:35,979 INFO L480 AbstractCegarLoop]: Abstraction has 26199 states and 33052 transitions. [2018-09-10 10:31:35,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:31:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 26199 states and 33052 transitions. [2018-09-10 10:31:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-09-10 10:31:36,022 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:36,022 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:36,022 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 191731517, now seen corresponding path program 1 times [2018-09-10 10:31:36,023 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:36,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:36,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:36,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:36,024 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:31:36,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:36,754 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:31:36,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:36,763 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:37,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:31:37,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:37,665 WARN L175 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2018-09-10 10:31:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 140 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:38,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:31:38,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2018-09-10 10:31:38,066 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:38,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:31:38,067 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:31:38,067 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:31:38,067 INFO L87 Difference]: Start difference. First operand 26199 states and 33052 transitions. Second operand 5 states. [2018-09-10 10:31:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:40,773 INFO L93 Difference]: Finished difference Result 65937 states and 85322 transitions. [2018-09-10 10:31:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:31:40,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 341 [2018-09-10 10:31:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:40,900 INFO L225 Difference]: With dead ends: 65937 [2018-09-10 10:31:40,900 INFO L226 Difference]: Without dead ends: 39744 [2018-09-10 10:31:40,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:31:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39744 states. [2018-09-10 10:31:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39744 to 38849. [2018-09-10 10:31:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38849 states. [2018-09-10 10:31:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38849 states to 38849 states and 47538 transitions. [2018-09-10 10:31:41,689 INFO L78 Accepts]: Start accepts. Automaton has 38849 states and 47538 transitions. Word has length 341 [2018-09-10 10:31:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:41,689 INFO L480 AbstractCegarLoop]: Abstraction has 38849 states and 47538 transitions. [2018-09-10 10:31:41,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:31:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 38849 states and 47538 transitions. [2018-09-10 10:31:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-09-10 10:31:41,745 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:41,745 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:41,746 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash 666754330, now seen corresponding path program 1 times [2018-09-10 10:31:41,746 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:41,747 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 155 proven. 60 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:42,310 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:42,310 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:31:42,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:42,318 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:42,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 173 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:31:43,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:43,479 WARN L175 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2018-09-10 10:31:43,834 WARN L175 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-10 10:31:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 155 proven. 60 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:44,233 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:44,233 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:31:44,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:44,250 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:44,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-10 10:31:46,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:46,554 WARN L175 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2018-09-10 10:31:46,944 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 10:31:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 56 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:31:47,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:31:47,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 6, 8] total 29 [2018-09-10 10:31:47,431 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:31:47,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-10 10:31:47,433 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-10 10:31:47,433 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-09-10 10:31:47,433 INFO L87 Difference]: Start difference. First operand 38849 states and 47538 transitions. Second operand 16 states. [2018-09-10 10:31:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:56,828 INFO L93 Difference]: Finished difference Result 86520 states and 114203 transitions. [2018-09-10 10:31:56,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-10 10:31:56,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 353 [2018-09-10 10:31:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:57,014 INFO L225 Difference]: With dead ends: 86520 [2018-09-10 10:31:57,015 INFO L226 Difference]: Without dead ends: 47677 [2018-09-10 10:31:57,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1494 GetRequests, 1423 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1070, Invalid=3760, Unknown=0, NotChecked=0, Total=4830 [2018-09-10 10:31:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47677 states. [2018-09-10 10:31:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47677 to 46283. [2018-09-10 10:31:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46283 states. [2018-09-10 10:31:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46283 states to 46283 states and 57983 transitions. [2018-09-10 10:31:58,249 INFO L78 Accepts]: Start accepts. Automaton has 46283 states and 57983 transitions. Word has length 353 [2018-09-10 10:31:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:58,250 INFO L480 AbstractCegarLoop]: Abstraction has 46283 states and 57983 transitions. [2018-09-10 10:31:58,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-10 10:31:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46283 states and 57983 transitions. [2018-09-10 10:31:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-09-10 10:31:58,336 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:58,337 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:31:58,337 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:31:58,337 INFO L82 PathProgramCache]: Analyzing trace with hash -707706564, now seen corresponding path program 1 times [2018-09-10 10:31:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:58,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:58,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:58,339 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 160 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:31:58,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:58,993 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:31:59,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:59,001 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:31:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:59,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:31:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:31:59,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:31:59,664 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 10:31:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 160 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:31:59,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:31:59,944 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:31:59,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:59,960 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:00,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:32:00,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 154 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:01,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:32:01,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 8, 8] total 15 [2018-09-10 10:32:01,123 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:32:01,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:32:01,124 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:32:01,124 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:32:01,124 INFO L87 Difference]: Start difference. First operand 46283 states and 57983 transitions. Second operand 8 states. [2018-09-10 10:32:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:10,551 INFO L93 Difference]: Finished difference Result 112284 states and 155441 transitions. [2018-09-10 10:32:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-10 10:32:10,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 354 [2018-09-10 10:32:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:10,924 INFO L225 Difference]: With dead ends: 112284 [2018-09-10 10:32:10,924 INFO L226 Difference]: Without dead ends: 66007 [2018-09-10 10:32:11,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1434 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=1662, Unknown=0, NotChecked=0, Total=2070 [2018-09-10 10:32:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66007 states. [2018-09-10 10:32:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66007 to 63013. [2018-09-10 10:32:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63013 states. [2018-09-10 10:32:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63013 states to 63013 states and 77698 transitions. [2018-09-10 10:32:13,073 INFO L78 Accepts]: Start accepts. Automaton has 63013 states and 77698 transitions. Word has length 354 [2018-09-10 10:32:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:13,073 INFO L480 AbstractCegarLoop]: Abstraction has 63013 states and 77698 transitions. [2018-09-10 10:32:13,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:32:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 63013 states and 77698 transitions. [2018-09-10 10:32:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-09-10 10:32:13,214 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:13,214 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:32:13,214 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:32:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash 640422368, now seen corresponding path program 1 times [2018-09-10 10:32:13,215 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:13,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:13,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:13,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:13,216 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:13,643 WARN L175 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-09-10 10:32:14,015 WARN L175 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:32:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 182 proven. 60 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:14,426 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:14,426 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:32:14,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:14,435 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:14,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-10 10:32:14,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:15,438 WARN L175 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-09-10 10:32:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 184 proven. 49 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:32:15,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:32:15,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 5] total 15 [2018-09-10 10:32:15,736 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:32:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:32:15,737 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:32:15,737 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:32:15,737 INFO L87 Difference]: Start difference. First operand 63013 states and 77698 transitions. Second operand 5 states. [2018-09-10 10:32:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:18,309 INFO L93 Difference]: Finished difference Result 164574 states and 213866 transitions. [2018-09-10 10:32:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:32:18,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 382 [2018-09-10 10:32:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:18,773 INFO L225 Difference]: With dead ends: 164574 [2018-09-10 10:32:18,773 INFO L226 Difference]: Without dead ends: 112850 [2018-09-10 10:32:18,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 756 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:32:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112850 states. [2018-09-10 10:32:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112850 to 110753. [2018-09-10 10:32:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110753 states. [2018-09-10 10:32:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110753 states to 110753 states and 138091 transitions. [2018-09-10 10:32:22,090 INFO L78 Accepts]: Start accepts. Automaton has 110753 states and 138091 transitions. Word has length 382 [2018-09-10 10:32:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:22,091 INFO L480 AbstractCegarLoop]: Abstraction has 110753 states and 138091 transitions. [2018-09-10 10:32:22,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:32:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 110753 states and 138091 transitions. [2018-09-10 10:32:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-09-10 10:32:22,200 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:22,201 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:32:22,201 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:32:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash 201153922, now seen corresponding path program 1 times [2018-09-10 10:32:22,201 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:22,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:22,202 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:32:22,523 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:22,523 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:32:22,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:22,533 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:22,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:32:22,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:32:23,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:23,135 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:32:23,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:23,153 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:23,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:32:23,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:32:24,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:32:24,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 8 [2018-09-10 10:32:24,132 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:32:24,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:32:24,135 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:32:24,135 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:32:24,135 INFO L87 Difference]: Start difference. First operand 110753 states and 138091 transitions. Second operand 7 states. [2018-09-10 10:32:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:31,025 INFO L93 Difference]: Finished difference Result 230119 states and 302007 transitions. [2018-09-10 10:32:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:32:31,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 399 [2018-09-10 10:32:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:31,526 INFO L225 Difference]: With dead ends: 230119 [2018-09-10 10:32:31,527 INFO L226 Difference]: Without dead ends: 119602 [2018-09-10 10:32:31,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1604 GetRequests, 1596 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:32:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119602 states. [2018-09-10 10:32:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119602 to 115172. [2018-09-10 10:32:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115172 states. [2018-09-10 10:32:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115172 states to 115172 states and 136660 transitions. [2018-09-10 10:32:35,441 INFO L78 Accepts]: Start accepts. Automaton has 115172 states and 136660 transitions. Word has length 399 [2018-09-10 10:32:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:35,442 INFO L480 AbstractCegarLoop]: Abstraction has 115172 states and 136660 transitions. [2018-09-10 10:32:35,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:32:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 115172 states and 136660 transitions. [2018-09-10 10:32:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-09-10 10:32:35,560 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:35,560 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:32:35,560 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:32:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1170392780, now seen corresponding path program 1 times [2018-09-10 10:32:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:35,562 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 269 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:32:36,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:36,091 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:32:36,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:36,099 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:36,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 269 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:32:36,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 269 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:32:36,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:36,711 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:32:36,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:36,727 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:37,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 246 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:37,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 269 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (17)] Exception during sending of exit command (exit): Broken pipe [2018-09-10 10:32:37,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:32:37,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 6, 5] total 9 [2018-09-10 10:32:37,769 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:32:37,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:32:37,770 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:32:37,770 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:32:37,770 INFO L87 Difference]: Start difference. First operand 115172 states and 136660 transitions. Second operand 7 states. [2018-09-10 10:32:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:48,605 INFO L93 Difference]: Finished difference Result 410160 states and 542070 transitions. [2018-09-10 10:32:48,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:32:48,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 405 [2018-09-10 10:32:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:50,054 INFO L225 Difference]: With dead ends: 410160 [2018-09-10 10:32:50,054 INFO L226 Difference]: Without dead ends: 312908 [2018-09-10 10:32:50,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1628 GetRequests, 1618 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:32:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312908 states. [2018-09-10 10:33:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312908 to 301917. [2018-09-10 10:33:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301917 states. [2018-09-10 10:33:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301917 states to 301917 states and 372675 transitions. [2018-09-10 10:33:04,151 INFO L78 Accepts]: Start accepts. Automaton has 301917 states and 372675 transitions. Word has length 405 [2018-09-10 10:33:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:33:04,151 INFO L480 AbstractCegarLoop]: Abstraction has 301917 states and 372675 transitions. [2018-09-10 10:33:04,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:33:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 301917 states and 372675 transitions. [2018-09-10 10:33:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-10 10:33:05,666 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:33:05,666 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:33:05,667 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:33:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -793221453, now seen corresponding path program 1 times [2018-09-10 10:33:05,667 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:33:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:05,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:05,668 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:33:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 249 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:33:06,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:33:06,385 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:33:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:06,393 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:33:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:06,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:33:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 273 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-10 10:33:06,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:33:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 273 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-10 10:33:07,315 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:33:07,315 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:33:07,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:07,330 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:33:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:08,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:33:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 226 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-09-10 10:33:08,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:33:09,183 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:33:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 215 proven. 72 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:33:09,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:33:09,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5, 8, 8] total 29 [2018-09-10 10:33:09,747 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:33:09,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-10 10:33:09,748 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-10 10:33:09,749 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-09-10 10:33:09,749 INFO L87 Difference]: Start difference. First operand 301917 states and 372675 transitions. Second operand 16 states. [2018-09-10 10:33:10,921 WARN L175 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-09-10 10:33:22,785 WARN L175 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 Received shutdown request... [2018-09-10 10:34:26,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-10 10:34:26,983 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 10:34:26,994 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 10:34:26,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:34:26 BoogieIcfgContainer [2018-09-10 10:34:26,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:34:26,995 INFO L168 Benchmark]: Toolchain (without parser) took 225466.52 ms. Allocated memory was 1.5 GB in the beginning and 5.0 GB in the end (delta: 3.5 GB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 372.2 MB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. [2018-09-10 10:34:26,996 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:34:26,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1179.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:34:26,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:34:26,998 INFO L168 Benchmark]: Boogie Preprocessor took 349.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.3 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:34:26,999 INFO L168 Benchmark]: RCFGBuilder took 5045.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 281.7 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:34:26,999 INFO L168 Benchmark]: TraceAbstraction took 218728.79 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.7 GB). Free memory was 2.0 GB in the beginning and 1.0 GB in the end (delta: 924.7 MB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. [2018-09-10 10:34:27,004 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.20 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 1179.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 156.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 349.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.3 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5045.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 281.7 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218728.79 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.7 GB). Free memory was 2.0 GB in the beginning and 1.0 GB in the end (delta: 924.7 MB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1599]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1599). Cancelled while BasicCegarLoop was constructing difference of abstraction (301917states) and FLOYD_HOARE automaton (currently 199 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (819570 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 218.6s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 155.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5168 SDtfs, 30904 SDslu, 6944 SDs, 0 SdLazy, 45368 SolverSat, 10272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12970 GetRequests, 12472 SyntacticMatches, 31 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21192 ImplicationChecksByTransitivity, 25.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301917occurred in iteration=17, 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: 26.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 26020 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.7s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 11643 NumberOfCodeBlocks, 11643 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 17759 ConstructedInterpolants, 0 QuantifiedInterpolants, 20788845 SizeOfPredicates, 60 NumberOfNonLiveVariables, 23011 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 54 InterpolantComputations, 14 PerfectInterpolantSequences, 8889/9715 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/Problem03_label51_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-34-27-017.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label51_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-34-27-017.csv Completed graceful shutdown