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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:38:48,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:38:48,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:38:48,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:38:48,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:38:48,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:38:48,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:38:48,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:38:48,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:38:48,328 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:38:48,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:38:48,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:38:48,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:38:48,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:38:48,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:38:48,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:38:48,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:38:48,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:38:48,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:38:48,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:38:48,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:38:48,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:38:48,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:38:48,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:38:48,353 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:38:48,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:38:48,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:38:48,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:38:48,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:38:48,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:38:48,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:38:48,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:38:48,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:38:48,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:38:48,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:38:48,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:38:48,369 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:38:48,399 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:38:48,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:38:48,403 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:38:48,403 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:38:48,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:38:48,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:38:48,405 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:38:48,405 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:38:48,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:38:48,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:38:48,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:38:48,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:38:48,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:38:48,406 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:38:48,406 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:38:48,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:38:48,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:38:48,408 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:38:48,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:38:48,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:38:48,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:38:48,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:38:48,409 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:38:48,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:38:48,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:38:48,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:38:48,409 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:38:48,410 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:38:48,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:38:48,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:38:48,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:38:48,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:38:48,492 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:38:48,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-06 22:38:48,556 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/903a7a2a5/447aec8ce06547d9952ec0f6b2fa70ca/FLAG6bbebb93a [2018-11-06 22:38:49,007 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:38:49,008 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-06 22:38:49,013 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/903a7a2a5/447aec8ce06547d9952ec0f6b2fa70ca/FLAG6bbebb93a [2018-11-06 22:38:49,029 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/903a7a2a5/447aec8ce06547d9952ec0f6b2fa70ca [2018-11-06 22:38:49,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:38:49,039 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:38:49,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:38:49,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:38:49,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:38:49,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d43b656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49, skipping insertion in model container [2018-11-06 22:38:49,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:38:49,080 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:38:49,299 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:38:49,308 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:38:49,340 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:38:49,363 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:38:49,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49 WrapperNode [2018-11-06 22:38:49,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:38:49,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:38:49,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:38:49,365 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:38:49,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:38:49,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:38:49,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:38:49,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:38:49,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (1/1) ... [2018-11-06 22:38:49,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:38:49,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:38:49,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:38:49,431 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:38:49,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (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-11-06 22:38:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-06 22:38:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-06 22:38:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:38:49,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:38:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-06 22:38:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-06 22:38:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-06 22:38:50,034 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:38:50,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:50 BoogieIcfgContainer [2018-11-06 22:38:50,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:38:50,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:38:50,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:38:50,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:38:50,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:38:49" (1/3) ... [2018-11-06 22:38:50,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0b63b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:50, skipping insertion in model container [2018-11-06 22:38:50,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:49" (2/3) ... [2018-11-06 22:38:50,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0b63b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:50, skipping insertion in model container [2018-11-06 22:38:50,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:50" (3/3) ... [2018-11-06 22:38:50,043 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-11-06 22:38:50,053 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:38:50,065 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:38:50,083 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:38:50,116 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:38:50,117 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:38:50,117 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:38:50,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:38:50,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:38:50,117 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:38:50,117 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:38:50,117 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:38:50,118 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:38:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-06 22:38:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-06 22:38:50,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:50,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:50,144 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:50,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash -794186159, now seen corresponding path program 1 times [2018-11-06 22:38:50,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:50,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:50,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:50,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:50,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:38:50,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:38:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:38:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:38:50,314 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-06 22:38:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:50,332 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-06 22:38:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:38:50,333 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-06 22:38:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:50,344 INFO L225 Difference]: With dead ends: 77 [2018-11-06 22:38:50,344 INFO L226 Difference]: Without dead ends: 41 [2018-11-06 22:38:50,347 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-11-06 22:38:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-06 22:38:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-06 22:38:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-06 22:38:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-06 22:38:50,387 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 21 [2018-11-06 22:38:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:50,388 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-06 22:38:50,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:38:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-06 22:38:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-06 22:38:50,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:50,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:50,390 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:50,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash -593923913, now seen corresponding path program 1 times [2018-11-06 22:38:50,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:50,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:50,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:50,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:38:50,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:38:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:38:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:38:50,509 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 3 states. [2018-11-06 22:38:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:50,738 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-06 22:38:50,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:38:50,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-06 22:38:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:50,741 INFO L225 Difference]: With dead ends: 71 [2018-11-06 22:38:50,741 INFO L226 Difference]: Without dead ends: 45 [2018-11-06 22:38:50,743 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-11-06 22:38:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-06 22:38:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-06 22:38:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-06 22:38:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-06 22:38:50,757 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-11-06 22:38:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:50,758 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-06 22:38:50,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:38:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-06 22:38:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-06 22:38:50,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:50,760 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 22:38:50,760 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:50,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash 496444158, now seen corresponding path program 1 times [2018-11-06 22:38:50,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:50,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:50,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:50,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:50,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:50,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:50,889 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:38:50,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:50,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:50,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:50,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-06 22:38:50,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:38:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:38:50,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:38:50,996 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2018-11-06 22:38:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:51,183 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-06 22:38:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:38:51,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-06 22:38:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:51,188 INFO L225 Difference]: With dead ends: 75 [2018-11-06 22:38:51,188 INFO L226 Difference]: Without dead ends: 49 [2018-11-06 22:38:51,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:38:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-06 22:38:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-06 22:38:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-06 22:38:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-06 22:38:51,199 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-11-06 22:38:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:51,199 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-06 22:38:51,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:38:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-06 22:38:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-06 22:38:51,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:51,201 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:51,201 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:51,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1750358469, now seen corresponding path program 2 times [2018-11-06 22:38:51,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:51,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:51,298 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:38:51,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-06 22:38:51,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:51,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-06 22:38:51,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 22:38:51,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-06 22:38:51,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:38:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:38:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:38:51,540 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2018-11-06 22:38:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:51,911 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-06 22:38:51,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:38:51,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-06 22:38:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:51,913 INFO L225 Difference]: With dead ends: 94 [2018-11-06 22:38:51,914 INFO L226 Difference]: Without dead ends: 68 [2018-11-06 22:38:51,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:38:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-06 22:38:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2018-11-06 22:38:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-06 22:38:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-06 22:38:51,930 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 31 [2018-11-06 22:38:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:51,930 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-06 22:38:51,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:38:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-06 22:38:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-06 22:38:51,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:51,934 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:51,935 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:51,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2127477742, now seen corresponding path program 1 times [2018-11-06 22:38:51,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:51,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:51,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:51,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:38:52,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:52,106 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:38:52,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:52,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:38:52,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:52,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-06 22:38:52,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:38:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:38:52,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:38:52,196 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2018-11-06 22:38:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:52,280 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-11-06 22:38:52,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:38:52,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-06 22:38:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:52,281 INFO L225 Difference]: With dead ends: 87 [2018-11-06 22:38:52,281 INFO L226 Difference]: Without dead ends: 59 [2018-11-06 22:38:52,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:38:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-06 22:38:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-06 22:38:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-06 22:38:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-06 22:38:52,289 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 46 [2018-11-06 22:38:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:52,290 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-06 22:38:52,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:38:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-06 22:38:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-06 22:38:52,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:52,292 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:52,292 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:52,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:52,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1834611179, now seen corresponding path program 2 times [2018-11-06 22:38:52,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:52,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:52,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:52,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:52,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:38:52,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:52,720 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:38:52,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:38:52,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:38:52,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:52,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:38:52,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:52,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-06 22:38:52,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:38:52,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:38:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:38:52,823 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2018-11-06 22:38:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:52,998 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-06 22:38:52,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:38:52,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-06 22:38:52,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:53,001 INFO L225 Difference]: With dead ends: 125 [2018-11-06 22:38:53,001 INFO L226 Difference]: Without dead ends: 97 [2018-11-06 22:38:53,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:38:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-06 22:38:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 61. [2018-11-06 22:38:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-06 22:38:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-06 22:38:53,011 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 50 [2018-11-06 22:38:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:53,011 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-06 22:38:53,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:38:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-06 22:38:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-06 22:38:53,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:53,013 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:53,013 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:53,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1755968700, now seen corresponding path program 3 times [2018-11-06 22:38:53,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:53,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:53,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-06 22:38:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:53,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:38:53,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:38:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:38:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:38:53,141 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-11-06 22:38:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:53,271 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-11-06 22:38:53,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:38:53,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-06 22:38:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:53,274 INFO L225 Difference]: With dead ends: 105 [2018-11-06 22:38:53,274 INFO L226 Difference]: Without dead ends: 80 [2018-11-06 22:38:53,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:38:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-06 22:38:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-11-06 22:38:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-06 22:38:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-06 22:38:53,282 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 54 [2018-11-06 22:38:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:53,283 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-06 22:38:53,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:38:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-06 22:38:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-06 22:38:53,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:53,284 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:53,285 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:53,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1400751282, now seen corresponding path program 1 times [2018-11-06 22:38:53,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:53,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-06 22:38:53,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:53,413 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:38:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:53,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-06 22:38:54,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:54,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-06 22:38:54,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:38:54,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:38:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:38:54,027 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 9 states. [2018-11-06 22:38:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:54,684 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-11-06 22:38:54,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 22:38:54,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-06 22:38:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:54,687 INFO L225 Difference]: With dead ends: 124 [2018-11-06 22:38:54,687 INFO L226 Difference]: Without dead ends: 99 [2018-11-06 22:38:54,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-11-06 22:38:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-06 22:38:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-06 22:38:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-06 22:38:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-11-06 22:38:54,697 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 60 [2018-11-06 22:38:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:54,698 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-11-06 22:38:54,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:38:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-11-06 22:38:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-06 22:38:54,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:54,700 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:54,700 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:54,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash -77800680, now seen corresponding path program 2 times [2018-11-06 22:38:54,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:54,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:54,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 22:38:54,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:54,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:38:54,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:38:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:38:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:38:54,819 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 5 states. [2018-11-06 22:38:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:54,890 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-11-06 22:38:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:38:54,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-11-06 22:38:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:54,891 INFO L225 Difference]: With dead ends: 146 [2018-11-06 22:38:54,892 INFO L226 Difference]: Without dead ends: 101 [2018-11-06 22:38:54,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:38:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-06 22:38:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-11-06 22:38:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-06 22:38:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-11-06 22:38:54,902 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 88 [2018-11-06 22:38:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:54,903 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-11-06 22:38:54,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:38:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-11-06 22:38:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-06 22:38:54,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:54,905 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:54,905 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:54,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash 916290126, now seen corresponding path program 3 times [2018-11-06 22:38:54,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:54,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:54,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:54,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:54,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 22:38:55,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:55,146 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:38:55,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:38:55,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-06 22:38:55,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:55,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 22:38:55,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:55,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-06 22:38:55,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 22:38:55,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 22:38:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:38:55,441 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 11 states. [2018-11-06 22:38:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:55,678 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-11-06 22:38:55,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:38:55,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-06 22:38:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:55,680 INFO L225 Difference]: With dead ends: 154 [2018-11-06 22:38:55,680 INFO L226 Difference]: Without dead ends: 107 [2018-11-06 22:38:55,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:38:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-06 22:38:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-06 22:38:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-06 22:38:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-11-06 22:38:55,690 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 94 [2018-11-06 22:38:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:55,691 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-11-06 22:38:55,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 22:38:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-11-06 22:38:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-06 22:38:55,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:55,693 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:55,693 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:55,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash 907761752, now seen corresponding path program 4 times [2018-11-06 22:38:55,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:55,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:55,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:55,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:55,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 22:38:56,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:56,473 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:56,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:38:56,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:38:56,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:56,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 22:38:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-06 22:38:57,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-06 22:38:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-06 22:38:57,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:38:57,402 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 15 states. [2018-11-06 22:38:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:58,147 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2018-11-06 22:38:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 22:38:58,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-11-06 22:38:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:58,150 INFO L225 Difference]: With dead ends: 208 [2018-11-06 22:38:58,151 INFO L226 Difference]: Without dead ends: 161 [2018-11-06 22:38:58,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 22:38:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-06 22:38:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2018-11-06 22:38:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-06 22:38:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-11-06 22:38:58,164 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 100 [2018-11-06 22:38:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:58,165 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-11-06 22:38:58,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-06 22:38:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-11-06 22:38:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-06 22:38:58,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:58,168 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:58,168 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:58,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash 712625138, now seen corresponding path program 5 times [2018-11-06 22:38:58,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:58,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 163 proven. 14 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-11-06 22:38:58,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:58,407 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:38:58,419 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-06 22:38:58,497 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-06 22:38:58,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:58,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:59,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2018-11-06 22:38:59,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:59,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:59,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:59,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:59,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:59,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:59,803 INFO L303 Elim1Store]: Index analysis took 222 ms [2018-11-06 22:38:59,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 205 [2018-11-06 22:38:59,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-06 22:39:00,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-11-06 22:39:00,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-06 22:39:00,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-06 22:39:00,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:242 [2018-11-06 22:39:00,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-11-06 22:39:00,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,601 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-06 22:39:00,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 140 [2018-11-06 22:39:00,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:00,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:00,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-06 22:39:00,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 100 [2018-11-06 22:39:00,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:00,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:00,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-11-06 22:39:00,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:00,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 205 [2018-11-06 22:39:00,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:01,034 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:01,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-11-06 22:39:01,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:01,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:01,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:01,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:01,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:01,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 127 [2018-11-06 22:39:01,163 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:01,182 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:01,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-06 22:39:01,242 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:269, output treesize:224 [2018-11-06 22:39:02,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-11-06 22:39:02,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:02,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:02,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:02,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:02,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:02,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:02,998 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-06 22:39:02,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-11-06 22:39:03,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:03,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:03,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2018-11-06 22:39:03,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:03,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 185 [2018-11-06 22:39:03,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 12 xjuncts. [2018-11-06 22:39:03,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:03,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-06 22:39:03,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:177, output treesize:28 [2018-11-06 22:39:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 188 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-06 22:39:03,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:39:03,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 29] total 33 [2018-11-06 22:39:03,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-06 22:39:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-06 22:39:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 22:39:03,554 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 33 states. [2018-11-06 22:39:07,187 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-06 22:39:07,500 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2018-11-06 22:39:08,152 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2018-11-06 22:39:08,458 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 88 [2018-11-06 22:39:08,803 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 90 [2018-11-06 22:39:08,992 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 82 [2018-11-06 22:39:09,253 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 83 [2018-11-06 22:39:09,832 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 85 [2018-11-06 22:39:10,108 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 87 [2018-11-06 22:39:12,999 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2018-11-06 22:39:14,163 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-11-06 22:39:14,590 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 53 [2018-11-06 22:39:14,885 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2018-11-06 22:39:15,472 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-06 22:39:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:39:15,900 INFO L93 Difference]: Finished difference Result 508 states and 574 transitions. [2018-11-06 22:39:15,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-06 22:39:15,901 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 135 [2018-11-06 22:39:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:39:15,906 INFO L225 Difference]: With dead ends: 508 [2018-11-06 22:39:15,906 INFO L226 Difference]: Without dead ends: 443 [2018-11-06 22:39:15,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3349 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1833, Invalid=9297, Unknown=0, NotChecked=0, Total=11130 [2018-11-06 22:39:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-06 22:39:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 285. [2018-11-06 22:39:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-06 22:39:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 325 transitions. [2018-11-06 22:39:15,937 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 325 transitions. Word has length 135 [2018-11-06 22:39:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:39:15,937 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 325 transitions. [2018-11-06 22:39:15,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-06 22:39:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2018-11-06 22:39:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-06 22:39:15,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:39:15,941 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:39:15,941 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:39:15,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:39:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 818812964, now seen corresponding path program 1 times [2018-11-06 22:39:15,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:39:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:39:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:15,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:39:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:39:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 307 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-06 22:39:16,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:39:16,147 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:39:16,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:39:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:39:16,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:39:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-06 22:39:16,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:39:16,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-06 22:39:16,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-06 22:39:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-06 22:39:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:39:16,391 INFO L87 Difference]: Start difference. First operand 285 states and 325 transitions. Second operand 15 states. [2018-11-06 22:39:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:39:17,068 INFO L93 Difference]: Finished difference Result 522 states and 607 transitions. [2018-11-06 22:39:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 22:39:17,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 152 [2018-11-06 22:39:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:39:17,079 INFO L225 Difference]: With dead ends: 522 [2018-11-06 22:39:17,079 INFO L226 Difference]: Without dead ends: 387 [2018-11-06 22:39:17,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-11-06 22:39:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-06 22:39:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 226. [2018-11-06 22:39:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-06 22:39:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 253 transitions. [2018-11-06 22:39:17,100 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 253 transitions. Word has length 152 [2018-11-06 22:39:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:39:17,101 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 253 transitions. [2018-11-06 22:39:17,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-06 22:39:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 253 transitions. [2018-11-06 22:39:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 22:39:17,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:39:17,103 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:39:17,103 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:39:17,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:39:17,104 INFO L82 PathProgramCache]: Analyzing trace with hash -819722602, now seen corresponding path program 2 times [2018-11-06 22:39:17,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:39:17,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:39:17,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:17,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:39:17,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:39:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-11-06 22:39:17,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:39:17,993 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:39:18,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:39:18,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:39:18,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:39:18,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:39:18,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-11-06 22:39:18,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:18,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:18,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-06 22:39:18,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:26 [2018-11-06 22:39:18,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-11-06 22:39:18,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:18,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:18,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-11-06 22:39:18,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-06 22:39:18,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-11-06 22:39:18,888 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:39:18,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:18,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:18,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 55 [2018-11-06 22:39:18,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:18,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:23 [2018-11-06 22:39:18,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-06 22:39:19,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:19,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:19,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 45 [2018-11-06 22:39:19,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:19,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:19,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:19,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-06 22:39:19,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-06 22:39:19,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:19,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-06 22:39:19,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:19,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:19,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:19,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-06 22:39:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 119 proven. 357 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-06 22:39:19,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:39:19,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31] total 41 [2018-11-06 22:39:19,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-06 22:39:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-06 22:39:19,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2018-11-06 22:39:19,318 INFO L87 Difference]: Start difference. First operand 226 states and 253 transitions. Second operand 41 states. [2018-11-06 22:39:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:39:23,813 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2018-11-06 22:39:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-06 22:39:23,814 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-11-06 22:39:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:39:23,817 INFO L225 Difference]: With dead ends: 633 [2018-11-06 22:39:23,817 INFO L226 Difference]: Without dead ends: 501 [2018-11-06 22:39:23,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=780, Invalid=6026, Unknown=0, NotChecked=0, Total=6806 [2018-11-06 22:39:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-11-06 22:39:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 338. [2018-11-06 22:39:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-06 22:39:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 380 transitions. [2018-11-06 22:39:23,850 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 380 transitions. Word has length 158 [2018-11-06 22:39:23,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:39:23,851 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 380 transitions. [2018-11-06 22:39:23,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-06 22:39:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 380 transitions. [2018-11-06 22:39:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-06 22:39:23,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:39:23,853 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-06 22:39:23,853 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:39:23,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:39:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1790866580, now seen corresponding path program 1 times [2018-11-06 22:39:23,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:39:23,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:39:23,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:23,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:39:23,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:39:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-06 22:39:24,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:39:24,824 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:39:24,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:39:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:39:24,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:39:24,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-06 22:39:24,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:24,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:24,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-06 22:39:24,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:24,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:24,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-06 22:39:24,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:24,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:24,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-06 22:39:25,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-06 22:39:25,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:25,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-06 22:39:25,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-06 22:39:25,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:25,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:25,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-06 22:39:25,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:25,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-06 22:39:25,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:25,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:25,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:25,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:25,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:25,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:25,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:25,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:25,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:25,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:25,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:25,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:25,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:25,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:25,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:25,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:26,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:26,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:26,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:26,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:26,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:26,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:26,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:26,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:26,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:26,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:26,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:26,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:26,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:26,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:26,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:26,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:26,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:26,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:26,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:26,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:26,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-11-06 22:39:26,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-06 22:39:26,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:26,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:26,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:27,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:27,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:27 [2018-11-06 22:39:27,526 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-06 22:39:27,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-06 22:39:27,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:27,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:27,888 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:39:27,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:27,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-06 22:39:27,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:27,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:27,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:27,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2018-11-06 22:39:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-11-06 22:39:28,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:39:28,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-11-06 22:39:28,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-06 22:39:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-06 22:39:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-11-06 22:39:28,084 INFO L87 Difference]: Start difference. First operand 338 states and 380 transitions. Second operand 31 states. [2018-11-06 22:39:28,424 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 22:39:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:39:30,640 INFO L93 Difference]: Finished difference Result 377 states and 419 transitions. [2018-11-06 22:39:30,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-06 22:39:30,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2018-11-06 22:39:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:39:30,644 INFO L225 Difference]: With dead ends: 377 [2018-11-06 22:39:30,644 INFO L226 Difference]: Without dead ends: 375 [2018-11-06 22:39:30,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=617, Invalid=2575, Unknown=0, NotChecked=0, Total=3192 [2018-11-06 22:39:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-06 22:39:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 345. [2018-11-06 22:39:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-06 22:39:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 387 transitions. [2018-11-06 22:39:30,686 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 387 transitions. Word has length 165 [2018-11-06 22:39:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:39:30,687 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 387 transitions. [2018-11-06 22:39:30,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-06 22:39:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 387 transitions. [2018-11-06 22:39:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-06 22:39:30,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:39:30,690 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:39:30,690 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:39:30,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:39:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1396560024, now seen corresponding path program 2 times [2018-11-06 22:39:30,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:39:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:39:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:30,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:39:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:39:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:39:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 155 proven. 202 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-06 22:39:32,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:39:32,586 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:39:32,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:39:32,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:39:32,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:39:32,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:39:32,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-06 22:39:32,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-06 22:39:32,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-06 22:39:32,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-06 22:39:32,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-06 22:39:32,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-06 22:39:32,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:32,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-06 22:39:32,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-06 22:39:32,810 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:32,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:32,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-06 22:39:32,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-06 22:39:32,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-06 22:39:32,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:39:32,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:32,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:32,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-11-06 22:39:33,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-06 22:39:33,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:39:33,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:33,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-06 22:39:33,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-06 22:39:33,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:39:33,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:33,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-06 22:39:33,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-06 22:39:33,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:39:33,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:33,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-06 22:39:33,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-06 22:39:33,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:39:33,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:33,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-06 22:39:33,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:48 [2018-11-06 22:39:41,550 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-06 22:39:43,664 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-06 22:39:45,717 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-06 22:39:47,913 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-06 22:39:50,040 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-06 22:39:52,160 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-06 22:39:54,231 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-06 22:39:56,303 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-06 22:39:56,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-06 22:39:56,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:56,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:39:56,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:39:56,313 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:39:56,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-06 22:39:56,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:56,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-11-06 22:39:56,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-06 22:39:56,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:56,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:39:56,349 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:15 [2018-11-06 22:39:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 203 proven. 47 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-11-06 22:39:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:39:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16] total 41 [2018-11-06 22:39:56,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-06 22:39:56,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-06 22:39:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1431, Unknown=3, NotChecked=0, Total=1640 [2018-11-06 22:39:56,485 INFO L87 Difference]: Start difference. First operand 345 states and 387 transitions. Second operand 41 states. [2018-11-06 22:40:20,997 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-11-06 22:40:29,319 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-11-06 22:40:33,422 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-11-06 22:40:37,575 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-06 22:40:41,885 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-11-06 22:40:46,062 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-11-06 22:40:50,305 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2018-11-06 22:40:54,428 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-06 22:40:58,605 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-11-06 22:41:02,785 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2018-11-06 22:41:06,960 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-06 22:41:11,084 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-06 22:41:15,282 WARN L179 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-11-06 22:41:19,393 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-11-06 22:41:23,577 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-06 22:41:41,907 WARN L179 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-06 22:42:08,324 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-11-06 22:42:16,520 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2018-11-06 22:43:01,381 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-06 22:43:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:43:01,568 INFO L93 Difference]: Finished difference Result 672 states and 762 transitions. [2018-11-06 22:43:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-06 22:43:01,568 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-11-06 22:43:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:43:01,571 INFO L225 Difference]: With dead ends: 672 [2018-11-06 22:43:01,571 INFO L226 Difference]: Without dead ends: 383 [2018-11-06 22:43:01,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 163 SyntacticMatches, 24 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 136.4s TimeCoverageRelationStatistics Valid=952, Invalid=3719, Unknown=21, NotChecked=0, Total=4692 [2018-11-06 22:43:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-06 22:43:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 378. [2018-11-06 22:43:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-06 22:43:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 426 transitions. [2018-11-06 22:43:01,608 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 426 transitions. Word has length 172 [2018-11-06 22:43:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:43:01,608 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 426 transitions. [2018-11-06 22:43:01,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-06 22:43:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 426 transitions. [2018-11-06 22:43:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-06 22:43:01,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:43:01,610 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:43:01,611 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:43:01,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:43:01,611 INFO L82 PathProgramCache]: Analyzing trace with hash -896521002, now seen corresponding path program 3 times [2018-11-06 22:43:01,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:43:01,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:43:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:43:01,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:43:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:43:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:43:02,498 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2018-11-06 22:43:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 208 proven. 44 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-06 22:43:02,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:43:02,933 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-11-06 22:43:02,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:43:03,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-06 22:43:03,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:43:03,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:43:03,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-06 22:43:03,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-06 22:43:03,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-06 22:43:03,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-06 22:43:03,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-06 22:43:03,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-06 22:43:03,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-06 22:43:03,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-06 22:43:03,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-06 22:43:03,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-06 22:43:03,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-06 22:43:03,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-06 22:43:03,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-06 22:43:03,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-06 22:43:03,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-06 22:43:03,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-11-06 22:43:03,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-06 22:43:03,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:43:03,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-06 22:43:03,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-11-06 22:43:03,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-11-06 22:43:03,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:43:03,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:43:03,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-11-06 22:43:03,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-06 22:43:03,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:43:03,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:03,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-06 22:43:03,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-06 22:43:04,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-06 22:43:04,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:43:04,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:04,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:04,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-06 22:43:04,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-06 22:43:04,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-06 22:43:04,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:43:04,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:04,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:04,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-06 22:43:04,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-06 22:43:04,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-06 22:43:04,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-06 22:43:04,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:04,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:04,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-06 22:43:04,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:76 [2018-11-06 22:43:12,353 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-06 22:43:14,412 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-06 22:43:16,950 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-06 22:43:19,059 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-06 22:43:19,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-11-06 22:43:19,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-11-06 22:43:19,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:19,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-11-06 22:43:19,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-06 22:43:19,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:19,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:43:19,094 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:79, output treesize:10 [2018-11-06 22:43:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 77 proven. 14 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-11-06 22:43:19,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:43:19,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-11-06 22:43:19,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-06 22:43:19,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-06 22:43:19,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=953, Unknown=3, NotChecked=0, Total=1122 [2018-11-06 22:43:19,222 INFO L87 Difference]: Start difference. First operand 378 states and 426 transitions. Second operand 34 states. Received shutdown request... [2018-11-06 22:43:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:43:21,394 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 22:43:21,402 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 22:43:21,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:43:21 BoogieIcfgContainer [2018-11-06 22:43:21,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:43:21,404 INFO L168 Benchmark]: Toolchain (without parser) took 272365.19 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 1.8 GB in the end (delta: -405.3 MB). Peak memory consumption was 671.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:43:21,404 INFO L168 Benchmark]: CDTParser took 0.23 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-11-06 22:43:21,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.38 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:43:21,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.71 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-11-06 22:43:21,405 INFO L168 Benchmark]: Boogie Preprocessor took 26.88 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-11-06 22:43:21,405 INFO L168 Benchmark]: RCFGBuilder took 604.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-06 22:43:21,406 INFO L168 Benchmark]: TraceAbstraction took 271366.99 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 340.3 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 350.7 MB). Peak memory consumption was 690.9 MB. Max. memory is 7.1 GB. [2018-11-06 22:43:21,408 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.23 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 323.38 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.71 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 26.88 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 604.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 271366.99 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 340.3 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 350.7 MB). Peak memory consumption was 690.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (378states) and FLOYD_HOARE automaton (currently 9 states, 34 states before enhancement),while ReachableStatesComputation was computing reachable states (8 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. TIMEOUT Result, 271.2s OverallTime, 17 OverallIterations, 15 TraceHistogramMax, 210.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 692 SDtfs, 3635 SDslu, 4369 SDs, 0 SdLazy, 6442 SolverSat, 789 SolverUnsat, 37 SolverUnknown, 0 SolverNotchecked, 83.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1817 GetRequests, 1324 SyntacticMatches, 38 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8021 ImplicationChecksByTransitivity, 175.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=16, 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: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 620 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 58.3s InterpolantComputationTime, 2910 NumberOfCodeBlocks, 2784 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2880 ConstructedInterpolants, 215 QuantifiedInterpolants, 4359788 SizeOfPredicates, 108 NumberOfNonLiveVariables, 2178 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 5782/7005 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown