java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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/sum_array_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:21:58,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:21:58,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:21:58,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:21:58,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:21:58,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:21:58,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:21:58,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:21:58,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:21:58,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:21:58,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:21:58,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:21:58,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:21:58,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:21:58,343 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:21:58,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:21:58,344 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:21:58,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:21:58,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:21:58,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:21:58,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:21:58,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:21:58,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:21:58,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:21:58,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:21:58,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:21:58,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:21:58,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:21:58,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:21:58,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:21:58,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:21:58,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:21:58,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:21:58,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:21:58,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:21:58,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:21:58,363 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 22:21:58,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:21:58,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:21:58,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:21:58,390 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:21:58,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:21:58,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:21:58,391 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:21:58,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:21:58,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:21:58,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:21:58,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:21:58,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:21:58,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:21:58,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:21:58,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:21:58,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:21:58,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:21:58,396 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:21:58,396 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:21:58,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:21:58,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:21:58,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:21:58,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:21:58,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:21:58,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:21:58,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:21:58,398 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:21:58,398 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 22:21:58,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:21:58,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:21:58,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:21:58,472 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:21:58,473 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:21:58,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-10-26 22:21:58,531 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/79314ff93/55977f63ae1f477588f6bbcdbd67f832/FLAG534c26a4d [2018-10-26 22:21:59,060 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:21:59,061 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-10-26 22:21:59,072 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/79314ff93/55977f63ae1f477588f6bbcdbd67f832/FLAG534c26a4d [2018-10-26 22:21:59,087 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/79314ff93/55977f63ae1f477588f6bbcdbd67f832 [2018-10-26 22:21:59,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:21:59,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:21:59,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:21:59,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:21:59,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:21:59,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4aab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59, skipping insertion in model container [2018-10-26 22:21:59,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:21:59,136 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:21:59,327 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:21:59,331 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:21:59,369 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:21:59,397 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:21:59,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59 WrapperNode [2018-10-26 22:21:59,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:21:59,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:21:59,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:21:59,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:21:59,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:21:59,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:21:59,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:21:59,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:21:59,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... [2018-10-26 22:21:59,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:21:59,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:21:59,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:21:59,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:21:59,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:21:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 22:21:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 22:21:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:21:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:21:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 22:21:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 22:22:00,133 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:22:00,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:22:00 BoogieIcfgContainer [2018-10-26 22:22:00,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:22:00,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:22:00,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:22:00,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:22:00,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:21:59" (1/3) ... [2018-10-26 22:22:00,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf15b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:22:00, skipping insertion in model container [2018-10-26 22:22:00,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:21:59" (2/3) ... [2018-10-26 22:22:00,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf15b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:22:00, skipping insertion in model container [2018-10-26 22:22:00,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:22:00" (3/3) ... [2018-10-26 22:22:00,141 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array_true-unreach-call.i [2018-10-26 22:22:00,151 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:22:00,159 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:22:00,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:22:00,208 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:22:00,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:22:00,209 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:22:00,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:22:00,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:22:00,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:22:00,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:22:00,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:22:00,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:22:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-10-26 22:22:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 22:22:00,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:00,235 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] [2018-10-26 22:22:00,237 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:00,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash -591883500, now seen corresponding path program 1 times [2018-10-26 22:22:00,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:00,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:00,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:00,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:00,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:22:00,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:22:00,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:22:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:22:00,405 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-10-26 22:22:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:00,431 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-10-26 22:22:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:22:00,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-10-26 22:22:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:00,445 INFO L225 Difference]: With dead ends: 105 [2018-10-26 22:22:00,445 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 22:22:00,449 INFO L605 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-10-26 22:22:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 22:22:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-26 22:22:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 22:22:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-26 22:22:00,483 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-10-26 22:22:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:00,484 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-26 22:22:00,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:22:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-26 22:22:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 22:22:00,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:00,486 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-10-26 22:22:00,486 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:00,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 460875127, now seen corresponding path program 1 times [2018-10-26 22:22:00,487 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:00,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:00,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:22:00,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:22:00,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:22:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:22:00,669 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2018-10-26 22:22:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:01,144 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-10-26 22:22:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:22:01,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-26 22:22:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:01,146 INFO L225 Difference]: With dead ends: 109 [2018-10-26 22:22:01,147 INFO L226 Difference]: Without dead ends: 73 [2018-10-26 22:22:01,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:22:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-26 22:22:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2018-10-26 22:22:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 22:22:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-10-26 22:22:01,156 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 23 [2018-10-26 22:22:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:01,156 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-10-26 22:22:01,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:22:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-10-26 22:22:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 22:22:01,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:01,159 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:01,159 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:01,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2070922458, now seen corresponding path program 1 times [2018-10-26 22:22:01,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:01,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:01,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:02,780 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 31 [2018-10-26 22:22:03,060 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2018-10-26 22:22:03,282 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2018-10-26 22:22:03,694 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 19 [2018-10-26 22:22:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:22:03,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:03,929 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:03,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:03,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:04,049 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-10-26 22:22:04,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 22:22:04,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:04,347 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:04,349 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-26 22:22:04,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-10-26 22:22:04,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:04,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:04,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:04,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 22:22:04,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-10-26 22:22:04,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2018-10-26 22:22:04,649 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 18 treesize of output 17 [2018-10-26 22:22:04,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:04,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-10-26 22:22:05,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-10-26 22:22:05,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 17 treesize of output 10 [2018-10-26 22:22:05,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:05,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 8 [2018-10-26 22:22:05,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:05,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-10-26 22:22:05,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:05,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:05,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:05,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2018-10-26 22:22:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:22:05,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:05,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-10-26 22:22:05,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 22:22:05,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 22:22:05,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:22:05,246 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 29 states. [2018-10-26 22:22:06,802 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-10-26 22:22:07,035 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-10-26 22:22:08,471 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-10-26 22:22:08,781 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-10-26 22:22:09,020 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2018-10-26 22:22:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:09,751 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-10-26 22:22:09,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-26 22:22:09,755 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-26 22:22:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:09,757 INFO L225 Difference]: With dead ends: 203 [2018-10-26 22:22:09,757 INFO L226 Difference]: Without dead ends: 142 [2018-10-26 22:22:09,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=770, Invalid=3012, Unknown=0, NotChecked=0, Total=3782 [2018-10-26 22:22:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-26 22:22:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 83. [2018-10-26 22:22:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 22:22:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-10-26 22:22:09,774 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 44 [2018-10-26 22:22:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:09,774 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-10-26 22:22:09,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 22:22:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-10-26 22:22:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 22:22:09,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:09,777 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:09,778 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:09,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 302880947, now seen corresponding path program 2 times [2018-10-26 22:22:09,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:09,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:09,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:10,435 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:22:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:22:10,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:10,476 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:10,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:22:10,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:22:10,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:10,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:22:10,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:10,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-10-26 22:22:10,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:22:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:22:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:22:10,654 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 13 states. [2018-10-26 22:22:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:11,349 INFO L93 Difference]: Finished difference Result 245 states and 256 transitions. [2018-10-26 22:22:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:22:11,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-10-26 22:22:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:11,351 INFO L225 Difference]: With dead ends: 245 [2018-10-26 22:22:11,352 INFO L226 Difference]: Without dead ends: 190 [2018-10-26 22:22:11,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:22:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-26 22:22:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 140. [2018-10-26 22:22:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-26 22:22:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2018-10-26 22:22:11,374 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 72 [2018-10-26 22:22:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:11,375 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2018-10-26 22:22:11,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:22:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2018-10-26 22:22:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-26 22:22:11,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:11,378 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:11,378 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:11,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash -29713602, now seen corresponding path program 1 times [2018-10-26 22:22:11,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:11,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:11,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:22:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:11,924 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-10-26 22:22:13,366 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 31 [2018-10-26 22:22:13,516 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2018-10-26 22:22:13,788 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2018-10-26 22:22:13,953 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2018-10-26 22:22:14,117 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2018-10-26 22:22:14,271 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2018-10-26 22:22:14,437 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 49 [2018-10-26 22:22:14,649 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-10-26 22:22:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:22:14,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:14,973 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:14,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:15,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:15,032 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-10-26 22:22:15,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 22:22:15,083 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:22:15,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-26 22:22:15,174 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:15,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:15,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:15,242 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-10-26 22:22:15,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-26 22:22:15,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-10-26 22:22:15,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 27 treesize of output 33 [2018-10-26 22:22:15,504 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 24 treesize of output 23 [2018-10-26 22:22:15,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-10-26 22:22:15,910 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-10-26 22:22:15,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2018-10-26 22:22:15,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 51 treesize of output 41 [2018-10-26 22:22:15,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:15,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 21 [2018-10-26 22:22:15,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:16,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 11 [2018-10-26 22:22:16,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:16,047 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 39 treesize of output 29 [2018-10-26 22:22:16,048 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-26 22:22:16,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 14 [2018-10-26 22:22:16,079 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:16,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 9 [2018-10-26 22:22:16,083 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:16,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:22:16,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:22:16,128 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:59, output treesize:21 [2018-10-26 22:22:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:22:16,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:16,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2018-10-26 22:22:16,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-26 22:22:16,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-26 22:22:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 22:22:16,246 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand 34 states. [2018-10-26 22:22:18,468 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2018-10-26 22:22:18,642 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2018-10-26 22:22:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:19,238 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-10-26 22:22:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:22:19,239 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2018-10-26 22:22:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:19,240 INFO L225 Difference]: With dead ends: 167 [2018-10-26 22:22:19,241 INFO L226 Difference]: Without dead ends: 114 [2018-10-26 22:22:19,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=470, Invalid=2286, Unknown=0, NotChecked=0, Total=2756 [2018-10-26 22:22:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-26 22:22:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2018-10-26 22:22:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-26 22:22:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-10-26 22:22:19,252 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 74 [2018-10-26 22:22:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:19,253 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-10-26 22:22:19,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-26 22:22:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-10-26 22:22:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:22:19,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:19,254 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2018-10-26 22:22:19,255 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:19,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:19,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2002832634, now seen corresponding path program 3 times [2018-10-26 22:22:19,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:19,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:19,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:19,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:19,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:19,831 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-26 22:22:20,709 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2018-10-26 22:22:21,516 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2018-10-26 22:22:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-26 22:22:21,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:21,634 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:21,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:22:21,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 22:22:21,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:21,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:21,940 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-10-26 22:22:21,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:21,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:21,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:22:22,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:22,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:22,053 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-26 22:22:22,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:22,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:22,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-26 22:22:22,115 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:22,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:22,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:22,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 22:22:22,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:22,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:22,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-10-26 22:22:22,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-10-26 22:22:22,869 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 36 treesize of output 35 [2018-10-26 22:22:22,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:22,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:22,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:22,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-10-26 22:22:23,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-10-26 22:22:23,210 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:23,213 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 52 treesize of output 63 [2018-10-26 22:22:23,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:23,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:23,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:23,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:87 [2018-10-26 22:22:24,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2018-10-26 22:22:24,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:24,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:24,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:24,044 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 73 treesize of output 104 [2018-10-26 22:22:24,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:114, output treesize:110 [2018-10-26 22:22:24,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2018-10-26 22:22:24,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 10 [2018-10-26 22:22:24,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 8 [2018-10-26 22:22:24,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-10-26 22:22:24,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:24,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:5 [2018-10-26 22:22:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:25,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:25,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 33] total 47 [2018-10-26 22:22:25,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-26 22:22:25,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-26 22:22:25,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1866, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:22:25,020 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 47 states. [2018-10-26 22:22:28,602 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-10-26 22:22:28,802 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-10-26 22:22:29,298 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2018-10-26 22:22:29,527 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2018-10-26 22:22:33,748 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 22:22:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:34,486 INFO L93 Difference]: Finished difference Result 453 states and 470 transitions. [2018-10-26 22:22:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-26 22:22:34,487 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 86 [2018-10-26 22:22:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:34,491 INFO L225 Difference]: With dead ends: 453 [2018-10-26 22:22:34,491 INFO L226 Difference]: Without dead ends: 402 [2018-10-26 22:22:34,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6161 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2361, Invalid=15999, Unknown=0, NotChecked=0, Total=18360 [2018-10-26 22:22:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-26 22:22:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 206. [2018-10-26 22:22:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-26 22:22:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-10-26 22:22:34,519 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 86 [2018-10-26 22:22:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:34,519 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-10-26 22:22:34,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-26 22:22:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-10-26 22:22:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 22:22:34,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:34,522 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:34,522 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:34,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:34,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1574955397, now seen corresponding path program 2 times [2018-10-26 22:22:34,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:34,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:34,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:22:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:35,407 WARN L179 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-10-26 22:22:36,034 WARN L179 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-26 22:22:37,785 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2018-10-26 22:22:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 22:22:38,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:38,066 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:22:38,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:22:38,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:38,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:38,120 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-10-26 22:22:38,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 22:22:38,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:38,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:38,159 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-26 22:22:38,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-10-26 22:22:38,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:38,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:38,215 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:38,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 22:22:38,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-10-26 22:22:38,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-10-26 22:22:38,549 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 36 treesize of output 35 [2018-10-26 22:22:38,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-10-26 22:22:38,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-10-26 22:22:38,789 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:38,791 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 46 treesize of output 55 [2018-10-26 22:22:38,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:38,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2018-10-26 22:22:39,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-10-26 22:22:39,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:39,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2018-10-26 22:22:39,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:39,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 10 [2018-10-26 22:22:39,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:39,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 6 [2018-10-26 22:22:39,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:39,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:39,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:39,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:86, output treesize:6 [2018-10-26 22:22:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:22:39,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:39,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2018-10-26 22:22:39,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-26 22:22:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-26 22:22:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1552, Unknown=0, NotChecked=0, Total=1722 [2018-10-26 22:22:39,516 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 42 states. [2018-10-26 22:22:42,783 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-10-26 22:22:42,962 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-10-26 22:22:44,235 WARN L179 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-10-26 22:22:44,417 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2018-10-26 22:22:44,908 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-26 22:22:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:45,978 INFO L93 Difference]: Finished difference Result 314 states and 323 transitions. [2018-10-26 22:22:45,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-26 22:22:45,979 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-10-26 22:22:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:45,980 INFO L225 Difference]: With dead ends: 314 [2018-10-26 22:22:45,980 INFO L226 Difference]: Without dead ends: 238 [2018-10-26 22:22:45,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 77 SyntacticMatches, 17 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1179, Invalid=6303, Unknown=0, NotChecked=0, Total=7482 [2018-10-26 22:22:45,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-26 22:22:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 142. [2018-10-26 22:22:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-26 22:22:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-10-26 22:22:45,996 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 95 [2018-10-26 22:22:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:45,997 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-10-26 22:22:45,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-26 22:22:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-10-26 22:22:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 22:22:45,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:45,999 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 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] [2018-10-26 22:22:46,000 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:46,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1924838217, now seen corresponding path program 4 times [2018-10-26 22:22:46,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:46,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:46,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:22:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-26 22:22:46,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:46,842 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:46,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:22:46,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:22:46,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:46,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-26 22:22:47,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:47,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-10-26 22:22:47,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:22:47,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:22:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:22:47,040 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 17 states. [2018-10-26 22:22:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:48,046 INFO L93 Difference]: Finished difference Result 398 states and 411 transitions. [2018-10-26 22:22:48,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:22:48,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2018-10-26 22:22:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:48,048 INFO L225 Difference]: With dead ends: 398 [2018-10-26 22:22:48,048 INFO L226 Difference]: Without dead ends: 312 [2018-10-26 22:22:48,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:22:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-26 22:22:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 243. [2018-10-26 22:22:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-26 22:22:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 251 transitions. [2018-10-26 22:22:48,071 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 251 transitions. Word has length 121 [2018-10-26 22:22:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:48,071 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 251 transitions. [2018-10-26 22:22:48,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:22:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 251 transitions. [2018-10-26 22:22:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 22:22:48,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:48,074 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:48,074 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:48,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:48,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1130647529, now seen corresponding path program 3 times [2018-10-26 22:22:48,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:48,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:48,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:48,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:22:48,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:49,033 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-26 22:22:49,217 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-26 22:22:49,906 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 29 [2018-10-26 22:22:50,053 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 30 [2018-10-26 22:22:50,236 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 38 [2018-10-26 22:22:50,497 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2018-10-26 22:22:50,652 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2018-10-26 22:22:50,794 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2018-10-26 22:22:50,964 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2018-10-26 22:22:51,383 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2018-10-26 22:22:51,850 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2018-10-26 22:22:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 22:22:52,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:52,175 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:23:05,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:23:05,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:23:05,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:23:05,681 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-10-26 22:23:05,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:05,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:05,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:23:05,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:23:05,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:23:05,692 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-26 22:23:05,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:05,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:05,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-26 22:23:05,736 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:23:05,737 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:23:05,738 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:23:05,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 22:23:05,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:05,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:05,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-10-26 22:23:06,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-10-26 22:23:06,038 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 24 treesize of output 23 [2018-10-26 22:23:06,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:06,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:06,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:06,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-10-26 22:23:08,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-10-26 22:23:08,300 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 58 treesize of output 59 [2018-10-26 22:23:08,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:08,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:08,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:08,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:80 [2018-10-26 22:23:09,067 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-26 22:23:09,650 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-26 22:23:13,946 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 56 [2018-10-26 22:23:14,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-10-26 22:23:14,134 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 46 treesize of output 10 [2018-10-26 22:23:14,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:14,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 8 [2018-10-26 22:23:14,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:14,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-10-26 22:23:14,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:23:14,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:14,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:23:14,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:98, output treesize:5 [2018-10-26 22:23:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 4 proven. 69 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-26 22:23:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:23:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2018-10-26 22:23:14,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-26 22:23:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-26 22:23:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1833, Unknown=2, NotChecked=0, Total=2070 [2018-10-26 22:23:14,342 INFO L87 Difference]: Start difference. First operand 243 states and 251 transitions. Second operand 46 states. [2018-10-26 22:23:18,018 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 71 [2018-10-26 22:23:20,103 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 62 [2018-10-26 22:23:22,457 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2018-10-26 22:23:23,250 WARN L179 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2018-10-26 22:23:25,517 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-10-26 22:23:29,410 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2018-10-26 22:23:38,285 WARN L179 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-10-26 22:23:39,124 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-10-26 22:23:41,500 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-10-26 22:23:41,695 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2018-10-26 22:23:43,897 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-10-26 22:23:44,458 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2018-10-26 22:23:44,806 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-10-26 22:23:53,091 WARN L179 SmtUtils]: Spent 3.53 s on a formula simplification that was a NOOP. DAG size: 66 [2018-10-26 22:23:55,606 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 76 [2018-10-26 22:23:57,935 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 87 [2018-10-26 22:24:00,298 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 90 [2018-10-26 22:24:00,905 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-10-26 22:24:03,524 WARN L179 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-10-26 22:24:04,164 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2018-10-26 22:24:06,743 WARN L179 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-10-26 22:24:06,995 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-10-26 22:24:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:07,472 INFO L93 Difference]: Finished difference Result 298 states and 306 transitions. [2018-10-26 22:24:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-26 22:24:07,473 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 125 [2018-10-26 22:24:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:07,475 INFO L225 Difference]: With dead ends: 298 [2018-10-26 22:24:07,475 INFO L226 Difference]: Without dead ends: 296 [2018-10-26 22:24:07,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 59.8s TimeCoverageRelationStatistics Valid=1008, Invalid=6469, Unknown=5, NotChecked=0, Total=7482 [2018-10-26 22:24:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-26 22:24:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-10-26 22:24:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-26 22:24:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 277 transitions. [2018-10-26 22:24:07,502 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 277 transitions. Word has length 125 [2018-10-26 22:24:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:07,502 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 277 transitions. [2018-10-26 22:24:07,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-26 22:24:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 277 transitions. [2018-10-26 22:24:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 22:24:07,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:07,504 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:24:07,504 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:07,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:07,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609406, now seen corresponding path program 4 times [2018-10-26 22:24:07,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:07,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:07,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:07,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:24:07,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:08,462 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-26 22:24:09,133 WARN L179 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-26 22:24:09,605 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2018-10-26 22:24:10,445 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 31 [2018-10-26 22:24:11,059 WARN L179 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 32 [2018-10-26 22:24:11,266 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2018-10-26 22:24:11,446 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2018-10-26 22:24:11,614 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-10-26 22:24:11,980 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-10-26 22:24:12,492 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2018-10-26 22:24:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-26 22:24:13,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:13,981 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:24:14,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:24:14,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:24:14,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:24:14,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:24:14,082 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-10-26 22:24:14,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 22:24:14,112 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:24:14,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-26 22:24:14,154 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:24:14,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:24:14,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:24:14,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-26 22:24:14,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-10-26 22:24:14,312 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 13 treesize of output 10 [2018-10-26 22:24:14,313 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-10-26 22:24:14,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2018-10-26 22:24:14,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-26 22:24:14,330 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 16 treesize of output 15 [2018-10-26 22:24:14,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-26 22:24:14,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-26 22:24:14,370 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 16 treesize of output 15 [2018-10-26 22:24:14,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-26 22:24:14,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-26 22:24:14,391 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 16 treesize of output 15 [2018-10-26 22:24:14,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-26 22:24:14,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 27 treesize of output 33 [2018-10-26 22:24:14,514 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 24 treesize of output 23 [2018-10-26 22:24:14,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-10-26 22:24:14,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2018-10-26 22:24:14,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 47 treesize of output 59 [2018-10-26 22:24:14,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 43 treesize of output 33 [2018-10-26 22:24:14,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:14,961 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 28 treesize of output 18 [2018-10-26 22:24:14,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 22:24:14,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 22 [2018-10-26 22:24:14,986 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:15,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 10 [2018-10-26 22:24:15,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:24:15,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:24:15,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:24:15,051 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:59, output treesize:15 [2018-10-26 22:24:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:24:15,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:24:15,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 43 [2018-10-26 22:24:15,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 22:24:15,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 22:24:15,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1643, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:24:15,182 INFO L87 Difference]: Start difference. First operand 268 states and 277 transitions. Second operand 43 states. [2018-10-26 22:24:19,164 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-10-26 22:24:19,365 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-10-26 22:24:19,590 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2018-10-26 22:24:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:24:19,990 INFO L93 Difference]: Finished difference Result 287 states and 293 transitions. [2018-10-26 22:24:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 22:24:19,991 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 134 [2018-10-26 22:24:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:24:19,992 INFO L225 Difference]: With dead ends: 287 [2018-10-26 22:24:19,992 INFO L226 Difference]: Without dead ends: 188 [2018-10-26 22:24:19,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 118 SyntacticMatches, 16 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=699, Invalid=4413, Unknown=0, NotChecked=0, Total=5112 [2018-10-26 22:24:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-26 22:24:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2018-10-26 22:24:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-26 22:24:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-10-26 22:24:20,012 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 134 [2018-10-26 22:24:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:24:20,012 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-10-26 22:24:20,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 22:24:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-10-26 22:24:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 22:24:20,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:24:20,013 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 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] [2018-10-26 22:24:20,013 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:24:20,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:24:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 388520720, now seen corresponding path program 5 times [2018-10-26 22:24:20,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:24:20,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:24:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:20,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:24:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:24:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:24:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 37 proven. 160 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 22:24:21,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:24:21,022 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:24:21,030 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:25:10,033 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-26 22:25:10,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:25:10,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:25:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 37 proven. 160 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 22:25:10,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:25:10,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-10-26 22:25:10,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 22:25:10,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 22:25:10,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:25:10,244 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 20 states. [2018-10-26 22:25:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:25:11,784 INFO L93 Difference]: Finished difference Result 458 states and 471 transitions. [2018-10-26 22:25:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:25:11,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 135 [2018-10-26 22:25:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:25:11,786 INFO L225 Difference]: With dead ends: 458 [2018-10-26 22:25:11,786 INFO L226 Difference]: Without dead ends: 357 [2018-10-26 22:25:11,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:25:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-26 22:25:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 297. [2018-10-26 22:25:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-26 22:25:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 307 transitions. [2018-10-26 22:25:11,820 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 307 transitions. Word has length 135 [2018-10-26 22:25:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:25:11,820 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 307 transitions. [2018-10-26 22:25:11,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 22:25:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 307 transitions. [2018-10-26 22:25:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 22:25:11,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:25:11,822 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:25:11,822 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:25:11,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:25:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 665729627, now seen corresponding path program 5 times [2018-10-26 22:25:11,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:25:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:25:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:25:11,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:25:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:25:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:25:12,629 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-26 22:25:13,075 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-26 22:25:13,395 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 38 [2018-10-26 22:25:13,544 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2018-10-26 22:25:13,690 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2018-10-26 22:25:13,824 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-10-26 22:25:14,087 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-10-26 22:25:17,532 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-10-26 22:25:17,925 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2018-10-26 22:25:18,071 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 37 [2018-10-26 22:25:18,267 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2018-10-26 22:25:18,464 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2018-10-26 22:25:18,657 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2018-10-26 22:25:18,851 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 46 [2018-10-26 22:25:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 22:25:21,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:25:21,227 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:25:21,234 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:26:10,322 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-26 22:26:10,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:26:10,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:26:10,550 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-10-26 22:26:10,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:26:10,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:10,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:10,564 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-26 22:26:10,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-26 22:26:10,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:10,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:10,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:10,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 22:26:10,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-10-26 22:26:10,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-26 22:26:10,867 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-10-26 22:26:10,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-10-26 22:26:10,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-26 22:26:10,893 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 14 treesize of output 13 [2018-10-26 22:26:10,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-26 22:26:10,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-26 22:26:10,961 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 14 treesize of output 13 [2018-10-26 22:26:10,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-26 22:26:10,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-26 22:26:10,996 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 14 treesize of output 13 [2018-10-26 22:26:10,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:10,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-26 22:26:11,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-26 22:26:11,021 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 14 treesize of output 13 [2018-10-26 22:26:11,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-26 22:26:11,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-26 22:26:11,047 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-10-26 22:26:11,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-10-26 22:26:11,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-26 22:26:11,071 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 16 treesize of output 15 [2018-10-26 22:26:11,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-10-26 22:26:11,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-10-26 22:26:11,236 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 36 treesize of output 35 [2018-10-26 22:26:11,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2018-10-26 22:26:11,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-10-26 22:26:11,417 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:11,419 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 38 treesize of output 51 [2018-10-26 22:26:11,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:48 [2018-10-26 22:26:11,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-10-26 22:26:11,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:11,720 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 58 treesize of output 71 [2018-10-26 22:26:11,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:11,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:83 [2018-10-26 22:26:12,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 79 [2018-10-26 22:26:12,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:12,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:12,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:26:12,140 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 67 treesize of output 94 [2018-10-26 22:26:12,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:91 [2018-10-26 22:26:12,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2018-10-26 22:26:12,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 10 [2018-10-26 22:26:12,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 8 [2018-10-26 22:26:12,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-10-26 22:26:12,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:26:12,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:5 [2018-10-26 22:26:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:26:13,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:26:13,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 48 [2018-10-26 22:26:13,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-26 22:26:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-26 22:26:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2004, Unknown=1, NotChecked=0, Total=2256 [2018-10-26 22:26:13,091 INFO L87 Difference]: Start difference. First operand 297 states and 307 transitions. Second operand 48 states. [2018-10-26 22:26:16,193 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-10-26 22:26:18,639 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-10-26 22:26:18,816 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-10-26 22:26:19,003 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-10-26 22:26:19,989 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 22:26:21,000 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 22:26:21,368 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-10-26 22:26:21,546 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2018-10-26 22:26:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:26:23,192 INFO L93 Difference]: Finished difference Result 411 states and 420 transitions. [2018-10-26 22:26:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-26 22:26:23,192 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 137 [2018-10-26 22:26:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:26:23,193 INFO L225 Difference]: With dead ends: 411 [2018-10-26 22:26:23,193 INFO L226 Difference]: Without dead ends: 289 [2018-10-26 22:26:23,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 111 SyntacticMatches, 16 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4701 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1731, Invalid=12788, Unknown=1, NotChecked=0, Total=14520 [2018-10-26 22:26:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-26 22:26:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 201. [2018-10-26 22:26:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-26 22:26:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 208 transitions. [2018-10-26 22:26:23,217 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 208 transitions. Word has length 137 [2018-10-26 22:26:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:26:23,217 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 208 transitions. [2018-10-26 22:26:23,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-26 22:26:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 208 transitions. [2018-10-26 22:26:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 22:26:23,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:26:23,218 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:26:23,219 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:26:23,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:26:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1925939095, now seen corresponding path program 6 times [2018-10-26 22:26:23,219 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:26:23,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:26:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:26:23,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:26:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:26:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-26 22:26:23,433 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$0(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:130) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 22:26:23,440 INFO L168 Benchmark]: Toolchain (without parser) took 264342.44 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -695.1 MB). Peak memory consumption was 421.7 MB. Max. memory is 7.1 GB. [2018-10-26 22:26:23,440 INFO L168 Benchmark]: CDTParser took 0.22 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-10-26 22:26:23,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.01 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-10-26 22:26:23,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.99 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-10-26 22:26:23,441 INFO L168 Benchmark]: Boogie Preprocessor took 29.58 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-10-26 22:26:23,441 INFO L168 Benchmark]: RCFGBuilder took 663.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2018-10-26 22:26:23,442 INFO L168 Benchmark]: TraceAbstraction took 263304.53 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 379.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 71.4 MB). Peak memory consumption was 451.0 MB. Max. memory is 7.1 GB. [2018-10-26 22:26:23,445 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.22 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 299.01 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 41.99 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 29.58 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 663.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263304.53 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 379.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 71.4 MB). Peak memory consumption was 451.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown