java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label03_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 12:29:23,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 12:29:23,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 12:29:23,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 12:29:23,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 12:29:23,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 12:29:23,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 12:29:23,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 12:29:23,169 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 12:29:23,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 12:29:23,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 12:29:23,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 12:29:23,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 12:29:23,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 12:29:23,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 12:29:23,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 12:29:23,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 12:29:23,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 12:29:23,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 12:29:23,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 12:29:23,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 12:29:23,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 12:29:23,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 12:29:23,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 12:29:23,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 12:29:23,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 12:29:23,213 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 12:29:23,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 12:29:23,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 12:29:23,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 12:29:23,216 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 12:29:23,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 12:29:23,217 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 12:29:23,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 12:29:23,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 12:29:23,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 12:29:23,219 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 12:29:23,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 12:29:23,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 12:29:23,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 12:29:23,251 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 12:29:23,251 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 12:29:23,251 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 12:29:23,251 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 12:29:23,251 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 12:29:23,251 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 12:29:23,252 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 12:29:23,252 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 12:29:23,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 12:29:23,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 12:29:23,253 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 12:29:23,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 12:29:23,257 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 12:29:23,257 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 12:29:23,257 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 12:29:23,257 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 12:29:23,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 12:29:23,258 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 12:29:23,258 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 12:29:23,258 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 12:29:23,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:29:23,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 12:29:23,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 12:29:23,260 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 12:29:23,260 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 12:29:23,260 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 12:29:23,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 12:29:23,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 12:29:23,261 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 12:29:23,262 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 12:29:23,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 12:29:23,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 12:29:23,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 12:29:23,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 12:29:23,344 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 12:29:23,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label03_false-unreach-call.c [2018-07-24 12:29:23,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289c7c3f6/8474595bde314fba8f0a843b0a674d38/FLAG84e1de956 [2018-07-24 12:29:24,194 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 12:29:24,195 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label03_false-unreach-call.c [2018-07-24 12:29:24,224 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289c7c3f6/8474595bde314fba8f0a843b0a674d38/FLAG84e1de956 [2018-07-24 12:29:24,240 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289c7c3f6/8474595bde314fba8f0a843b0a674d38 [2018-07-24 12:29:24,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 12:29:24,253 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 12:29:24,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 12:29:24,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 12:29:24,262 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 12:29:24,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:29:24" (1/1) ... [2018-07-24 12:29:24,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a59828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:24, skipping insertion in model container [2018-07-24 12:29:24,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:29:24" (1/1) ... [2018-07-24 12:29:24,583 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 12:29:25,405 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:29:25,423 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 12:29:25,928 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:29:26,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26 WrapperNode [2018-07-24 12:29:26,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 12:29:26,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 12:29:26,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 12:29:26,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 12:29:26,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 12:29:26,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 12:29:26,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 12:29:26,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 12:29:26,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... [2018-07-24 12:29:26,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 12:29:26,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 12:29:26,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 12:29:26,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 12:29:26,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:29:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 12:29:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 12:29:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 12:29:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 12:29:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 12:29:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 12:29:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output2 [2018-07-24 12:29:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output2 [2018-07-24 12:29:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output3 [2018-07-24 12:29:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output3 [2018-07-24 12:29:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 12:29:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 12:29:35,131 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 12:29:35,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:29:35 BoogieIcfgContainer [2018-07-24 12:29:35,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 12:29:35,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 12:29:35,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 12:29:35,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 12:29:35,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:29:24" (1/3) ... [2018-07-24 12:29:35,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e4bd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:29:35, skipping insertion in model container [2018-07-24 12:29:35,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:29:26" (2/3) ... [2018-07-24 12:29:35,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e4bd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:29:35, skipping insertion in model container [2018-07-24 12:29:35,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:29:35" (3/3) ... [2018-07-24 12:29:35,141 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label03_false-unreach-call.c [2018-07-24 12:29:35,152 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 12:29:35,165 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 12:29:35,240 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 12:29:35,241 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 12:29:35,241 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 12:29:35,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 12:29:35,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 12:29:35,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 12:29:35,242 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 12:29:35,242 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 12:29:35,242 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 12:29:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-07-24 12:29:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-24 12:29:35,284 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:29:35,285 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:29:35,286 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:29:35,291 INFO L82 PathProgramCache]: Analyzing trace with hash 856071572, now seen corresponding path program 1 times [2018-07-24 12:29:35,294 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:29:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:29:35,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:29:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:29:35,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:29:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:29:35,669 WARN L169 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:29:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:29:35,784 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:29:35,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:29:35,784 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:29:35,790 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:29:35,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:29:35,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:29:35,809 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-07-24 12:29:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:29:42,632 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-07-24 12:29:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:29:42,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-07-24 12:29:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:29:42,669 INFO L225 Difference]: With dead ends: 2251 [2018-07-24 12:29:42,669 INFO L226 Difference]: Without dead ends: 1474 [2018-07-24 12:29:42,681 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:29:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-07-24 12:29:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-07-24 12:29:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-07-24 12:29:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2801 transitions. [2018-07-24 12:29:42,832 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2801 transitions. Word has length 18 [2018-07-24 12:29:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:29:42,833 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2801 transitions. [2018-07-24 12:29:42,833 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:29:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2801 transitions. [2018-07-24 12:29:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-24 12:29:42,842 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:29:42,844 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 12:29:42,845 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:29:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1119264090, now seen corresponding path program 1 times [2018-07-24 12:29:42,845 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:29:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:29:42,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:29:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:29:42,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:29:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:29:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:29:43,218 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:29:43,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:29:43,219 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:29:43,222 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:29:43,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:29:43,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:29:43,223 INFO L87 Difference]: Start difference. First operand 1474 states and 2801 transitions. Second operand 6 states. [2018-07-24 12:29:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:29:52,138 INFO L93 Difference]: Finished difference Result 4416 states and 8482 transitions. [2018-07-24 12:29:52,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:29:52,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-07-24 12:29:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:29:52,160 INFO L225 Difference]: With dead ends: 4416 [2018-07-24 12:29:52,160 INFO L226 Difference]: Without dead ends: 2948 [2018-07-24 12:29:52,166 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:29:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2018-07-24 12:29:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2922. [2018-07-24 12:29:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2018-07-24 12:29:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 5419 transitions. [2018-07-24 12:29:52,258 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 5419 transitions. Word has length 108 [2018-07-24 12:29:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:29:52,259 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 5419 transitions. [2018-07-24 12:29:52,259 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:29:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 5419 transitions. [2018-07-24 12:29:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-24 12:29:52,263 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:29:52,264 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 12:29:52,264 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:29:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1579772111, now seen corresponding path program 1 times [2018-07-24 12:29:52,264 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:29:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:29:52,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:29:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:29:52,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:29:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:29:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:29:52,457 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:29:52,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:29:52,457 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:29:52,458 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:29:52,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:29:52,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:29:52,458 INFO L87 Difference]: Start difference. First operand 2922 states and 5419 transitions. Second operand 5 states. [2018-07-24 12:30:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:30:04,654 INFO L93 Difference]: Finished difference Result 10225 states and 19181 transitions. [2018-07-24 12:30:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 12:30:04,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-07-24 12:30:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:30:04,706 INFO L225 Difference]: With dead ends: 10225 [2018-07-24 12:30:04,706 INFO L226 Difference]: Without dead ends: 7309 [2018-07-24 12:30:04,723 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:30:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2018-07-24 12:30:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 7236. [2018-07-24 12:30:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7236 states. [2018-07-24 12:30:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 11361 transitions. [2018-07-24 12:30:04,950 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 11361 transitions. Word has length 109 [2018-07-24 12:30:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:30:04,951 INFO L471 AbstractCegarLoop]: Abstraction has 7236 states and 11361 transitions. [2018-07-24 12:30:04,951 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:30:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 11361 transitions. [2018-07-24 12:30:04,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-24 12:30:04,956 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:30:04,956 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:30:04,956 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:30:04,957 INFO L82 PathProgramCache]: Analyzing trace with hash -338386591, now seen corresponding path program 1 times [2018-07-24 12:30:04,957 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:30:04,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:04,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:04,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:04,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:30:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:05,380 WARN L169 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:30:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 12:30:05,608 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:30:05,608 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:30:05,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:05,625 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:30:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:05,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:30:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 12:30:06,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:30:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 12:30:06,645 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 12:30:06,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2018-07-24 12:30:06,645 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:30:06,646 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:30:06,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:30:06,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-07-24 12:30:06,647 INFO L87 Difference]: Start difference. First operand 7236 states and 11361 transitions. Second operand 5 states. [2018-07-24 12:30:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:30:14,296 INFO L93 Difference]: Finished difference Result 19699 states and 31488 transitions. [2018-07-24 12:30:14,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:30:14,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2018-07-24 12:30:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:30:14,372 INFO L225 Difference]: With dead ends: 19699 [2018-07-24 12:30:14,372 INFO L226 Difference]: Without dead ends: 12469 [2018-07-24 12:30:14,408 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-07-24 12:30:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12469 states. [2018-07-24 12:30:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12469 to 12339. [2018-07-24 12:30:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12339 states. [2018-07-24 12:30:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12339 states to 12339 states and 16252 transitions. [2018-07-24 12:30:14,937 INFO L78 Accepts]: Start accepts. Automaton has 12339 states and 16252 transitions. Word has length 179 [2018-07-24 12:30:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:30:14,938 INFO L471 AbstractCegarLoop]: Abstraction has 12339 states and 16252 transitions. [2018-07-24 12:30:14,938 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:30:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 12339 states and 16252 transitions. [2018-07-24 12:30:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-24 12:30:14,949 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:30:14,949 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:30:14,950 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:30:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1094792250, now seen corresponding path program 1 times [2018-07-24 12:30:14,950 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:30:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:14,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:30:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:15,406 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-07-24 12:30:15,887 WARN L169 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-07-24 12:30:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 106 proven. 69 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-07-24 12:30:15,940 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:30:15,940 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:30:15,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:15,950 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:30:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:16,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:30:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 12:30:16,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:30:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 106 proven. 69 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-07-24 12:30:16,475 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:30:16,475 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:30:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:16,492 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:30:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:16,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:30:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 12:30:17,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:30:17,205 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:30:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 106 proven. 69 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-07-24 12:30:17,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:30:17,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 14 [2018-07-24 12:30:17,638 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:30:17,639 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 12:30:17,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 12:30:17,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-07-24 12:30:17,639 INFO L87 Difference]: Start difference. First operand 12339 states and 16252 transitions. Second operand 10 states. [2018-07-24 12:30:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:30:29,376 INFO L93 Difference]: Finished difference Result 27716 states and 37673 transitions. [2018-07-24 12:30:29,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-24 12:30:29,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 302 [2018-07-24 12:30:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:30:29,439 INFO L225 Difference]: With dead ends: 27716 [2018-07-24 12:30:29,439 INFO L226 Difference]: Without dead ends: 15383 [2018-07-24 12:30:29,487 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1234 GetRequests, 1208 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2018-07-24 12:30:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15383 states. [2018-07-24 12:30:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15383 to 15319. [2018-07-24 12:30:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2018-07-24 12:30:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 19522 transitions. [2018-07-24 12:30:29,834 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 19522 transitions. Word has length 302 [2018-07-24 12:30:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:30:29,835 INFO L471 AbstractCegarLoop]: Abstraction has 15319 states and 19522 transitions. [2018-07-24 12:30:29,835 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-24 12:30:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 19522 transitions. [2018-07-24 12:30:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-24 12:30:29,844 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:30:29,845 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:30:29,845 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:30:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2075592178, now seen corresponding path program 1 times [2018-07-24 12:30:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:30:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:29,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:29,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:29,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:30:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 110 proven. 73 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-07-24 12:30:30,507 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:30:30,507 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:30:30,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:30,515 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:30:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:30,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:30:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 258 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 12:30:31,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:30:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 110 proven. 73 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-07-24 12:30:31,233 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:30:31,233 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:30:31,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:31,249 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:30:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:31,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:30:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 258 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 12:30:31,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:30:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 110 proven. 73 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-07-24 12:30:31,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:30:31,755 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-07-24 12:30:31,755 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:30:31,756 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 12:30:31,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 12:30:31,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:30:31,757 INFO L87 Difference]: Start difference. First operand 15319 states and 19522 transitions. Second operand 9 states. [2018-07-24 12:30:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:30:43,990 INFO L93 Difference]: Finished difference Result 50425 states and 68859 transitions. [2018-07-24 12:30:43,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-24 12:30:43,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 306 [2018-07-24 12:30:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:30:44,141 INFO L225 Difference]: With dead ends: 50425 [2018-07-24 12:30:44,141 INFO L226 Difference]: Without dead ends: 32506 [2018-07-24 12:30:44,250 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1246 GetRequests, 1225 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-07-24 12:30:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32506 states. [2018-07-24 12:30:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32506 to 30460. [2018-07-24 12:30:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30460 states. [2018-07-24 12:30:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30460 states to 30460 states and 35491 transitions. [2018-07-24 12:30:45,145 INFO L78 Accepts]: Start accepts. Automaton has 30460 states and 35491 transitions. Word has length 306 [2018-07-24 12:30:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:30:45,148 INFO L471 AbstractCegarLoop]: Abstraction has 30460 states and 35491 transitions. [2018-07-24 12:30:45,148 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 12:30:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 30460 states and 35491 transitions. [2018-07-24 12:30:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-07-24 12:30:45,156 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:30:45,157 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:30:45,157 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:30:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1235901071, now seen corresponding path program 1 times [2018-07-24 12:30:45,158 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:30:45,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:45,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:30:45,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:30:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:45,529 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:30:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 124 proven. 112 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-07-24 12:30:46,559 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:30:46,559 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:30:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:46,576 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:30:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:46,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:30:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 216 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:30:47,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:30:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 216 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:30:47,236 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:30:47,236 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:30:47,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:30:47,253 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:30:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:30:47,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:30:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 216 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:30:47,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:30:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 216 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:30:48,550 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:30:48,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 15 [2018-07-24 12:30:48,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:30:48,552 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 12:30:48,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 12:30:48,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-24 12:30:48,552 INFO L87 Difference]: Start difference. First operand 30460 states and 35491 transitions. Second operand 11 states. [2018-07-24 12:31:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:00,864 INFO L93 Difference]: Finished difference Result 65936 states and 77265 transitions. [2018-07-24 12:31:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 12:31:00,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 339 [2018-07-24 12:31:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:00,982 INFO L225 Difference]: With dead ends: 65936 [2018-07-24 12:31:00,982 INFO L226 Difference]: Without dead ends: 35570 [2018-07-24 12:31:01,072 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1384 GetRequests, 1354 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-07-24 12:31:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35570 states. [2018-07-24 12:31:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35570 to 30425. [2018-07-24 12:31:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30425 states. [2018-07-24 12:31:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30425 states to 30425 states and 33844 transitions. [2018-07-24 12:31:01,736 INFO L78 Accepts]: Start accepts. Automaton has 30425 states and 33844 transitions. Word has length 339 [2018-07-24 12:31:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:01,738 INFO L471 AbstractCegarLoop]: Abstraction has 30425 states and 33844 transitions. [2018-07-24 12:31:01,738 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 12:31:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30425 states and 33844 transitions. [2018-07-24 12:31:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-07-24 12:31:01,753 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:01,753 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:31:01,754 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:01,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1844073815, now seen corresponding path program 1 times [2018-07-24 12:31:01,754 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:01,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:01,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 132 proven. 107 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-07-24 12:31:02,247 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:02,247 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:31:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:02,257 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:02,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-07-24 12:31:02,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-07-24 12:31:02,797 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:31:02,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-07-24 12:31:02,798 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:02,798 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:31:02,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:31:02,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:31:02,799 INFO L87 Difference]: Start difference. First operand 30425 states and 33844 transitions. Second operand 3 states. [2018-07-24 12:31:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:05,894 INFO L93 Difference]: Finished difference Result 60751 states and 67558 transitions. [2018-07-24 12:31:05,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:31:05,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2018-07-24 12:31:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:05,993 INFO L225 Difference]: With dead ends: 60751 [2018-07-24 12:31:05,993 INFO L226 Difference]: Without dead ends: 30420 [2018-07-24 12:31:06,058 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 798 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:31:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30420 states. [2018-07-24 12:31:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30420 to 29712. [2018-07-24 12:31:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29712 states. [2018-07-24 12:31:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29712 states to 29712 states and 32594 transitions. [2018-07-24 12:31:06,513 INFO L78 Accepts]: Start accepts. Automaton has 29712 states and 32594 transitions. Word has length 399 [2018-07-24 12:31:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:06,514 INFO L471 AbstractCegarLoop]: Abstraction has 29712 states and 32594 transitions. [2018-07-24 12:31:06,514 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:31:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 29712 states and 32594 transitions. [2018-07-24 12:31:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-07-24 12:31:06,527 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:06,527 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:31:06,527 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 808501130, now seen corresponding path program 1 times [2018-07-24 12:31:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:06,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:06,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 264 proven. 101 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 12:31:07,081 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:07,081 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:31:07,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:07,093 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:07,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:31:07,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:31:07,969 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:07,969 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:31:07,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:07,985 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:08,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:31:08,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 12:31:08,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:31:08,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 15 [2018-07-24 12:31:08,644 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:31:08,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 12:31:08,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 12:31:08,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-07-24 12:31:08,645 INFO L87 Difference]: Start difference. First operand 29712 states and 32594 transitions. Second operand 12 states. [2018-07-24 12:31:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:21,531 INFO L93 Difference]: Finished difference Result 73514 states and 81411 transitions. [2018-07-24 12:31:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-24 12:31:21,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 410 [2018-07-24 12:31:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:21,607 INFO L225 Difference]: With dead ends: 73514 [2018-07-24 12:31:21,607 INFO L226 Difference]: Without dead ends: 43813 [2018-07-24 12:31:21,664 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1652 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=456, Invalid=1524, Unknown=0, NotChecked=0, Total=1980 [2018-07-24 12:31:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43813 states. [2018-07-24 12:31:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43813 to 38011. [2018-07-24 12:31:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38011 states. [2018-07-24 12:31:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38011 states to 38011 states and 40570 transitions. [2018-07-24 12:31:22,202 INFO L78 Accepts]: Start accepts. Automaton has 38011 states and 40570 transitions. Word has length 410 [2018-07-24 12:31:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:22,203 INFO L471 AbstractCegarLoop]: Abstraction has 38011 states and 40570 transitions. [2018-07-24 12:31:22,203 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 12:31:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38011 states and 40570 transitions. [2018-07-24 12:31:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-07-24 12:31:22,228 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:22,228 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:31:22,228 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:22,229 INFO L82 PathProgramCache]: Analyzing trace with hash -905330145, now seen corresponding path program 1 times [2018-07-24 12:31:22,229 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:22,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:22,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:22,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:22,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2018-07-24 12:31:22,635 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:31:22,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 12:31:22,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:22,636 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 12:31:22,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 12:31:22,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:31:22,636 INFO L87 Difference]: Start difference. First operand 38011 states and 40570 transitions. Second operand 4 states. [2018-07-24 12:31:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:28,432 INFO L93 Difference]: Finished difference Result 102700 states and 111039 transitions. [2018-07-24 12:31:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:31:28,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2018-07-24 12:31:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:28,544 INFO L225 Difference]: With dead ends: 102700 [2018-07-24 12:31:28,544 INFO L226 Difference]: Without dead ends: 63326 [2018-07-24 12:31:28,865 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 12:31:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63326 states. [2018-07-24 12:31:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63326 to 57657. [2018-07-24 12:31:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57657 states. [2018-07-24 12:31:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57657 states to 57657 states and 62051 transitions. [2018-07-24 12:31:29,570 INFO L78 Accepts]: Start accepts. Automaton has 57657 states and 62051 transitions. Word has length 527 [2018-07-24 12:31:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:29,571 INFO L471 AbstractCegarLoop]: Abstraction has 57657 states and 62051 transitions. [2018-07-24 12:31:29,571 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 12:31:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 57657 states and 62051 transitions. [2018-07-24 12:31:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-07-24 12:31:29,706 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:29,707 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:31:29,708 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:29,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1840269892, now seen corresponding path program 1 times [2018-07-24 12:31:29,708 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:29,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:29,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:29,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:29,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:30,645 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 12:31:30,944 WARN L169 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 12:31:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2075 backedges. 440 proven. 1076 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-07-24 12:31:33,100 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:33,100 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:31:33,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:33,110 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:33,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2075 backedges. 591 proven. 0 refuted. 0 times theorem prover too weak. 1484 trivial. 0 not checked. [2018-07-24 12:31:34,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2075 backedges. 77 proven. 556 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2018-07-24 12:31:36,553 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 12:31:36,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [20, 5] total 25 [2018-07-24 12:31:36,554 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:36,555 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:31:36,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:31:36,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-07-24 12:31:36,556 INFO L87 Difference]: Start difference. First operand 57657 states and 62051 transitions. Second operand 5 states. [2018-07-24 12:31:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:42,097 INFO L93 Difference]: Finished difference Result 119540 states and 128571 transitions. [2018-07-24 12:31:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 12:31:42,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1363 [2018-07-24 12:31:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:42,235 INFO L225 Difference]: With dead ends: 119540 [2018-07-24 12:31:42,235 INFO L226 Difference]: Without dead ends: 64734 [2018-07-24 12:31:42,555 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2750 GetRequests, 2723 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-07-24 12:31:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64734 states. [2018-07-24 12:31:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64734 to 62588. [2018-07-24 12:31:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62588 states. [2018-07-24 12:31:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62588 states to 62588 states and 67181 transitions. [2018-07-24 12:31:43,410 INFO L78 Accepts]: Start accepts. Automaton has 62588 states and 67181 transitions. Word has length 1363 [2018-07-24 12:31:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:31:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 62588 states and 67181 transitions. [2018-07-24 12:31:43,411 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:31:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 62588 states and 67181 transitions. [2018-07-24 12:31:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1372 [2018-07-24 12:31:43,547 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:31:43,548 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:31:43,549 INFO L414 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:31:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1516862250, now seen corresponding path program 1 times [2018-07-24 12:31:43,550 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:31:43,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:43,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:43,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:31:43,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:31:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1498 backedges. 819 proven. 2 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2018-07-24 12:31:48,700 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:31:48,700 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-24 12:31:48,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:31:48,707 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:31:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:31:49,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:31:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1498 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2018-07-24 12:31:50,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:31:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1498 backedges. 55 proven. 738 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-07-24 12:31:52,566 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 12:31:52,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [18, 6] total 23 [2018-07-24 12:31:52,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:31:52,569 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:31:52,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:31:52,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-07-24 12:31:52,569 INFO L87 Difference]: Start difference. First operand 62588 states and 67181 transitions. Second operand 5 states. [2018-07-24 12:31:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:31:59,050 INFO L93 Difference]: Finished difference Result 150599 states and 162611 transitions. [2018-07-24 12:31:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 12:31:59,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1371 [2018-07-24 12:31:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:31:59,187 INFO L225 Difference]: With dead ends: 150599 [2018-07-24 12:31:59,188 INFO L226 Difference]: Without dead ends: 88060 [2018-07-24 12:31:59,252 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2762 GetRequests, 2734 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-07-24 12:31:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88060 states. [2018-07-24 12:32:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88060 to 82341. [2018-07-24 12:32:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82341 states. [2018-07-24 12:32:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82341 states to 82341 states and 88371 transitions. [2018-07-24 12:32:00,400 INFO L78 Accepts]: Start accepts. Automaton has 82341 states and 88371 transitions. Word has length 1371 [2018-07-24 12:32:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:32:00,401 INFO L471 AbstractCegarLoop]: Abstraction has 82341 states and 88371 transitions. [2018-07-24 12:32:00,401 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:32:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 82341 states and 88371 transitions. [2018-07-24 12:32:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1900 [2018-07-24 12:32:00,524 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:32:00,525 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 12:32:00,525 INFO L414 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:32:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash -487853556, now seen corresponding path program 1 times [2018-07-24 12:32:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:32:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:32:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:32:00,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:32:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:01,819 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 12:32:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1359 proven. 2 refuted. 0 times theorem prover too weak. 1434 trivial. 0 not checked. [2018-07-24 12:32:07,639 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:32:07,639 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-24 12:32:07,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:07,647 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:32:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:08,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:32:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1362 proven. 2 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-07-24 12:32:10,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:32:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1362 proven. 2 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-07-24 12:32:12,989 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:32:12,989 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 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-07-24 12:32:13,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:32:13,004 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:32:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:32:14,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:32:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1362 proven. 2 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-07-24 12:32:16,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:32:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1362 proven. 2 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-07-24 12:32:21,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:32:21,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5, 6, 5, 5] total 28 [2018-07-24 12:32:21,810 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:32:21,812 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-24 12:32:21,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-24 12:32:21,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-07-24 12:32:21,813 INFO L87 Difference]: Start difference. First operand 82341 states and 88371 transitions. Second operand 21 states. [2018-07-24 12:33:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:33:01,082 INFO L93 Difference]: Finished difference Result 182932 states and 196540 transitions. [2018-07-24 12:33:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-24 12:33:01,083 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1899 [2018-07-24 12:33:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:33:01,255 INFO L225 Difference]: With dead ends: 182932 [2018-07-24 12:33:01,255 INFO L226 Difference]: Without dead ends: 96395 [2018-07-24 12:33:01,316 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7756 GetRequests, 7642 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1781, Invalid=10651, Unknown=0, NotChecked=0, Total=12432 [2018-07-24 12:33:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96395 states. [2018-07-24 12:33:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96395 to 94897. [2018-07-24 12:33:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94897 states. [2018-07-24 12:33:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94897 states to 94897 states and 101615 transitions. [2018-07-24 12:33:02,363 INFO L78 Accepts]: Start accepts. Automaton has 94897 states and 101615 transitions. Word has length 1899 [2018-07-24 12:33:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:33:02,365 INFO L471 AbstractCegarLoop]: Abstraction has 94897 states and 101615 transitions. [2018-07-24 12:33:02,365 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-24 12:33:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 94897 states and 101615 transitions. [2018-07-24 12:33:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2072 [2018-07-24 12:33:02,501 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:33:02,502 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:33:02,503 INFO L414 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:33:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -575460269, now seen corresponding path program 1 times [2018-07-24 12:33:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:33:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:33:02,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:33:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:33:02,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:33:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:33:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 98 proven. 2130 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2018-07-24 12:33:06,666 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:33:06,666 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-24 12:33:06,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:33:06,675 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:33:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:33:07,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:33:09,444 WARN L1032 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_11 Int)) (let ((.cse1 (* 9 v_prenex_11))) (let ((.cse0 (div .cse1 10))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse0 95) 212)) (<= 0 .cse1) (<= 0 (+ .cse0 1)) (<= 0 .cse0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_11))))) (exists ((v_prenex_20 Int)) (let ((.cse3 (* 9 v_prenex_20))) (let ((.cse5 (div .cse3 10))) (let ((.cse2 (mod .cse5 95)) (.cse4 (+ .cse5 1))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse2 117)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_20) (<= 0 .cse3) (not (= .cse2 0)) (not (= (mod .cse4 95) 0)) (< .cse4 0) (< .cse5 0)))))) (exists ((v_prenex_12 Int)) (let ((.cse8 (* 9 v_prenex_12))) (let ((.cse7 (div .cse8 10))) (let ((.cse6 (mod .cse7 95))) (and (not (= .cse6 0)) (= (mod (+ .cse7 1) 95) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse6 117)) (< .cse7 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_12) (<= 0 .cse8)))))) (exists ((v_prenex_18 Int)) (let ((.cse10 (* 9 v_prenex_18))) (let ((.cse11 (div .cse10 10))) (let ((.cse9 (mod .cse11 95))) (and (= .cse9 0) (<= 0 .cse10) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse9 212)) (= (mod (+ .cse11 1) 95) 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_18)))))) (exists ((v_prenex_26 Int)) (let ((.cse14 (* 9 v_prenex_26))) (let ((.cse12 (div .cse14 10))) (let ((.cse13 (mod .cse12 95))) (and (= (mod (+ .cse12 1) 95) 0) (= .cse13 0) (= (mod .cse14 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse13 212)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_26)))))) (exists ((v_prenex_15 Int)) (let ((.cse17 (* 9 v_prenex_15))) (let ((.cse16 (div .cse17 10))) (let ((.cse15 (mod .cse16 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_15) (= .cse15 0) (<= 0 (+ .cse16 1)) (<= 0 .cse17) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse15 212))))))) (exists ((v_prenex_19 Int)) (let ((.cse19 (* 9 v_prenex_19))) (let ((.cse20 (div .cse19 10))) (let ((.cse18 (+ .cse20 1))) (and (<= 0 .cse18) (< .cse19 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse18 95) 212)) (not (= (mod .cse19 10) 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_19) (= (mod .cse20 95) 0)))))) (exists ((v_prenex_22 Int)) (let ((.cse23 (* 9 v_prenex_22))) (let ((.cse22 (div .cse23 10))) (let ((.cse21 (mod .cse22 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse21 212)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_22) (<= 0 (+ .cse22 1)) (= .cse21 0) (= (mod .cse23 10) 0)))))) (exists ((v_prenex_13 Int)) (let ((.cse27 (* 9 v_prenex_13))) (let ((.cse24 (div .cse27 10))) (let ((.cse26 (+ .cse24 1))) (let ((.cse25 (mod .cse26 95))) (and (= (mod .cse24 95) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse25 117)) (< .cse26 0) (< .cse27 0) (not (= (mod .cse27 10) 0)) (not (= .cse25 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_13))))))) (exists ((v_prenex_7 Int)) (let ((.cse29 (* 9 v_prenex_7))) (let ((.cse30 (div .cse29 10))) (let ((.cse28 (mod (+ .cse30 1) 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse28 212)) (< .cse29 0) (not (= (mod .cse29 10) 0)) (= .cse28 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_7) (<= 0 .cse30)))))) (exists ((v_prenex_1 Int)) (let ((.cse33 (* 9 v_prenex_1))) (let ((.cse34 (div .cse33 10))) (let ((.cse31 (mod .cse34 95)) (.cse32 (+ .cse34 1))) (and (= .cse31 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse31 212)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_1) (not (= (mod .cse32 95) 0)) (< .cse32 0) (= (mod .cse33 10) 0)))))) (exists ((v_prenex_21 Int)) (let ((.cse37 (* 9 v_prenex_21))) (let ((.cse38 (div .cse37 10))) (let ((.cse36 (+ .cse38 1))) (let ((.cse35 (mod .cse36 95))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse35 117)) (< .cse36 0) (not (= (mod .cse37 10) 0)) (<= 0 .cse38) (not (= .cse35 0)) (< .cse37 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_21))))))) (exists ((v_prenex_23 Int)) (let ((.cse41 (* 9 v_prenex_23))) (let ((.cse39 (div .cse41 10))) (let ((.cse40 (+ .cse39 1))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_23) (<= 0 .cse39) (not (= (mod .cse40 95) 0)) (<= 0 .cse41) (< .cse40 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse39 95) 212))))))) (exists ((v_prenex_8 Int)) (let ((.cse45 (* 9 v_prenex_8))) (let ((.cse43 (div .cse45 10))) (let ((.cse42 (mod .cse43 95)) (.cse44 (+ .cse43 1))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse42 117)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_8) (< .cse43 0) (< .cse44 0) (not (= .cse42 0)) (not (= (mod .cse44 95) 0)) (= (mod .cse45 10) 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse48 (* 9 v_prenex_2))) (let ((.cse49 (div .cse48 10))) (let ((.cse47 (mod .cse49 95)) (.cse46 (+ .cse49 1))) (and (< .cse46 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_2) (= .cse47 0) (<= 0 .cse48) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse47 212)) (not (= (mod .cse46 95) 0))))))) (exists ((v_prenex_10 Int)) (let ((.cse50 (* 9 v_prenex_10))) (let ((.cse51 (div .cse50 10))) (let ((.cse52 (mod (+ .cse51 1) 95))) (and (< .cse50 0) (= (mod .cse51 95) 0) (= .cse52 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_10) (not (= (mod .cse50 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse52 212))))))) (exists ((v_prenex_9 Int)) (let ((.cse54 (* 9 v_prenex_9))) (let ((.cse55 (div .cse54 10))) (let ((.cse53 (+ .cse55 1))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse53 95) 212)) (< .cse54 0) (not (= (mod .cse54 10) 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_9) (<= 0 .cse55) (<= 0 .cse53)))))) (exists ((v_prenex_3 Int)) (let ((.cse56 (* 9 v_prenex_3))) (let ((.cse57 (div .cse56 10))) (let ((.cse58 (+ .cse57 1))) (and (< .cse56 0) (not (= (mod .cse56 10) 0)) (< .cse57 0) (not (= (mod .cse57 95) 0)) (<= 0 .cse58) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_3) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse58 95) 212))))))) (exists ((v_prenex_16 Int)) (let ((.cse60 (* 9 v_prenex_16))) (let ((.cse59 (div .cse60 10))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse59 95) 212)) (<= 0 .cse59) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_16) (<= 0 .cse60) (= (mod (+ .cse59 1) 95) 0))))) (exists ((v_prenex_5 Int)) (let ((.cse63 (* 9 v_prenex_5))) (let ((.cse61 (div .cse63 10))) (let ((.cse62 (mod .cse61 95))) (and (< .cse61 0) (<= 0 (+ .cse61 1)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_5) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse62 117)) (= (mod .cse63 10) 0) (not (= .cse62 0))))))) (exists ((v_prenex_24 Int)) (let ((.cse66 (* 9 v_prenex_24))) (let ((.cse64 (div .cse66 10))) (let ((.cse65 (mod .cse64 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_24) (<= 0 (+ .cse64 1)) (< .cse64 0) (not (= .cse65 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse65 117)) (<= 0 .cse66)))))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2213 Int)) (let ((.cse69 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2213))) (let ((.cse67 (div .cse69 10))) (let ((.cse68 (+ .cse67 1))) (let ((.cse70 (mod .cse68 95))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0_2213) (not (= (mod .cse67 95) 0)) (< .cse68 0) (not (= (mod .cse69 10) 0)) (< .cse69 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse70 117)) (not (= .cse70 0)) (< .cse67 0))))))) (exists ((v_prenex_6 Int)) (let ((.cse72 (* 9 v_prenex_6))) (let ((.cse71 (div .cse72 10))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_6) (<= 0 .cse71) (<= 0 (+ .cse71 1)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse71 95) 212)) (= (mod .cse72 10) 0))))) (exists ((v_prenex_14 Int)) (let ((.cse74 (* 9 v_prenex_14))) (let ((.cse73 (div .cse74 10))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_14) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse73 95) 212)) (= (mod .cse74 10) 0) (= (mod (+ .cse73 1) 95) 0) (<= 0 .cse73))))) (exists ((v_prenex_4 Int)) (let ((.cse76 (* 9 v_prenex_4))) (let ((.cse75 (div .cse76 10))) (let ((.cse77 (mod (+ .cse75 1) 95))) (and (< .cse75 0) (< .cse76 0) (not (= (mod .cse76 10) 0)) (not (= (mod .cse75 95) 0)) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_4) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse77 212)) (= .cse77 0)))))) (exists ((v_prenex_17 Int)) (let ((.cse79 (* 9 v_prenex_17))) (let ((.cse78 (div .cse79 10))) (let ((.cse80 (+ .cse78 1))) (and (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_17) (<= 0 .cse78) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ (mod .cse78 95) 212)) (= (mod .cse79 10) 0) (< .cse80 0) (not (= (mod .cse80 95) 0))))))) (exists ((v_prenex_25 Int)) (let ((.cse81 (* 9 v_prenex_25))) (let ((.cse83 (div .cse81 10))) (let ((.cse82 (mod .cse83 95))) (and (= (mod .cse81 10) 0) (not (= .cse82 0)) (= (mod (+ .cse83 1) 95) 0) (<= |c_old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0)| v_prenex_25) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a3~0 (+ .cse82 117)) (< .cse83 0))))))) is different from true [2018-07-24 12:33:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 2033 proven. 179 refuted. 0 times theorem prover too weak. 941 trivial. 7 not checked. [2018-07-24 12:33:14,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:33:14,574 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-07-24 12:33:15,524 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 12:33:15,647 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 12:33:15,760 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 Received shutdown request... [2018-07-24 12:33:16,015 WARN L177 SmtUtils]: Removed 2 from assertion stack [2018-07-24 12:33:16,016 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-07-24 12:33:16,218 WARN L512 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:33:16,218 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 12:33:16,223 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 12:33:16,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 12:33:16 BoogieIcfgContainer [2018-07-24 12:33:16,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 12:33:16,225 INFO L168 Benchmark]: Toolchain (without parser) took 231972.64 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 587.4 MB. Max. memory is 7.1 GB. [2018-07-24 12:33:16,226 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 12:33:16,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1830.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 182.3 MB). Peak memory consumption was 182.3 MB. Max. memory is 7.1 GB. [2018-07-24 12:33:16,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-24 12:33:16,235 INFO L168 Benchmark]: Boogie Preprocessor took 608.23 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 876.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. [2018-07-24 12:33:16,242 INFO L168 Benchmark]: RCFGBuilder took 8283.09 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 544.8 MB). Peak memory consumption was 544.8 MB. Max. memory is 7.1 GB. [2018-07-24 12:33:16,243 INFO L168 Benchmark]: TraceAbstraction took 221090.27 ms. Allocated memory was 2.4 GB in the beginning and 3.9 GB in the end (delta: 1.5 GB). Free memory was 1.8 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2018-07-24 12:33:16,254 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.52 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 1830.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 182.3 MB). Peak memory consumption was 182.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 155.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 608.23 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 876.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8283.09 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 544.8 MB). Peak memory consumption was 544.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221090.27 ms. Allocated memory was 2.4 GB in the beginning and 3.9 GB in the end (delta: 1.5 GB). Free memory was 1.8 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 2072 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 6. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 775 locations, 1 error locations. TIMEOUT Result, 220.9s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 147.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2318 SDtfs, 49283 SDslu, 3434 SDs, 0 SdLazy, 105077 SolverSat, 15932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20035 GetRequests, 19699 SyntacticMatches, 37 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5092 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94897occurred in iteration=13, 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: 7.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 29026 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 34.2s InterpolantComputationTime, 17154 NumberOfCodeBlocks, 17154 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 26937 ConstructedInterpolants, 0 QuantifiedInterpolants, 127643955 SizeOfPredicates, 9 NumberOfNonLiveVariables, 13724 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 41 InterpolantComputations, 9 PerfectInterpolantSequences, 29401/32683 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/Problem18_label03_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_12-33-16-275.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem18_label03_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_12-33-16-275.csv Completed graceful shutdown