java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 10:01:18,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 10:01:18,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 10:01:18,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 10:01:18,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 10:01:18,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 10:01:18,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 10:01:18,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 10:01:18,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 10:01:18,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 10:01:18,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 10:01:18,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 10:01:18,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 10:01:18,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 10:01:18,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 10:01:18,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 10:01:18,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 10:01:18,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 10:01:18,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 10:01:18,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 10:01:18,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 10:01:18,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 10:01:18,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 10:01:18,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 10:01:18,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 10:01:18,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 10:01:18,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 10:01:18,292 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 10:01:18,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 10:01:18,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 10:01:18,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 10:01:18,295 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 10:01:18,295 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 10:01:18,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 10:01:18,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 10:01:18,297 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 10:01:18,298 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-18 10:01:18,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 10:01:18,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 10:01:18,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 10:01:18,330 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 10:01:18,330 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 10:01:18,330 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 10:01:18,331 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 10:01:18,331 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 10:01:18,331 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 10:01:18,331 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 10:01:18,331 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 10:01:18,332 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 10:01:18,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 10:01:18,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 10:01:18,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 10:01:18,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 10:01:18,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 10:01:18,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 10:01:18,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 10:01:18,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 10:01:18,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 10:01:18,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 10:01:18,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 10:01:18,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 10:01:18,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 10:01:18,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 10:01:18,335 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 10:01:18,336 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 10:01:18,336 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 10:01:18,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 10:01:18,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 10:01:18,337 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 10:01:18,337 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 10:01:18,337 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 10:01:18,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 10:01:18,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 10:01:18,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 10:01:18,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 10:01:18,424 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 10:01:18,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-09-18 10:01:18,787 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3930ddc/c1f15b922f704406abb5b7cc7ed33f47/FLAG6b71f27bd [2018-09-18 10:01:18,940 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 10:01:18,941 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-09-18 10:01:18,948 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3930ddc/c1f15b922f704406abb5b7cc7ed33f47/FLAG6b71f27bd [2018-09-18 10:01:18,962 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3930ddc/c1f15b922f704406abb5b7cc7ed33f47 [2018-09-18 10:01:18,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 10:01:18,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 10:01:18,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 10:01:18,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 10:01:18,982 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 10:01:18,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:01:18" (1/1) ... [2018-09-18 10:01:18,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39046898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:18, skipping insertion in model container [2018-09-18 10:01:18,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:01:18" (1/1) ... [2018-09-18 10:01:18,998 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 10:01:19,180 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:01:19,199 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 10:01:19,216 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:01:19,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19 WrapperNode [2018-09-18 10:01:19,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 10:01:19,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 10:01:19,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 10:01:19,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 10:01:19,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 10:01:19,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 10:01:19,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 10:01:19,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 10:01:19,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... [2018-09-18 10:01:19,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 10:01:19,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 10:01:19,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 10:01:19,298 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 10:01:19,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 10:01:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 10:01:19,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 10:01:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 10:01:19,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 10:01:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 10:01:19,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 10:01:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-18 10:01:19,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-18 10:01:19,860 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 10:01:19,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:01:19 BoogieIcfgContainer [2018-09-18 10:01:19,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 10:01:19,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 10:01:19,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 10:01:19,865 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 10:01:19,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 10:01:18" (1/3) ... [2018-09-18 10:01:19,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5e9667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:01:19, skipping insertion in model container [2018-09-18 10:01:19,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:01:19" (2/3) ... [2018-09-18 10:01:19,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5e9667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:01:19, skipping insertion in model container [2018-09-18 10:01:19,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:01:19" (3/3) ... [2018-09-18 10:01:19,869 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-09-18 10:01:19,879 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 10:01:19,892 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 10:01:19,939 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 10:01:19,940 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 10:01:19,940 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 10:01:19,940 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 10:01:19,940 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 10:01:19,941 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 10:01:19,941 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 10:01:19,941 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 10:01:19,941 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 10:01:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-09-18 10:01:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-18 10:01:19,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:19,971 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:19,972 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-09-18 10:01:19,981 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:20,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:20,035 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:20,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:01:20,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-18 10:01:20,119 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:20,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-18 10:01:20,140 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-18 10:01:20,141 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-18 10:01:20,144 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-09-18 10:01:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:20,175 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-18 10:01:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-18 10:01:20,177 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-09-18 10:01:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:20,189 INFO L225 Difference]: With dead ends: 83 [2018-09-18 10:01:20,189 INFO L226 Difference]: Without dead ends: 40 [2018-09-18 10:01:20,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-18 10:01:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-18 10:01:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-18 10:01:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-18 10:01:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-09-18 10:01:20,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-09-18 10:01:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:20,247 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-09-18 10:01:20,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-18 10:01:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-09-18 10:01:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-18 10:01:20,248 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:20,248 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:20,249 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-09-18 10:01:20,249 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:20,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:20,251 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:20,642 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:01:20,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:01:20,642 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:20,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:01:20,644 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:01:20,645 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:01:20,645 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-09-18 10:01:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:21,358 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-09-18 10:01:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:01:21,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-09-18 10:01:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:21,362 INFO L225 Difference]: With dead ends: 77 [2018-09-18 10:01:21,362 INFO L226 Difference]: Without dead ends: 75 [2018-09-18 10:01:21,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-18 10:01:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-18 10:01:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-09-18 10:01:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-18 10:01:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-09-18 10:01:21,411 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-09-18 10:01:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:21,412 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-09-18 10:01:21,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:01:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-09-18 10:01:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-18 10:01:21,413 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:21,413 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:21,414 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-09-18 10:01:21,414 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:21,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:21,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:21,416 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:21,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:01:21,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:01:21,503 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:21,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:01:21,504 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:01:21,504 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:01:21,505 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-09-18 10:01:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:22,143 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-09-18 10:01:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:01:22,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-09-18 10:01:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:22,149 INFO L225 Difference]: With dead ends: 121 [2018-09-18 10:01:22,150 INFO L226 Difference]: Without dead ends: 119 [2018-09-18 10:01:22,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-18 10:01:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-18 10:01:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-09-18 10:01:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-18 10:01:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-09-18 10:01:22,176 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-09-18 10:01:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:22,176 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-09-18 10:01:22,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:01:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-09-18 10:01:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-18 10:01:22,178 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:22,178 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:22,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-09-18 10:01:22,179 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:22,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:22,181 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:22,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:22,322 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:22,338 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:22,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:22,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:23,082 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:23,082 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 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 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:01:23,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:23,102 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:23,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:23,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:23,468 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-09-18 10:01:23,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7, 9, 9] total 20 [2018-09-18 10:01:23,468 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:23,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 10:01:23,469 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 10:01:23,472 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-09-18 10:01:23,472 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 7 states. [2018-09-18 10:01:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:24,222 INFO L93 Difference]: Finished difference Result 289 states and 471 transitions. [2018-09-18 10:01:24,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 10:01:24,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-09-18 10:01:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:24,228 INFO L225 Difference]: With dead ends: 289 [2018-09-18 10:01:24,228 INFO L226 Difference]: Without dead ends: 287 [2018-09-18 10:01:24,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-09-18 10:01:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-18 10:01:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 233. [2018-09-18 10:01:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-18 10:01:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 385 transitions. [2018-09-18 10:01:24,282 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 385 transitions. Word has length 21 [2018-09-18 10:01:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:24,283 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 385 transitions. [2018-09-18 10:01:24,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 10:01:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 385 transitions. [2018-09-18 10:01:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-18 10:01:24,285 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:24,285 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:24,285 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1032051649, now seen corresponding path program 1 times [2018-09-18 10:01:24,286 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:24,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:24,287 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:24,518 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:24,518 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:24,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:24,527 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:24,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 10:01:24,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:24,882 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:01:24,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 15 [2018-09-18 10:01:24,882 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:01:24,883 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:01:24,883 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-09-18 10:01:24,883 INFO L87 Difference]: Start difference. First operand 233 states and 385 transitions. Second operand 5 states. [2018-09-18 10:01:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:25,446 INFO L93 Difference]: Finished difference Result 446 states and 733 transitions. [2018-09-18 10:01:25,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-18 10:01:25,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-09-18 10:01:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:25,454 INFO L225 Difference]: With dead ends: 446 [2018-09-18 10:01:25,454 INFO L226 Difference]: Without dead ends: 274 [2018-09-18 10:01:25,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-09-18 10:01:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-18 10:01:25,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 237. [2018-09-18 10:01:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-18 10:01:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 389 transitions. [2018-09-18 10:01:25,560 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 389 transitions. Word has length 21 [2018-09-18 10:01:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:25,561 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 389 transitions. [2018-09-18 10:01:25,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:01:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 389 transitions. [2018-09-18 10:01:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-18 10:01:25,562 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:25,564 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:25,564 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1772370613, now seen corresponding path program 1 times [2018-09-18 10:01:25,564 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:25,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:25,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:25,566 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:25,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:25,745 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:25,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:25,758 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:25,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:25,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:25,982 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:01:25,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 12 [2018-09-18 10:01:25,982 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:25,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 10:01:25,983 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 10:01:25,983 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-18 10:01:25,983 INFO L87 Difference]: Start difference. First operand 237 states and 389 transitions. Second operand 7 states. [2018-09-18 10:01:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:27,017 INFO L93 Difference]: Finished difference Result 333 states and 541 transitions. [2018-09-18 10:01:27,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 10:01:27,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-09-18 10:01:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:27,037 INFO L225 Difference]: With dead ends: 333 [2018-09-18 10:01:27,038 INFO L226 Difference]: Without dead ends: 331 [2018-09-18 10:01:27,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-09-18 10:01:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-18 10:01:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 293. [2018-09-18 10:01:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-18 10:01:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 485 transitions. [2018-09-18 10:01:27,098 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 485 transitions. Word has length 21 [2018-09-18 10:01:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:27,098 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 485 transitions. [2018-09-18 10:01:27,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 10:01:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 485 transitions. [2018-09-18 10:01:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-18 10:01:27,100 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:27,100 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:27,100 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1983051969, now seen corresponding path program 1 times [2018-09-18 10:01:27,101 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:27,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:27,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:27,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:27,102 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:01:27,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:01:27,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 10:01:27,170 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:27,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:01:27,171 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:01:27,171 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:01:27,171 INFO L87 Difference]: Start difference. First operand 293 states and 485 transitions. Second operand 3 states. [2018-09-18 10:01:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:27,321 INFO L93 Difference]: Finished difference Result 369 states and 602 transitions. [2018-09-18 10:01:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:01:27,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-09-18 10:01:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:27,325 INFO L225 Difference]: With dead ends: 369 [2018-09-18 10:01:27,325 INFO L226 Difference]: Without dead ends: 290 [2018-09-18 10:01:27,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:01:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-18 10:01:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-09-18 10:01:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-09-18 10:01:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 478 transitions. [2018-09-18 10:01:27,377 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 478 transitions. Word has length 21 [2018-09-18 10:01:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:27,378 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 478 transitions. [2018-09-18 10:01:27,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:01:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 478 transitions. [2018-09-18 10:01:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-18 10:01:27,380 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:27,380 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:27,380 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-09-18 10:01:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:27,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:27,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:27,382 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-18 10:01:27,888 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:27,889 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:27,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:27,906 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:27,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-18 10:01:28,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-18 10:01:28,192 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:01:28,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-09-18 10:01:28,192 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:28,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:01:28,193 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:01:28,193 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-18 10:01:28,193 INFO L87 Difference]: Start difference. First operand 290 states and 478 transitions. Second operand 6 states. [2018-09-18 10:01:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:28,562 INFO L93 Difference]: Finished difference Result 382 states and 630 transitions. [2018-09-18 10:01:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:01:28,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-09-18 10:01:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:28,566 INFO L225 Difference]: With dead ends: 382 [2018-09-18 10:01:28,566 INFO L226 Difference]: Without dead ends: 380 [2018-09-18 10:01:28,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-18 10:01:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-18 10:01:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 344. [2018-09-18 10:01:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-09-18 10:01:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 567 transitions. [2018-09-18 10:01:28,631 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 567 transitions. Word has length 28 [2018-09-18 10:01:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:28,632 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 567 transitions. [2018-09-18 10:01:28,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:01:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 567 transitions. [2018-09-18 10:01:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-18 10:01:28,633 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:28,634 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:28,634 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-09-18 10:01:28,639 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:28,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:28,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:28,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:28,640 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-18 10:01:29,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:29,114 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:29,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:29,123 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:29,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-18 10:01:29,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-18 10:01:29,763 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:29,763 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 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-09-18 10:01:29,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:29,779 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:29,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-18 10:01:29,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-18 10:01:29,991 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-09-18 10:01:29,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8, 10, 9] total 22 [2018-09-18 10:01:29,991 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:29,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 10:01:29,992 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 10:01:29,993 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-09-18 10:01:29,993 INFO L87 Difference]: Start difference. First operand 344 states and 567 transitions. Second operand 7 states. [2018-09-18 10:01:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:31,246 INFO L93 Difference]: Finished difference Result 553 states and 921 transitions. [2018-09-18 10:01:31,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:01:31,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-09-18 10:01:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:31,253 INFO L225 Difference]: With dead ends: 553 [2018-09-18 10:01:31,253 INFO L226 Difference]: Without dead ends: 551 [2018-09-18 10:01:31,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-09-18 10:01:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-09-18 10:01:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 496. [2018-09-18 10:01:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-09-18 10:01:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 828 transitions. [2018-09-18 10:01:31,324 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 828 transitions. Word has length 33 [2018-09-18 10:01:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:31,324 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 828 transitions. [2018-09-18 10:01:31,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 10:01:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 828 transitions. [2018-09-18 10:01:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-18 10:01:31,326 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:31,326 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:31,326 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-09-18 10:01:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:31,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:31,328 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-18 10:01:31,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:31,450 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:31,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:31,461 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:31,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-18 10:01:31,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-18 10:01:31,864 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:01:31,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-09-18 10:01:31,864 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:31,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-18 10:01:31,864 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-18 10:01:31,865 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-09-18 10:01:31,865 INFO L87 Difference]: Start difference. First operand 496 states and 828 transitions. Second operand 8 states. [2018-09-18 10:01:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:32,316 INFO L93 Difference]: Finished difference Result 530 states and 865 transitions. [2018-09-18 10:01:32,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 10:01:32,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-09-18 10:01:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:32,326 INFO L225 Difference]: With dead ends: 530 [2018-09-18 10:01:32,327 INFO L226 Difference]: Without dead ends: 528 [2018-09-18 10:01:32,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-09-18 10:01:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-09-18 10:01:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 508. [2018-09-18 10:01:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-18 10:01:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 837 transitions. [2018-09-18 10:01:32,411 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 837 transitions. Word has length 33 [2018-09-18 10:01:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:32,412 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 837 transitions. [2018-09-18 10:01:32,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-18 10:01:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 837 transitions. [2018-09-18 10:01:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-18 10:01:32,413 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:32,413 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:32,414 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:32,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-09-18 10:01:32,414 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:32,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:32,415 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-18 10:01:32,664 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:32,665 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-18 10:01:32,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:32,678 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:32,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-18 10:01:32,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-18 10:01:32,801 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:01:32,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-09-18 10:01:32,801 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:32,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 10:01:32,802 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 10:01:32,802 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-18 10:01:32,802 INFO L87 Difference]: Start difference. First operand 508 states and 837 transitions. Second operand 7 states. [2018-09-18 10:01:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:33,816 INFO L93 Difference]: Finished difference Result 606 states and 983 transitions. [2018-09-18 10:01:33,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:01:33,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-09-18 10:01:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:33,822 INFO L225 Difference]: With dead ends: 606 [2018-09-18 10:01:33,822 INFO L226 Difference]: Without dead ends: 604 [2018-09-18 10:01:33,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-18 10:01:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-09-18 10:01:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 512. [2018-09-18 10:01:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-09-18 10:01:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 840 transitions. [2018-09-18 10:01:33,917 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 840 transitions. Word has length 43 [2018-09-18 10:01:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:33,918 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 840 transitions. [2018-09-18 10:01:33,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 10:01:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 840 transitions. [2018-09-18 10:01:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-18 10:01:33,919 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:33,919 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:33,920 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1269153316, now seen corresponding path program 1 times [2018-09-18 10:01:33,920 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:33,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:33,921 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-18 10:01:34,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:34,383 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:34,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:34,401 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:34,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-18 10:01:34,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-18 10:01:34,531 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:01:34,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-09-18 10:01:34,532 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:34,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 10:01:34,532 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 10:01:34,533 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-18 10:01:34,533 INFO L87 Difference]: Start difference. First operand 512 states and 840 transitions. Second operand 7 states. [2018-09-18 10:01:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:34,849 INFO L93 Difference]: Finished difference Result 524 states and 850 transitions. [2018-09-18 10:01:34,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:01:34,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-09-18 10:01:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:34,854 INFO L225 Difference]: With dead ends: 524 [2018-09-18 10:01:34,854 INFO L226 Difference]: Without dead ends: 522 [2018-09-18 10:01:34,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-09-18 10:01:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-09-18 10:01:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2018-09-18 10:01:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-18 10:01:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 846 transitions. [2018-09-18 10:01:34,940 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 846 transitions. Word has length 45 [2018-09-18 10:01:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:34,940 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 846 transitions. [2018-09-18 10:01:34,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 10:01:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 846 transitions. [2018-09-18 10:01:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-18 10:01:34,942 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:34,942 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2018-09-18 10:01:34,943 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1324197870, now seen corresponding path program 1 times [2018-09-18 10:01:34,943 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:34,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:34,944 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-18 10:01:35,605 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:35,605 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-18 10:01:35,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:35,621 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:35,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-18 10:01:35,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-18 10:01:36,075 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:36,075 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:01:36,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:36,092 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:36,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-18 10:01:36,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-18 10:01:36,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:01:36,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 6] total 16 [2018-09-18 10:01:36,416 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:01:36,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-18 10:01:36,417 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-18 10:01:36,417 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-09-18 10:01:36,418 INFO L87 Difference]: Start difference. First operand 520 states and 846 transitions. Second operand 12 states. [2018-09-18 10:01:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:38,239 INFO L93 Difference]: Finished difference Result 794 states and 1258 transitions. [2018-09-18 10:01:38,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-18 10:01:38,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-09-18 10:01:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:38,248 INFO L225 Difference]: With dead ends: 794 [2018-09-18 10:01:38,248 INFO L226 Difference]: Without dead ends: 248 [2018-09-18 10:01:38,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-09-18 10:01:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-18 10:01:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 235. [2018-09-18 10:01:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-18 10:01:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 359 transitions. [2018-09-18 10:01:38,309 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 359 transitions. Word has length 57 [2018-09-18 10:01:38,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:38,309 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 359 transitions. [2018-09-18 10:01:38,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-18 10:01:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 359 transitions. [2018-09-18 10:01:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-18 10:01:38,311 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:38,313 INFO L376 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:01:38,313 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash -283854137, now seen corresponding path program 1 times [2018-09-18 10:01:38,314 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:38,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:38,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:38,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:38,315 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-09-18 10:01:38,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:38,447 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:38,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:38,456 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:38,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-18 10:01:38,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-09-18 10:01:38,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 10:01:38,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2018-09-18 10:01:38,698 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:38,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:01:38,699 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:01:38,699 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-18 10:01:38,699 INFO L87 Difference]: Start difference. First operand 235 states and 359 transitions. Second operand 6 states. [2018-09-18 10:01:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:38,915 INFO L93 Difference]: Finished difference Result 395 states and 589 transitions. [2018-09-18 10:01:38,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 10:01:38,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-09-18 10:01:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:38,917 INFO L225 Difference]: With dead ends: 395 [2018-09-18 10:01:38,917 INFO L226 Difference]: Without dead ends: 230 [2018-09-18 10:01:38,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-09-18 10:01:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-18 10:01:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2018-09-18 10:01:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-18 10:01:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 315 transitions. [2018-09-18 10:01:38,957 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 315 transitions. Word has length 69 [2018-09-18 10:01:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:38,957 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 315 transitions. [2018-09-18 10:01:38,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:01:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 315 transitions. [2018-09-18 10:01:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-18 10:01:38,959 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:38,959 INFO L376 BasicCegarLoop]: trace histogram [14, 13, 13, 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] [2018-09-18 10:01:38,960 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 1 times [2018-09-18 10:01:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:38,961 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-09-18 10:01:39,303 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:39,303 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:39,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:39,313 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:39,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-18 10:01:39,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-18 10:01:39,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:39,764 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:01:39,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:39,779 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:39,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-09-18 10:01:45,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-18 10:01:45,260 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-18 10:01:45,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 10, 10, 7] total 31 [2018-09-18 10:01:45,260 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:01:45,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 10:01:45,261 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 10:01:45,262 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=810, Unknown=3, NotChecked=0, Total=930 [2018-09-18 10:01:45,262 INFO L87 Difference]: Start difference. First operand 212 states and 315 transitions. Second operand 7 states. [2018-09-18 10:01:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:01:58,485 INFO L93 Difference]: Finished difference Result 392 states and 572 transitions. [2018-09-18 10:01:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 10:01:58,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-09-18 10:01:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:01:58,487 INFO L225 Difference]: With dead ends: 392 [2018-09-18 10:01:58,487 INFO L226 Difference]: Without dead ends: 220 [2018-09-18 10:01:58,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=128, Invalid=861, Unknown=3, NotChecked=0, Total=992 [2018-09-18 10:01:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-18 10:01:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 194. [2018-09-18 10:01:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-18 10:01:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-09-18 10:01:58,524 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 91 [2018-09-18 10:01:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:01:58,525 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-09-18 10:01:58,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 10:01:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-09-18 10:01:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-18 10:01:58,527 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:01:58,527 INFO L376 BasicCegarLoop]: trace histogram [14, 13, 13, 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] [2018-09-18 10:01:58,528 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:01:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1110106265, now seen corresponding path program 1 times [2018-09-18 10:01:58,528 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:01:58,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:58,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:58,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:01:58,530 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:01:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-09-18 10:01:58,976 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:58,976 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:01:58,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:58,985 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:59,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:01:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-18 10:01:59,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:01:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-18 10:01:59,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:01:59,364 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:01:59,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:01:59,379 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:01:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:01:59,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:02:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-09-18 10:02:02,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:02:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-18 10:02:02,354 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-18 10:02:02,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9, 9, 6] total 27 [2018-09-18 10:02:02,355 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:02:02,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:02:02,355 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:02:02,355 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=613, Unknown=1, NotChecked=0, Total=702 [2018-09-18 10:02:02,356 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 6 states. [2018-09-18 10:02:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:02:11,596 INFO L93 Difference]: Finished difference Result 342 states and 491 transitions. [2018-09-18 10:02:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 10:02:11,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-09-18 10:02:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:02:11,598 INFO L225 Difference]: With dead ends: 342 [2018-09-18 10:02:11,599 INFO L226 Difference]: Without dead ends: 199 [2018-09-18 10:02:11,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=108, Invalid=703, Unknown=1, NotChecked=0, Total=812 [2018-09-18 10:02:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-18 10:02:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 184. [2018-09-18 10:02:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-18 10:02:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 265 transitions. [2018-09-18 10:02:11,636 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 265 transitions. Word has length 91 [2018-09-18 10:02:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:02:11,637 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 265 transitions. [2018-09-18 10:02:11,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:02:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 265 transitions. [2018-09-18 10:02:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-18 10:02:11,639 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:02:11,639 INFO L376 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 10:02:11,639 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:02:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 391410060, now seen corresponding path program 1 times [2018-09-18 10:02:11,640 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:02:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:02:11,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:02:11,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:02:11,641 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:02:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:02:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-18 10:02:12,109 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:02:12,109 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:02:12,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:02:12,117 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:02:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:02:12,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:02:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 212 proven. 9 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-09-18 10:02:13,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:02:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-18 10:02:16,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:02:16,566 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:02:16,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:02:16,582 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:02:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:02:16,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:02:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 212 proven. 9 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-09-18 10:02:16,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:02:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-18 10:02:18,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:02:18,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 21 [2018-09-18 10:02:18,593 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:02:18,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-18 10:02:18,594 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-18 10:02:18,594 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=338, Unknown=3, NotChecked=0, Total=420 [2018-09-18 10:02:18,594 INFO L87 Difference]: Start difference. First operand 184 states and 265 transitions. Second operand 14 states. [2018-09-18 10:02:19,430 WARN L178 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-18 10:02:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:02:28,006 INFO L93 Difference]: Finished difference Result 430 states and 634 transitions. [2018-09-18 10:02:28,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-18 10:02:28,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-09-18 10:02:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:02:28,009 INFO L225 Difference]: With dead ends: 430 [2018-09-18 10:02:28,009 INFO L226 Difference]: Without dead ends: 303 [2018-09-18 10:02:28,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 467 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=271, Invalid=913, Unknown=6, NotChecked=0, Total=1190 [2018-09-18 10:02:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-18 10:02:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 248. [2018-09-18 10:02:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-18 10:02:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 374 transitions. [2018-09-18 10:02:28,066 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 374 transitions. Word has length 120 [2018-09-18 10:02:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:02:28,067 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 374 transitions. [2018-09-18 10:02:28,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-18 10:02:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 374 transitions. [2018-09-18 10:02:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-18 10:02:28,069 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:02:28,069 INFO L376 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 10:02:28,069 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:02:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash 825139146, now seen corresponding path program 1 times [2018-09-18 10:02:28,070 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:02:28,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:02:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:02:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:02:28,071 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:02:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:02:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 33 proven. 74 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-09-18 10:02:28,290 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:02:28,290 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:02:28,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:02:28,310 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:02:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:02:28,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:02:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-18 10:02:28,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:02:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-18 10:02:28,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:02:28,816 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:02:28,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:02:28,832 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:02:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:02:28,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:02:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-18 10:02:28,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:02:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-18 10:02:29,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:02:29,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 21 [2018-09-18 10:02:29,076 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:02:29,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-18 10:02:29,076 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-18 10:02:29,077 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-09-18 10:02:29,077 INFO L87 Difference]: Start difference. First operand 248 states and 374 transitions. Second operand 16 states. [2018-09-18 10:02:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:02:30,749 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2018-09-18 10:02:30,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-18 10:02:30,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 120 [2018-09-18 10:02:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:02:30,752 INFO L225 Difference]: With dead ends: 363 [2018-09-18 10:02:30,752 INFO L226 Difference]: Without dead ends: 361 [2018-09-18 10:02:30,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 465 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-09-18 10:02:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-09-18 10:02:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 294. [2018-09-18 10:02:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-18 10:02:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 440 transitions. [2018-09-18 10:02:30,821 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 440 transitions. Word has length 120 [2018-09-18 10:02:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:02:30,822 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 440 transitions. [2018-09-18 10:02:30,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-18 10:02:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 440 transitions. [2018-09-18 10:02:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-18 10:02:30,825 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:02:30,825 INFO L376 BasicCegarLoop]: trace histogram [22, 21, 21, 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] [2018-09-18 10:02:30,825 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:02:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash -769027094, now seen corresponding path program 2 times [2018-09-18 10:02:30,826 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:02:30,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:02:30,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:02:30,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:02:30,827 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:02:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:02:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 41 proven. 92 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-09-18 10:02:31,158 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:02:31,158 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:02:31,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 10:02:31,166 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 10:02:31,209 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 10:02:31,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 10:02:31,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:02:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-09-18 10:02:31,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:02:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 42 proven. 31 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-09-18 10:02:32,393 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:02:32,393 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:02:32,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 10:02:32,420 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 10:02:32,507 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 10:02:32,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 10:02:32,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:02:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 266 proven. 17 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-09-18 10:02:34,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:02:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 54 proven. 19 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-09-18 10:02:35,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:02:35,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 9, 9] total 41 [2018-09-18 10:02:35,033 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:02:35,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-18 10:02:35,034 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-18 10:02:35,035 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1476, Unknown=1, NotChecked=0, Total=1640 [2018-09-18 10:02:35,035 INFO L87 Difference]: Start difference. First operand 294 states and 440 transitions. Second operand 20 states. [2018-09-18 10:02:45,428 WARN L178 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-18 10:02:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:02:51,918 INFO L93 Difference]: Finished difference Result 406 states and 587 transitions. [2018-09-18 10:02:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-18 10:02:51,919 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 142 [2018-09-18 10:02:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:02:51,919 INFO L225 Difference]: With dead ends: 406 [2018-09-18 10:02:51,919 INFO L226 Difference]: Without dead ends: 0 [2018-09-18 10:02:51,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 540 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=878, Invalid=4377, Unknown=1, NotChecked=0, Total=5256 [2018-09-18 10:02:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-18 10:02:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-18 10:02:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-18 10:02:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-18 10:02:51,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2018-09-18 10:02:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:02:51,924 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-18 10:02:51,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-18 10:02:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-18 10:02:51,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-18 10:02:51,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-18 10:02:51,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,062 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 163 [2018-09-18 10:02:52,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,350 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 204 [2018-09-18 10:02:52,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,463 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 166 [2018-09-18 10:02:52,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,805 WARN L178 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 209 [2018-09-18 10:02:52,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:52,999 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 168 [2018-09-18 10:02:53,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,402 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 215 [2018-09-18 10:02:53,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:02:53,683 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 225 [2018-09-18 10:03:00,314 WARN L178 SmtUtils]: Spent 6.37 s on a formula simplification. DAG size of input: 161 DAG size of output: 62 [2018-09-18 10:03:02,053 WARN L178 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 201 DAG size of output: 27 [2018-09-18 10:03:09,420 WARN L178 SmtUtils]: Spent 7.36 s on a formula simplification. DAG size of input: 164 DAG size of output: 62 [2018-09-18 10:03:11,222 WARN L178 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 206 DAG size of output: 27 [2018-09-18 10:03:16,493 WARN L178 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 126 DAG size of output: 53 [2018-09-18 10:03:24,680 WARN L178 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 129 DAG size of output: 61 [2018-09-18 10:03:30,614 WARN L178 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 161 DAG size of output: 62 [2018-09-18 10:03:32,747 WARN L178 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 126 DAG size of output: 53 [2018-09-18 10:03:35,169 WARN L178 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 161 DAG size of output: 67 [2018-09-18 10:03:35,485 WARN L178 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 26 [2018-09-18 10:03:38,528 WARN L178 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 126 DAG size of output: 53 [2018-09-18 10:03:41,071 WARN L178 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 209 DAG size of output: 75 [2018-09-18 10:03:41,366 WARN L178 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 26 [2018-09-18 10:03:45,706 WARN L178 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 219 DAG size of output: 88 [2018-09-18 10:04:02,357 WARN L178 SmtUtils]: Spent 16.62 s on a formula simplification. DAG size of input: 174 DAG size of output: 95 [2018-09-18 10:04:02,361 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-18 10:04:02,361 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:04:02,361 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:04:02,361 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-18 10:04:02,361 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-18 10:04:02,361 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-18 10:04:02,361 INFO L422 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse5 (* 2 main_~l~0))) (let ((.cse1 (= main_~n~0 main_~r~0)) (.cse6 (<= main_~i~0 (div main_~n~0 2))) (.cse4 (<= (+ .cse5 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse7 (<= main_~j~0 .cse5)) (.cse0 (<= 1 main_~l~0)) (.cse2 (<= (+ main_~j~0 1) main_~n~0)) (.cse3 (<= 1 main_~i~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 2) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse1 (exists ((v_main_~l~0_55 Int) (main_~l~0 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (<= (* 2 main_~l~0) main_~j~0) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse3 .cse6 .cse7 (<= (+ .cse5 1) main_~n~0)) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse6 .cse4 (<= (+ main_~j~0 3) main_~n~0) .cse7) (and .cse0 (<= main_~l~0 1) .cse2 .cse3 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0))))) [2018-09-18 10:04:02,362 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-09-18 10:04:02,362 INFO L422 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse5 (<= 1 main_~l~0)) (.cse0 (<= 1 main_~i~0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (<= .cse3 main_~j~0))) (let ((.cse9 (and .cse5 .cse0 .cse1 (exists ((v_main_~l~0_37 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_37) (<= (* 2 v_main_~l~0_37) main_~r~0))) (<= (+ main_~j~0 1) main_~n~0) .cse2)) (.cse10 (exists ((v_main_~l~0_55 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55))))) (.cse6 (<= main_~j~0 main_~n~0)) (.cse7 (and .cse1 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2)))) (<= 2 main_~r~0)))) (or (and (and .cse0 (and .cse1 (<= main_~j~0 main_~r~0))) .cse2 (<= main_~j~0 .cse3) (exists ((v_prenex_5 Int) (main_~l~0 Int)) (let ((.cse4 (div v_prenex_5 2))) (and (<= .cse4 main_~l~0) (<= 0 v_prenex_5) (<= 1 v_prenex_5) (<= main_~r~0 v_prenex_5) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse4))))) (and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (and .cse5 .cse0 .cse6 .cse2 .cse7) (<= (+ main_~i~0 2) main_~n~0)) (and (exists ((main_~l~0 Int)) (let ((.cse8 (* 2 main_~l~0))) (and (<= main_~i~0 .cse8) (<= (+ .cse8 2) main_~n~0)))) .cse9) (and .cse5 .cse0 (<= main_~l~0 1) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) (< 1 main_~r~0) .cse6 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0)) (and .cse10 (<= (+ main_~r~0 2) (* 2 main_~j~0)) .cse9) (and (and .cse0 (exists ((v_main_~l~0_55 Int) (main_~l~0 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse10 .cse6 .cse7) (<= (+ .cse3 1) main_~n~0)))))) [2018-09-18 10:04:02,362 INFO L422 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 (* 2 main_~l~0))) (let ((.cse1 (= main_~n~0 main_~r~0)) (.cse6 (<= main_~i~0 (div main_~n~0 2))) (.cse4 (<= (+ .cse5 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse7 (<= main_~j~0 .cse5)) (.cse0 (<= 1 main_~l~0)) (.cse2 (<= (+ main_~j~0 1) main_~n~0)) (.cse3 (<= 1 main_~i~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 2) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse1 (exists ((v_main_~l~0_55 Int) (main_~l~0 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (<= (* 2 main_~l~0) main_~j~0) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse3 .cse6 .cse7 (<= (+ .cse5 1) main_~n~0)) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse6 .cse4 (<= (+ main_~j~0 3) main_~n~0) .cse7) (and .cse0 (<= main_~l~0 1) .cse2 .cse3 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0))))) [2018-09-18 10:04:02,362 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-09-18 10:04:02,362 INFO L422 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse1 (exists ((v_main_~l~0_55 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55))))) (.cse7 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse4 (<= (+ .cse6 2) main_~n~0)) (.cse0 (= main_~n~0 main_~r~0)) (.cse2 (exists ((main_~l~0 Int)) (let ((.cse11 (* 2 main_~l~0))) (and (<= main_~i~0 .cse11) (<= (+ .cse11 2) main_~n~0))))) (.cse5 (<= (+ .cse6 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse10 (<= 1 main_~l~0)) (.cse3 (<= 1 main_~i~0))) (or (and .cse0 (exists ((v_main_~l~0_55 Int) (main_~l~0 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse1 .cse2 .cse3 .cse4) (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 (<= main_~i~0 (div main_~n~0 2)) .cse5 (<= main_~j~0 .cse6) .cse7) (or (and (exists ((v_main_~l~0_37 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_37) (<= (* 2 v_main_~l~0_37) main_~r~0))) .cse0 .cse1 .cse3 (<= (+ main_~r~0 2) main_~j~0)) (and (exists ((v_prenex_5 Int) (v_main_~j~0_61 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_5 2))) (and (<= .cse8 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_61) (<= 0 v_prenex_5) (<= 1 v_prenex_5) (<= (* 2 v_main_~j~0_61) main_~j~0) (<= main_~r~0 v_prenex_5) (< 0 .cse8)))) .cse0 (exists ((v_prenex_5 Int)) (let ((.cse9 (div v_prenex_5 2))) (and (<= .cse9 main_~l~0) (<= 0 v_prenex_5) (<= 1 v_prenex_5) (<= main_~r~0 v_prenex_5) (< 0 .cse9)))) .cse3 .cse7)) (and .cse10 .cse0 .cse3 .cse5 .cse4 (exists ((main_~l~0 Int) (v_main_~j~0_85 Int)) (and (<= main_~i~0 v_main_~j~0_85) (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_85) main_~j~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_85)))) (and .cse10 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 (<= (+ .cse6 3) main_~n~0) .cse2 .cse3 .cse5) (and .cse10 (<= main_~l~0 1) (<= (+ main_~r~0 1) main_~n~0) .cse3 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0))))) [2018-09-18 10:04:02,363 INFO L426 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-09-18 10:04:02,363 INFO L426 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-09-18 10:04:02,363 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-09-18 10:04:02,363 INFO L426 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-09-18 10:04:02,363 INFO L422 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 (* 2 main_~l~0))) (let ((.cse4 (<= (+ .cse5 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse6 (<= main_~i~0 (div main_~n~0 2))) (.cse1 (= main_~n~0 main_~r~0)) (.cse7 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse0 (<= 1 main_~l~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse3 (<= 1 main_~i~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 2) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse6 .cse4 (<= main_~j~0 .cse5) .cse7) (and .cse3 .cse6 (and (and .cse0 .cse1 (<= main_~j~0 main_~r~0)) .cse7) (exists ((v_prenex_3 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_3 2))) (and (< 0 .cse8) (<= .cse8 main_~l~0) (<= 1 v_prenex_3) (<= 0 v_prenex_3) (<= main_~r~0 v_prenex_3) (<= (* 2 main_~l~0) main_~j~0))))) (and .cse0 (<= main_~l~0 1) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse2 .cse3 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0))))) [2018-09-18 10:04:02,363 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-18 10:04:02,363 INFO L426 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-09-18 10:04:02,364 INFO L422 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse5 (* 2 main_~l~0))) (let ((.cse4 (<= (+ .cse5 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse6 (<= main_~i~0 (div main_~n~0 2))) (.cse1 (= main_~n~0 main_~r~0)) (.cse7 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse0 (<= 1 main_~l~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse3 (<= 1 main_~i~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 2) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse6 .cse4 (<= main_~j~0 .cse5) .cse7) (and .cse3 .cse6 (and (and .cse0 .cse1 (<= main_~j~0 main_~r~0)) .cse7) (exists ((v_prenex_3 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_3 2))) (and (< 0 .cse8) (<= .cse8 main_~l~0) (<= 1 v_prenex_3) (<= 0 v_prenex_3) (<= main_~r~0 v_prenex_3) (<= (* 2 main_~l~0) main_~j~0))))) (and .cse0 (<= main_~l~0 1) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse2 .cse3 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0))))) [2018-09-18 10:04:02,364 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-09-18 10:04:02,364 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-09-18 10:04:02,364 INFO L422 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (<= 1 main_~l~0)) (.cse1 (<= 1 main_~i~0)) (.cse3 (<= 2 main_~r~0)) (.cse2 (<= main_~l~0 1))) (or (and .cse0 .cse1 (and (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (and .cse2 .cse3) (<= (+ main_~r~0 1) main_~n~0))) (and .cse0 .cse1 (and (and (= main_~n~0 main_~r~0) .cse3) .cse2) (<= (* 2 main_~l~0) main_~j~0)))) [2018-09-18 10:04:02,364 INFO L422 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (<= 1 main_~l~0)) (.cse1 (<= 1 main_~i~0)) (.cse3 (<= 2 main_~r~0)) (.cse2 (<= main_~l~0 1))) (or (and .cse0 .cse1 (and (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (and .cse2 .cse3) (<= (+ main_~r~0 1) main_~n~0))) (and .cse0 .cse1 (and (and (= main_~n~0 main_~r~0) .cse3) .cse2) (<= (* 2 main_~l~0) main_~j~0)))) [2018-09-18 10:04:02,364 INFO L422 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (* 2 main_~l~0))) (let ((.cse0 (and (<= 1 main_~i~0) (<= .cse1 main_~j~0) (and (= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse2 (< 1 main_~l~0))) (or (and (or (and .cse0 (<= (+ main_~r~0 2) main_~j~0)) (and .cse0 (<= main_~j~0 .cse1))) .cse2) (and .cse0 .cse2 (<= (+ .cse1 1) main_~n~0))))) [2018-09-18 10:04:02,364 INFO L426 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-09-18 10:04:02,364 INFO L422 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse2 (* 2 main_~l~0))) (let ((.cse0 (and (<= 1 main_~i~0) (<= .cse2 main_~j~0) (and (= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse1 (< 1 main_~l~0))) (or (and .cse0 .cse1 (<= (+ .cse2 1) main_~n~0)) (and (or (and .cse0 (<= (+ main_~r~0 2) main_~j~0)) (and .cse0 (<= main_~j~0 .cse2))) .cse1)))) [2018-09-18 10:04:02,364 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-09-18 10:04:02,365 INFO L422 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse5 (* 2 main_~l~0))) (let ((.cse4 (<= (+ .cse5 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse0 (<= 1 main_~l~0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse3 (<= 1 main_~i~0)) (.cse6 (<= main_~i~0 (div main_~n~0 2)))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 2) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse6 .cse4 (<= main_~j~0 .cse5) (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (and .cse0 (<= main_~l~0 1) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse2 .cse3 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) (and .cse1 (exists ((v_main_~l~0_55 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse2 .cse3 .cse6 (exists ((v_prenex_3 Int) (main_~l~0 Int)) (let ((.cse7 (div v_prenex_3 2))) (and (< 0 .cse7) (<= .cse7 main_~l~0) (<= 1 v_prenex_3) (<= 0 v_prenex_3) (<= main_~r~0 v_prenex_3) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (<= (+ .cse5 1) main_~n~0))))) [2018-09-18 10:04:02,365 INFO L422 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse5 (* 2 main_~l~0))) (let ((.cse4 (<= (+ .cse5 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse6 (<= main_~i~0 (div main_~n~0 2))) (.cse1 (= main_~n~0 main_~r~0)) (.cse7 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse0 (<= 1 main_~l~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse3 (<= 1 main_~i~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 2) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse6 .cse4 (<= main_~j~0 .cse5) .cse7) (and .cse3 .cse6 (and (and .cse0 .cse1 (<= main_~j~0 main_~r~0)) .cse7) (exists ((v_prenex_3 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_3 2))) (and (< 0 .cse8) (<= .cse8 main_~l~0) (<= 1 v_prenex_3) (<= 0 v_prenex_3) (<= main_~r~0 v_prenex_3) (<= (* 2 main_~l~0) main_~j~0))))) (and .cse0 (<= main_~l~0 1) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse2 .cse3 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0))))) [2018-09-18 10:04:02,365 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-18 10:04:02,365 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-09-18 10:04:02,365 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-09-18 10:04:02,365 INFO L422 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse7 (<= main_~i~0 (div main_~n~0 2))) (.cse6 (<= (+ .cse3 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse8 (<= main_~j~0 .cse3)) (.cse0 (<= 1 main_~l~0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (exists ((main_~l~0 Int)) (let ((.cse10 (* 2 main_~l~0))) (and (<= main_~i~0 .cse10) (<= (+ .cse10 2) main_~n~0))))) (.cse5 (<= 1 main_~i~0)) (.cse9 (<= (+ .cse3 1) main_~n~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 (<= (+ .cse3 3) main_~n~0) .cse4 .cse5 .cse6) (and .cse1 (exists ((v_main_~l~0_55 Int) (main_~l~0 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (<= (* 2 main_~l~0) main_~j~0) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse5 .cse7 .cse8 .cse9) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse5 .cse7 .cse6 (<= (+ main_~j~0 3) main_~n~0) .cse8) (and .cse0 (<= main_~l~0 1) .cse2 .cse5 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) (and .cse1 (exists ((v_main_~l~0_55 Int) (main_~l~0 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse2 (exists ((v_main_~l~0_55 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse4 .cse5 .cse9)))) [2018-09-18 10:04:02,366 INFO L422 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse5 (* 2 main_~l~0))) (let ((.cse1 (= main_~n~0 main_~r~0)) (.cse6 (<= main_~i~0 (div main_~n~0 2))) (.cse4 (<= (+ .cse5 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse7 (<= main_~j~0 .cse5)) (.cse0 (<= 1 main_~l~0)) (.cse2 (<= (+ main_~j~0 1) main_~n~0)) (.cse3 (<= 1 main_~i~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 2) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse1 (exists ((v_main_~l~0_55 Int) (main_~l~0 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (<= (* 2 main_~l~0) main_~j~0) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse3 .cse6 .cse7 (<= (+ .cse5 1) main_~n~0)) (and .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse6 .cse4 (<= (+ main_~j~0 3) main_~n~0) .cse7) (and .cse0 (<= main_~l~0 1) .cse2 .cse3 (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0))))) [2018-09-18 10:04:02,366 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-18 10:04:02,366 INFO L426 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-09-18 10:04:02,366 INFO L422 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse2 (<= .cse3 main_~j~0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse5 (<= 1 main_~l~0)) (.cse0 (<= 1 main_~i~0)) (.cse6 (<= main_~j~0 main_~n~0))) (or (and (and .cse0 (and .cse1 (<= main_~j~0 main_~r~0))) .cse2 (<= main_~j~0 .cse3) (exists ((v_prenex_5 Int) (main_~l~0 Int)) (let ((.cse4 (div v_prenex_5 2))) (and (<= .cse4 main_~l~0) (<= 0 v_prenex_5) (<= 1 v_prenex_5) (<= main_~r~0 v_prenex_5) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse4))))) (and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (and .cse5 .cse0 .cse6 .cse2 .cse1) (<= (+ main_~i~0 2) main_~n~0)) (and (exists ((main_~l~0 Int)) (let ((.cse7 (* 2 main_~l~0))) (and (<= main_~i~0 .cse7) (<= (+ .cse7 2) main_~n~0)))) (and .cse5 .cse0 .cse1 (<= (+ main_~j~0 1) main_~n~0) .cse2)) (and (exists ((v_main_~l~0_55 Int)) (and (<= v_main_~l~0_55 (+ main_~l~0 1)) (< 1 v_main_~l~0_55) (<= main_~r~0 (* 2 v_main_~l~0_55)))) .cse6 .cse0 (exists ((v_prenex_3 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_3 2))) (and (< 0 .cse8) (<= .cse8 main_~l~0) (<= 1 v_prenex_3) (<= 0 v_prenex_3) (<= main_~r~0 v_prenex_3) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) .cse1 (<= (+ .cse3 1) main_~n~0)) (and .cse5 .cse0 (<= main_~l~0 1) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) (< 1 main_~r~0) .cse6 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))))) [2018-09-18 10:04:02,366 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-09-18 10:04:02,366 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-18 10:04:02,366 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-18 10:04:02,366 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-18 10:04:02,366 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-18 10:04:02,367 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-18 10:04:02,367 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-18 10:04:02,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,378 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,378 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,378 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,378 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,378 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,379 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,379 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,379 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,379 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,380 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,380 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,380 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,380 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,380 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,381 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,381 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,381 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,381 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,382 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,382 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,382 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,382 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,382 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,387 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,387 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,387 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,387 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,400 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,401 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,401 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,401 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,401 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,405 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,405 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,405 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,405 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 10:04:02 BoogieIcfgContainer [2018-09-18 10:04:02,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 10:04:02,416 INFO L168 Benchmark]: Toolchain (without parser) took 163444.00 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -546.9 MB). Peak memory consumption was 926.4 MB. Max. memory is 7.1 GB. [2018-09-18 10:04:02,417 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 10:04:02,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-09-18 10:04:02,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 10:04:02,419 INFO L168 Benchmark]: Boogie Preprocessor took 35.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 10:04:02,419 INFO L168 Benchmark]: RCFGBuilder took 563.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-09-18 10:04:02,420 INFO L168 Benchmark]: TraceAbstraction took 162553.30 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 296.2 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 236.7 MB). Peak memory consumption was 952.9 MB. Max. memory is 7.1 GB. [2018-09-18 10:04:02,424 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.19 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 260.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 25.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 563.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 162553.30 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 296.2 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 236.7 MB). Peak memory consumption was 952.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-09-18 10:04:02,439 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,439 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,439 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,439 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,439 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,446 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,446 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,446 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,446 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,446 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,446 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,451 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,451 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,451 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,451 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,452 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,452 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,452 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,452 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,452 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-18 10:04:02,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,455 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_55,QUANTIFIED] [2018-09-18 10:04:02,455 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,455 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,455 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,455 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-18 10:04:02,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-09-18 10:04:02,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-18 10:04:02,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_85,QUANTIFIED] [2018-09-18 10:04:02,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-18 10:04:02,460 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: (((((((((n == r && (\exists v_main_~l~0_55 : int, main_~l~0 : int :: ((v_main_~l~0_55 <= main_~l~0 + 1 && 2 * main_~l~0 + 1 <= j) && 1 < v_main_~l~0_55) && r <= 2 * v_main_~l~0_55)) && (\exists v_main_~l~0_55 : int :: (v_main_~l~0_55 <= l + 1 && 1 < v_main_~l~0_55) && r <= 2 * v_main_~l~0_55)) && (\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n)) && 1 <= i) && 2 * l + 2 <= n) || ((((((n == r && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 <= j)) && 1 <= i) && i <= n / 2) && 2 * l + r <= j + n) && j <= 2 * l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2))) || (((((\exists v_main_~l~0_37 : int :: l + 1 <= v_main_~l~0_37 && 2 * v_main_~l~0_37 <= r) && n == r) && (\exists v_main_~l~0_55 : int :: (v_main_~l~0_55 <= l + 1 && 1 < v_main_~l~0_55) && r <= 2 * v_main_~l~0_55)) && 1 <= i) && r + 2 <= j) || (((((\exists v_prenex_5 : int, v_main_~j~0_61 : int, main_~l~0 : int :: (((((v_prenex_5 / 2 <= main_~l~0 && 2 * main_~l~0 <= v_main_~j~0_61) && 0 <= v_prenex_5) && 1 <= v_prenex_5) && 2 * v_main_~j~0_61 <= j) && r <= v_prenex_5) && 0 < v_prenex_5 / 2) && n == r) && (\exists v_prenex_5 : int :: (((v_prenex_5 / 2 <= l && 0 <= v_prenex_5) && 1 <= v_prenex_5) && r <= v_prenex_5) && 0 < v_prenex_5 / 2)) && 1 <= i) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2))) || (((((1 <= l && n == r) && 1 <= i) && 2 * l + r <= j + n) && 2 * l + 2 <= n) && (\exists main_~l~0 : int, v_main_~j~0_85 : int :: ((i <= v_main_~j~0_85 && 1 <= main_~l~0) && 2 * v_main_~j~0_85 <= j) && 2 * main_~l~0 + 1 <= v_main_~j~0_85))) || ((((((1 <= l && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && n == r) && 2 * l + 3 <= n) && (\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n)) && 1 <= i) && 2 * l + r <= j + n)) || (((((1 <= l && l <= 1) && r + 1 <= n) && 1 <= i) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 162.4s OverallTime, 19 OverallIterations, 22 TraceHistogramMax, 59.9s AutomataDifference, 0.0s DeadEndRemovalTime, 70.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1504 SDtfs, 1128 SDslu, 5080 SDs, 0 SdLazy, 4685 SolverSat, 2003 SolverUnsat, 49 SolverUnknown, 0 SolverNotchecked, 46.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3470 GetRequests, 3072 SyntacticMatches, 39 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2643 ImplicationChecksByTransitivity, 36.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=12, 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: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 548 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 844 PreInvPairs, 1119 NumberOfFragments, 2736 HoareAnnotationTreeSize, 844 FomulaSimplifications, 896310773 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 291691186 FormulaSimplificationTreeSizeReductionInter, 68.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 2613 NumberOfCodeBlocks, 2613 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 4158 ConstructedInterpolants, 500 QuantifiedInterpolants, 1594915 SizeOfPredicates, 129 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 65 InterpolantComputations, 23 PerfectInterpolantSequences, 14820/15436 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/heapsort_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_10-04-02-466.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/heapsort_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-18_10-04-02-466.csv Received shutdown request...