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/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:17:39,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:17:39,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:17:39,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:17:39,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:17:39,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:17:39,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:17:39,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:17:39,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:17:39,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:17:39,354 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:17:39,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:17:39,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:17:39,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:17:39,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:17:39,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:17:39,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:17:39,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:17:39,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:17:39,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:17:39,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:17:39,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:17:39,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:17:39,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:17:39,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:17:39,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:17:39,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:17:39,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:17:39,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:17:39,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:17:39,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:17:39,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:17:39,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:17:39,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:17:39,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:17:39,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:17:39,393 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:17:39,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:17:39,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:17:39,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:17:39,422 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:17:39,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:17:39,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:17:39,425 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:17:39,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:17:39,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:17:39,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:17:39,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:17:39,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:17:39,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:17:39,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:17:39,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:17:39,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:17:39,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:17:39,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:17:39,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:17:39,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:17:39,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:17:39,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:17:39,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:17:39,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:17:39,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:17:39,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:17:39,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:17:39,431 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 22:17:39,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:17:39,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:17:39,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:17:39,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:17:39,493 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:17:39,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-26 22:17:39,562 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7ebe8675d/b282c2de90ef45de8308fe7f2c368eeb/FLAGad08cf530 [2018-10-26 22:17:40,018 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:17:40,018 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-26 22:17:40,026 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7ebe8675d/b282c2de90ef45de8308fe7f2c368eeb/FLAGad08cf530 [2018-10-26 22:17:40,045 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7ebe8675d/b282c2de90ef45de8308fe7f2c368eeb [2018-10-26 22:17:40,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:17:40,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:17:40,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:17:40,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:17:40,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:17:40,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405e6276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40, skipping insertion in model container [2018-10-26 22:17:40,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:17:40,109 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:17:40,365 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:17:40,370 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:17:40,402 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:17:40,424 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:17:40,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40 WrapperNode [2018-10-26 22:17:40,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:17:40,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:17:40,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:17:40,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:17:40,433 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:17:40" (1/1) ... [2018-10-26 22:17:40,443 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:17:40" (1/1) ... [2018-10-26 22:17:40,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:17:40,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:17:40,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:17:40,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:17:40,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (1/1) ... [2018-10-26 22:17:40,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:17:40,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:17:40,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:17:40,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:17:40,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (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:17:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 22:17:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:17:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:17:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 22:17:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 22:17:41,053 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:17:41,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:17:41 BoogieIcfgContainer [2018-10-26 22:17:41,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:17:41,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:17:41,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:17:41,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:17:41,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:17:40" (1/3) ... [2018-10-26 22:17:41,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204e91c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:17:41, skipping insertion in model container [2018-10-26 22:17:41,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:40" (2/3) ... [2018-10-26 22:17:41,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204e91c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:17:41, skipping insertion in model container [2018-10-26 22:17:41,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:17:41" (3/3) ... [2018-10-26 22:17:41,062 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-26 22:17:41,072 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:17:41,081 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:17:41,099 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:17:41,133 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:17:41,134 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:17:41,135 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:17:41,135 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:17:41,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:17:41,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:17:41,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:17:41,135 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:17:41,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:17:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-26 22:17:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-26 22:17:41,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:41,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:17:41,161 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:41,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash -44354441, now seen corresponding path program 1 times [2018-10-26 22:17:41,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:41,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:41,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:41,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:41,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:41,303 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:17:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:17:41,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:17:41,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:17:41,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:17:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:17:41,326 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-10-26 22:17:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:41,347 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-10-26 22:17:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:17:41,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-26 22:17:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:41,360 INFO L225 Difference]: With dead ends: 70 [2018-10-26 22:17:41,360 INFO L226 Difference]: Without dead ends: 30 [2018-10-26 22:17:41,365 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:17:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-26 22:17:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-26 22:17:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-26 22:17:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-26 22:17:41,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2018-10-26 22:17:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:41,411 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-26 22:17:41,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:17:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-26 22:17:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 22:17:41,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:41,414 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:17:41,414 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:41,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash 539359342, now seen corresponding path program 1 times [2018-10-26 22:17:41,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:41,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:41,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:41,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:41,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:41,706 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:17:41,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:17:41,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:17:41,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:17:41,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:17:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:17:41,710 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-10-26 22:17:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:41,989 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-26 22:17:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:17:41,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-26 22:17:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:41,991 INFO L225 Difference]: With dead ends: 60 [2018-10-26 22:17:41,991 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 22:17:41,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:17:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 22:17:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-26 22:17:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-26 22:17:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-10-26 22:17:41,999 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 12 [2018-10-26 22:17:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:42,000 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-10-26 22:17:42,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:17:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-10-26 22:17:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 22:17:42,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:42,001 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:17:42,001 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:42,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:42,002 INFO L82 PathProgramCache]: Analyzing trace with hash -713539364, now seen corresponding path program 1 times [2018-10-26 22:17:42,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:42,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:42,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:42,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:42,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:42,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:17:42,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:17:42,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:17:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:17:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:17:42,149 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2018-10-26 22:17:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:42,485 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-10-26 22:17:42,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:17:42,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-26 22:17:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:42,488 INFO L225 Difference]: With dead ends: 88 [2018-10-26 22:17:42,488 INFO L226 Difference]: Without dead ends: 60 [2018-10-26 22:17:42,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:17:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-26 22:17:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-10-26 22:17:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-26 22:17:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-26 22:17:42,496 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-10-26 22:17:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:42,496 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-26 22:17:42,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:17:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-26 22:17:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 22:17:42,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:42,498 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:17:42,498 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:42,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 199031775, now seen corresponding path program 1 times [2018-10-26 22:17:42,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:42,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:42,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:43,082 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-10-26 22:17:43,690 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-26 22:17:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:43,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:43,837 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:17:43,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:43,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:44,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:17:44,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:44,420 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 23 treesize of output 37 [2018-10-26 22:17:44,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:44,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:44,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:17:44,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-26 22:17:44,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-26 22:17:44,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:44,775 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:44,777 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:17:44,778 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:17:44,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-26 22:17:44,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:44,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:44,803 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:17:44,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-26 22:17:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:44,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:17:44,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-10-26 22:17:44,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:17:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:17:44,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:17:44,868 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-10-26 22:17:45,360 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-26 22:17:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:46,456 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2018-10-26 22:17:46,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 22:17:46,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-10-26 22:17:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:46,462 INFO L225 Difference]: With dead ends: 144 [2018-10-26 22:17:46,462 INFO L226 Difference]: Without dead ends: 113 [2018-10-26 22:17:46,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 22:17:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-26 22:17:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2018-10-26 22:17:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-26 22:17:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-10-26 22:17:46,476 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 24 [2018-10-26 22:17:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:46,476 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-10-26 22:17:46,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:17:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-10-26 22:17:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 22:17:46,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:46,478 INFO L375 BasicCegarLoop]: trace histogram [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:17:46,478 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:46,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash 739171567, now seen corresponding path program 1 times [2018-10-26 22:17:46,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:46,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:46,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:46,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:46,664 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:17:46,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:46,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:46,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:17:46,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-26 22:17:46,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:17:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:17:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:17:46,796 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 8 states. [2018-10-26 22:17:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:47,024 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-10-26 22:17:47,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:17:47,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-26 22:17:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:47,026 INFO L225 Difference]: With dead ends: 108 [2018-10-26 22:17:47,026 INFO L226 Difference]: Without dead ends: 87 [2018-10-26 22:17:47,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:17:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-26 22:17:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2018-10-26 22:17:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-26 22:17:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-10-26 22:17:47,036 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2018-10-26 22:17:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:47,037 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-10-26 22:17:47,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:17:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-10-26 22:17:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 22:17:47,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:47,038 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] [2018-10-26 22:17:47,039 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:47,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 20598919, now seen corresponding path program 1 times [2018-10-26 22:17:47,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:47,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:47,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:47,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:48,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:48,004 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:17:48,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:48,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:48,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:17:48,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:48,368 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 34 treesize of output 50 [2018-10-26 22:17:48,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:48,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:48,392 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:17:48,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-26 22:17:48,922 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:48,923 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 50 treesize of output 52 [2018-10-26 22:17:48,927 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:48,928 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:17:48,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:48,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 71 [2018-10-26 22:17:48,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:48,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:48,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:17:48,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-26 22:17:49,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-26 22:17:49,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:49,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:49,322 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:17:49,322 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:17:49,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:49,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-10-26 22:17:49,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:49,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:49,340 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:17:49,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-26 22:17:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:49,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:17:49,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-10-26 22:17:49,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-26 22:17:49,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-26 22:17:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:17:49,397 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 33 states. [2018-10-26 22:17:50,361 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-10-26 22:17:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:51,370 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2018-10-26 22:17:51,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 22:17:51,371 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-10-26 22:17:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:51,373 INFO L225 Difference]: With dead ends: 143 [2018-10-26 22:17:51,373 INFO L226 Difference]: Without dead ends: 78 [2018-10-26 22:17:51,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=334, Invalid=2018, Unknown=0, NotChecked=0, Total=2352 [2018-10-26 22:17:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-26 22:17:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2018-10-26 22:17:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-26 22:17:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-26 22:17:51,384 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 33 [2018-10-26 22:17:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:51,384 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-26 22:17:51,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-26 22:17:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-10-26 22:17:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:17:51,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:51,385 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:17:51,386 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:51,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -302162480, now seen corresponding path program 2 times [2018-10-26 22:17:51,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:51,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:51,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:51,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:51,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:52,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:52,101 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:17:52,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:17:52,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:17:52,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:17:52,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:52,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:17:52,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:52,402 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 23 treesize of output 37 [2018-10-26 22:17:52,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,419 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:17:52,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-26 22:17:52,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-26 22:17:52,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:52,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:52,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:52,625 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 25 treesize of output 58 [2018-10-26 22:17:52,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:17:52,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-26 22:17:52,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 22:17:52,835 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 22:17:52,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,842 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:17:52,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-26 22:17:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:52,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:17:52,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 21 [2018-10-26 22:17:52,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 22:17:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 22:17:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-26 22:17:52,882 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2018-10-26 22:17:54,224 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-10-26 22:17:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:54,402 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2018-10-26 22:17:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 22:17:54,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-10-26 22:17:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:54,406 INFO L225 Difference]: With dead ends: 196 [2018-10-26 22:17:54,406 INFO L226 Difference]: Without dead ends: 165 [2018-10-26 22:17:54,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2018-10-26 22:17:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-26 22:17:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 88. [2018-10-26 22:17:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-26 22:17:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-10-26 22:17:54,419 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 36 [2018-10-26 22:17:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:54,419 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-10-26 22:17:54,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 22:17:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-10-26 22:17:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 22:17:54,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:54,421 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:17:54,421 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:54,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:54,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1890237920, now seen corresponding path program 2 times [2018-10-26 22:17:54,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:54,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:54,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:17:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:55,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:55,059 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:17:55,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:17:55,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:17:55,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:17:55,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:55,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 22:17:55,496 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:55,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:17:55,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:55,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:55,514 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:17:55,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-26 22:17:55,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 22:17:55,689 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 22:17:55,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:55,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:55,694 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:17:55,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-26 22:17:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:55,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:17:55,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-10-26 22:17:55,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 22:17:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 22:17:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:17:55,741 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 29 states. [2018-10-26 22:17:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:57,419 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2018-10-26 22:17:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 22:17:57,419 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-26 22:17:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:57,421 INFO L225 Difference]: With dead ends: 224 [2018-10-26 22:17:57,421 INFO L226 Difference]: Without dead ends: 193 [2018-10-26 22:17:57,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=277, Invalid=1703, Unknown=0, NotChecked=0, Total=1980 [2018-10-26 22:17:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-26 22:17:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 120. [2018-10-26 22:17:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-26 22:17:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-10-26 22:17:57,440 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 44 [2018-10-26 22:17:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:57,440 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-10-26 22:17:57,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 22:17:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-10-26 22:17:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:17:57,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:57,443 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:17:57,444 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:57,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1140389496, now seen corresponding path program 2 times [2018-10-26 22:17:57,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:17:57,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:17:57,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:57,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:17:57,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:58,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:58,624 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:17:58,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:17:58,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:17:58,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:17:58,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:58,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:17:58,893 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:17:58,894 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:58,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 61 [2018-10-26 22:17:58,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:58,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:58,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:58,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:49 [2018-10-26 22:17:59,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,102 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 51 treesize of output 53 [2018-10-26 22:17:59,105 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,105 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:17:59,108 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 71 [2018-10-26 22:17:59,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:59,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:59,134 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:17:59,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2018-10-26 22:17:59,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-26 22:17:59,220 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-26 22:17:59,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:59,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:59,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:17:59,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-10-26 22:17:59,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-26 22:17:59,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:17:59,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 22:17:59,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:59,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:59,338 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:17:59,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-26 22:17:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:59,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:17:59,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 31 [2018-10-26 22:17:59,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-26 22:17:59,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-26 22:17:59,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-10-26 22:17:59,386 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 31 states. [2018-10-26 22:18:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:01,324 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-10-26 22:18:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-26 22:18:01,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-26 22:18:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:01,328 INFO L225 Difference]: With dead ends: 209 [2018-10-26 22:18:01,328 INFO L226 Difference]: Without dead ends: 207 [2018-10-26 22:18:01,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=412, Invalid=2780, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 22:18:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-26 22:18:01,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 97. [2018-10-26 22:18:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-26 22:18:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-10-26 22:18:01,347 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 45 [2018-10-26 22:18:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:01,347 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-10-26 22:18:01,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-26 22:18:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-10-26 22:18:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:18:01,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:01,349 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:01,349 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:01,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1343917494, now seen corresponding path program 3 times [2018-10-26 22:18:01,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:01,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:01,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:01,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:01,789 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:18:01,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:18:01,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:18:01,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:01,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:01,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:01,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-26 22:18:01,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:18:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:18:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:18:01,916 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 7 states. [2018-10-26 22:18:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:02,150 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2018-10-26 22:18:02,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:18:02,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-26 22:18:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:02,153 INFO L225 Difference]: With dead ends: 187 [2018-10-26 22:18:02,154 INFO L226 Difference]: Without dead ends: 156 [2018-10-26 22:18:02,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:18:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-26 22:18:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 108. [2018-10-26 22:18:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-26 22:18:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-10-26 22:18:02,168 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 45 [2018-10-26 22:18:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:02,168 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-10-26 22:18:02,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:18:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-10-26 22:18:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 22:18:02,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:02,169 INFO L375 BasicCegarLoop]: trace histogram [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:18:02,170 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:02,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1730116153, now seen corresponding path program 1 times [2018-10-26 22:18:02,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:02,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:02,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:02,884 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:18:02,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:02,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:03,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:18:03,250 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:03,252 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 23 treesize of output 37 [2018-10-26 22:18:03,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:03,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:03,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:03,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-26 22:18:03,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-26 22:18:03,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:03,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:03,427 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:03,428 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:03,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-26 22:18:03,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:03,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:03,447 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:18:03,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-26 22:18:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:03,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:03,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-10-26 22:18:03,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-26 22:18:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-26 22:18:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-10-26 22:18:03,485 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 28 states. [2018-10-26 22:18:04,399 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2018-10-26 22:18:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:05,376 INFO L93 Difference]: Finished difference Result 287 states and 319 transitions. [2018-10-26 22:18:05,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-26 22:18:05,376 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-10-26 22:18:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:05,378 INFO L225 Difference]: With dead ends: 287 [2018-10-26 22:18:05,378 INFO L226 Difference]: Without dead ends: 245 [2018-10-26 22:18:05,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=684, Invalid=2622, Unknown=0, NotChecked=0, Total=3306 [2018-10-26 22:18:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-26 22:18:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 121. [2018-10-26 22:18:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-26 22:18:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-10-26 22:18:05,407 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 47 [2018-10-26 22:18:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:05,408 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-10-26 22:18:05,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-26 22:18:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-10-26 22:18:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 22:18:05,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:05,409 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:05,409 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:05,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash -465629712, now seen corresponding path program 3 times [2018-10-26 22:18:05,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:05,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:05,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:05,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:05,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:05,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:05,928 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:18:05,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:18:05,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:18:05,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:05,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:06,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:06,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-10-26 22:18:06,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:18:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:18:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:18:06,103 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 11 states. [2018-10-26 22:18:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:06,679 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2018-10-26 22:18:06,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:18:06,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-26 22:18:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:06,680 INFO L225 Difference]: With dead ends: 244 [2018-10-26 22:18:06,680 INFO L226 Difference]: Without dead ends: 215 [2018-10-26 22:18:06,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:18:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-26 22:18:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 161. [2018-10-26 22:18:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-26 22:18:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2018-10-26 22:18:06,697 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 52 [2018-10-26 22:18:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:06,697 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2018-10-26 22:18:06,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:18:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2018-10-26 22:18:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 22:18:06,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:06,698 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-10-26 22:18:06,699 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:06,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash -201170615, now seen corresponding path program 1 times [2018-10-26 22:18:06,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:06,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:06,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:07,332 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 22:18:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:08,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:08,028 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:18:08,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:08,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:08,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:18:08,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:08,326 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 34 treesize of output 50 [2018-10-26 22:18:08,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:08,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:08,348 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:18:08,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-26 22:18:08,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:08,547 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 50 treesize of output 52 [2018-10-26 22:18:08,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:08,585 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:08,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:08,660 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-10-26 22:18:08,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 71 [2018-10-26 22:18:08,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:08,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:08,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:08,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-26 22:18:08,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-26 22:18:08,930 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:08,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:08,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:08,932 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:08,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:08,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-26 22:18:08,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:08,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:08,943 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:18:08,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-26 22:18:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2018-10-26 22:18:09,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-26 22:18:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-26 22:18:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:18:09,005 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand 33 states. [2018-10-26 22:18:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:10,292 INFO L93 Difference]: Finished difference Result 207 states and 230 transitions. [2018-10-26 22:18:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 22:18:10,292 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-10-26 22:18:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:10,294 INFO L225 Difference]: With dead ends: 207 [2018-10-26 22:18:10,294 INFO L226 Difference]: Without dead ends: 190 [2018-10-26 22:18:10,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2018-10-26 22:18:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-26 22:18:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154. [2018-10-26 22:18:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-26 22:18:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2018-10-26 22:18:10,312 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 55 [2018-10-26 22:18:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:10,312 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2018-10-26 22:18:10,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-26 22:18:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2018-10-26 22:18:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:18:10,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:10,313 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-10-26 22:18:10,313 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:10,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash 934762349, now seen corresponding path program 4 times [2018-10-26 22:18:10,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:10,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:10,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:10,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:10,737 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-26 22:18:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:11,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:11,267 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:11,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:18:11,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:18:11,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:11,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:11,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:18:11,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,484 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 34 treesize of output 50 [2018-10-26 22:18:11,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:11,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:11,505 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:18:11,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-26 22:18:11,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,679 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 50 treesize of output 52 [2018-10-26 22:18:11,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,696 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:11,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 85 [2018-10-26 22:18:11,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:11,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:11,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:11,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-26 22:18:11,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-26 22:18:11,857 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:11,858 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,859 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,859 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:11,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:11,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-10-26 22:18:11,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:11,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:11,887 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:18:11,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-26 22:18:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 22:18:11,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:11,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-10-26 22:18:11,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-26 22:18:11,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-26 22:18:11,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 22:18:11,958 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 35 states. [2018-10-26 22:18:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:13,857 INFO L93 Difference]: Finished difference Result 366 states and 408 transitions. [2018-10-26 22:18:13,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-26 22:18:13,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2018-10-26 22:18:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:13,859 INFO L225 Difference]: With dead ends: 366 [2018-10-26 22:18:13,859 INFO L226 Difference]: Without dead ends: 269 [2018-10-26 22:18:13,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=614, Invalid=3292, Unknown=0, NotChecked=0, Total=3906 [2018-10-26 22:18:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-26 22:18:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 163. [2018-10-26 22:18:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-26 22:18:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2018-10-26 22:18:13,883 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 56 [2018-10-26 22:18:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:13,883 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2018-10-26 22:18:13,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-26 22:18:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2018-10-26 22:18:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:18:13,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:13,884 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:13,885 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:13,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1582841106, now seen corresponding path program 1 times [2018-10-26 22:18:13,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:13,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:13,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:13,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:13,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:14,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:14,890 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:14,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:14,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:15,178 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:15,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-10-26 22:18:15,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,203 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:15,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-10-26 22:18:15,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:15,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:38 [2018-10-26 22:18:15,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-26 22:18:15,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,297 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 20 treesize of output 43 [2018-10-26 22:18:15,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,314 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:18:15,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-10-26 22:18:15,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-26 22:18:15,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:15,381 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 25 treesize of output 58 [2018-10-26 22:18:15,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,399 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:18:15,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-26 22:18:15,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 22:18:15,690 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 22:18:15,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:15,693 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:18:15,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-26 22:18:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:18:15,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:15,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 29 [2018-10-26 22:18:15,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 22:18:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 22:18:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:18:15,744 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand 29 states. [2018-10-26 22:18:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:17,116 INFO L93 Difference]: Finished difference Result 380 states and 419 transitions. [2018-10-26 22:18:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 22:18:17,117 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-26 22:18:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:17,119 INFO L225 Difference]: With dead ends: 380 [2018-10-26 22:18:17,119 INFO L226 Difference]: Without dead ends: 309 [2018-10-26 22:18:17,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2018-10-26 22:18:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-26 22:18:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 200. [2018-10-26 22:18:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-26 22:18:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-10-26 22:18:17,143 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 56 [2018-10-26 22:18:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:17,144 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-10-26 22:18:17,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 22:18:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-10-26 22:18:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:18:17,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:17,144 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:17,145 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:17,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash -741360303, now seen corresponding path program 4 times [2018-10-26 22:18:17,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:17,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:17,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:17,625 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 5 [2018-10-26 22:18:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:18,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:18,171 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:18:18,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:18:18,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:18,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:18,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:18:18,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:18:18,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,431 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:18:18,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 22:18:18,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:18:18,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:18,650 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 23 treesize of output 37 [2018-10-26 22:18:18,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,668 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:18:18,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-26 22:18:18,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-26 22:18:18,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:18,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:18,772 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:18,778 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 25 treesize of output 58 [2018-10-26 22:18:18,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,797 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:18:18,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-26 22:18:18,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 22:18:18,978 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 22:18:18,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:18,981 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:18:18,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-26 22:18:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:19,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:19,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-10-26 22:18:19,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-26 22:18:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-26 22:18:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 22:18:19,037 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 36 states. [2018-10-26 22:18:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:20,406 INFO L93 Difference]: Finished difference Result 348 states and 385 transitions. [2018-10-26 22:18:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 22:18:20,407 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-10-26 22:18:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:20,409 INFO L225 Difference]: With dead ends: 348 [2018-10-26 22:18:20,409 INFO L226 Difference]: Without dead ends: 277 [2018-10-26 22:18:20,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=2049, Unknown=0, NotChecked=0, Total=2352 [2018-10-26 22:18:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-26 22:18:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 222. [2018-10-26 22:18:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-26 22:18:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2018-10-26 22:18:20,439 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 56 [2018-10-26 22:18:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:20,439 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2018-10-26 22:18:20,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-26 22:18:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2018-10-26 22:18:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 22:18:20,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:20,440 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:20,441 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:20,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash -847043286, now seen corresponding path program 2 times [2018-10-26 22:18:20,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:20,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:20,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:21,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:21,127 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:18:21,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:18:21,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:21,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:21,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-26 22:18:21,443 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:21,445 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 24 treesize of output 39 [2018-10-26 22:18:21,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:21,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:21,462 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:18:21,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-26 22:18:21,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-26 22:18:21,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:21,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:21,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:21,630 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 25 treesize of output 58 [2018-10-26 22:18:21,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:21,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:21,653 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:18:21,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:19 [2018-10-26 22:18:21,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 22:18:21,716 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 22:18:21,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:21,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:21,718 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:18:21,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-26 22:18:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:21,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:21,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-10-26 22:18:21,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 22:18:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 22:18:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:18:21,771 INFO L87 Difference]: Start difference. First operand 222 states and 244 transitions. Second operand 29 states. [2018-10-26 22:18:24,588 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-26 22:18:25,744 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-10-26 22:18:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:27,094 INFO L93 Difference]: Finished difference Result 450 states and 494 transitions. [2018-10-26 22:18:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-26 22:18:27,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2018-10-26 22:18:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:27,096 INFO L225 Difference]: With dead ends: 450 [2018-10-26 22:18:27,096 INFO L226 Difference]: Without dead ends: 379 [2018-10-26 22:18:27,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=766, Invalid=3926, Unknown=0, NotChecked=0, Total=4692 [2018-10-26 22:18:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-26 22:18:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 222. [2018-10-26 22:18:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-26 22:18:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2018-10-26 22:18:27,126 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 59 [2018-10-26 22:18:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:27,126 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2018-10-26 22:18:27,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 22:18:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2018-10-26 22:18:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 22:18:27,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:27,128 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:27,128 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:27,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1867762301, now seen corresponding path program 1 times [2018-10-26 22:18:27,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:27,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:27,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:27,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:27,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:29,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:29,154 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:29,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:29,554 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 22:18:29,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:18:29,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:29,643 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 23 treesize of output 37 [2018-10-26 22:18:29,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:29,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:29,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:29,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-26 22:18:30,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-26 22:18:30,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:30,659 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:30,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:30,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:30,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 97 [2018-10-26 22:18:30,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:30,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:30,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:30,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:51 [2018-10-26 22:18:31,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-10-26 22:18:31,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,112 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,114 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,114 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:31,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,116 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:31,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 115 [2018-10-26 22:18:31,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:31,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:31,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:31,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:44 [2018-10-26 22:18:31,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-10-26 22:18:31,423 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-10-26 22:18:31,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:18:31,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:18:31,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-26 22:18:31,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-10-26 22:18:31,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-26 22:18:31,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:31,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:31,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-26 22:18:31,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:31,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:31,891 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:18:31,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-10-26 22:18:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:31,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:31,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 56 [2018-10-26 22:18:31,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-26 22:18:31,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-26 22:18:31,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2840, Unknown=0, NotChecked=0, Total=3080 [2018-10-26 22:18:31,982 INFO L87 Difference]: Start difference. First operand 222 states and 244 transitions. Second operand 56 states. [2018-10-26 22:18:32,893 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 11 [2018-10-26 22:18:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:35,608 INFO L93 Difference]: Finished difference Result 303 states and 330 transitions. [2018-10-26 22:18:35,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-26 22:18:35,608 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 64 [2018-10-26 22:18:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:35,609 INFO L225 Difference]: With dead ends: 303 [2018-10-26 22:18:35,609 INFO L226 Difference]: Without dead ends: 286 [2018-10-26 22:18:35,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=718, Invalid=6764, Unknown=0, NotChecked=0, Total=7482 [2018-10-26 22:18:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-26 22:18:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 246. [2018-10-26 22:18:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-26 22:18:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2018-10-26 22:18:35,644 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 64 [2018-10-26 22:18:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:35,644 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2018-10-26 22:18:35,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-26 22:18:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2018-10-26 22:18:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 22:18:35,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:35,646 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:35,646 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:35,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash 975512830, now seen corresponding path program 1 times [2018-10-26 22:18:35,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:35,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:35,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:35,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:35,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:35,935 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-26 22:18:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:36,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:36,753 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:36,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:36,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 22:18:36,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:36,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:18:36,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:36,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:36,914 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:18:36,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-26 22:18:37,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-26 22:18:37,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:37,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:37,017 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:37,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-26 22:18:37,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:37,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:37,026 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:18:37,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-26 22:18:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:37,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:37,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 24 [2018-10-26 22:18:37,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-26 22:18:37,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-26 22:18:37,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-10-26 22:18:37,070 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand 24 states. [2018-10-26 22:18:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:38,908 INFO L93 Difference]: Finished difference Result 671 states and 740 transitions. [2018-10-26 22:18:38,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-26 22:18:38,908 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-10-26 22:18:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:38,910 INFO L225 Difference]: With dead ends: 671 [2018-10-26 22:18:38,910 INFO L226 Difference]: Without dead ends: 579 [2018-10-26 22:18:38,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=529, Invalid=3503, Unknown=0, NotChecked=0, Total=4032 [2018-10-26 22:18:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-26 22:18:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 309. [2018-10-26 22:18:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-26 22:18:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 341 transitions. [2018-10-26 22:18:38,954 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 341 transitions. Word has length 64 [2018-10-26 22:18:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:38,955 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 341 transitions. [2018-10-26 22:18:38,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-26 22:18:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 341 transitions. [2018-10-26 22:18:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 22:18:38,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:38,956 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:38,956 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:38,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2144727967, now seen corresponding path program 5 times [2018-10-26 22:18:38,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:38,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:38,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:39,455 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-26 22:18:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:39,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:39,809 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:39,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:18:39,854 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-26 22:18:39,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:39,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:40,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:18:40,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:18:40,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:40,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:40,551 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:18:40,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-10-26 22:18:40,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:18:40,712 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:40,714 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 23 treesize of output 37 [2018-10-26 22:18:40,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:40,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:40,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:40,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-26 22:18:41,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-26 22:18:41,061 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:41,062 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:41,062 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:41,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-10-26 22:18:41,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:41,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:41,081 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:18:41,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-26 22:18:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:41,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:41,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-26 22:18:41,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-26 22:18:41,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-26 22:18:41,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 22:18:41,150 INFO L87 Difference]: Start difference. First operand 309 states and 341 transitions. Second operand 37 states. [2018-10-26 22:18:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:43,377 INFO L93 Difference]: Finished difference Result 491 states and 538 transitions. [2018-10-26 22:18:43,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 22:18:43,377 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-26 22:18:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:43,379 INFO L225 Difference]: With dead ends: 491 [2018-10-26 22:18:43,379 INFO L226 Difference]: Without dead ends: 489 [2018-10-26 22:18:43,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=408, Invalid=3498, Unknown=0, NotChecked=0, Total=3906 [2018-10-26 22:18:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-26 22:18:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 350. [2018-10-26 22:18:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-26 22:18:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 387 transitions. [2018-10-26 22:18:43,432 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 387 transitions. Word has length 64 [2018-10-26 22:18:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:43,432 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 387 transitions. [2018-10-26 22:18:43,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-26 22:18:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 387 transitions. [2018-10-26 22:18:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 22:18:43,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:43,434 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:43,434 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:43,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1112045462, now seen corresponding path program 1 times [2018-10-26 22:18:43,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:43,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:43,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:44,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:44,417 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:44,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:44,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:44,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:18:44,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:44,681 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 34 treesize of output 50 [2018-10-26 22:18:44,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:44,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:44,704 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:18:44,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-26 22:18:44,886 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:44,887 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 50 treesize of output 52 [2018-10-26 22:18:44,890 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:44,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:44,892 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:44,896 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:44,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 85 [2018-10-26 22:18:44,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:44,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:44,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:44,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-10-26 22:18:45,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-26 22:18:45,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 87 [2018-10-26 22:18:45,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:45,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:45,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:45,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-10-26 22:18:45,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-26 22:18:45,246 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,248 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,250 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 96 [2018-10-26 22:18:45,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:45,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:45,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:45,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-10-26 22:18:45,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-26 22:18:45,448 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:45,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,504 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:45,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:45,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-10-26 22:18:45,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:45,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:45,519 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:18:45,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-26 22:18:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:18:45,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:45,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2018-10-26 22:18:45,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 22:18:45,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 22:18:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:18:45,603 INFO L87 Difference]: Start difference. First operand 350 states and 387 transitions. Second operand 43 states. [2018-10-26 22:18:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:48,496 INFO L93 Difference]: Finished difference Result 603 states and 667 transitions. [2018-10-26 22:18:48,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-26 22:18:48,496 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 65 [2018-10-26 22:18:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:48,498 INFO L225 Difference]: With dead ends: 603 [2018-10-26 22:18:48,498 INFO L226 Difference]: Without dead ends: 511 [2018-10-26 22:18:48,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=625, Invalid=4925, Unknown=0, NotChecked=0, Total=5550 [2018-10-26 22:18:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-26 22:18:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 321. [2018-10-26 22:18:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-26 22:18:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 354 transitions. [2018-10-26 22:18:48,549 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 354 transitions. Word has length 65 [2018-10-26 22:18:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:48,549 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 354 transitions. [2018-10-26 22:18:48,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 22:18:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 354 transitions. [2018-10-26 22:18:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 22:18:48,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:48,550 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:48,550 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:48,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1242756520, now seen corresponding path program 2 times [2018-10-26 22:18:48,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:48,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:18:48,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:48,720 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:48,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:18:48,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:18:48,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:48,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:18:48,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:48,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-26 22:18:48,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:18:48,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:18:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:18:48,777 INFO L87 Difference]: Start difference. First operand 321 states and 354 transitions. Second operand 6 states. [2018-10-26 22:18:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:48,933 INFO L93 Difference]: Finished difference Result 488 states and 538 transitions. [2018-10-26 22:18:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:18:48,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-26 22:18:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:48,937 INFO L225 Difference]: With dead ends: 488 [2018-10-26 22:18:48,938 INFO L226 Difference]: Without dead ends: 396 [2018-10-26 22:18:48,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:18:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-26 22:18:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 306. [2018-10-26 22:18:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-26 22:18:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 335 transitions. [2018-10-26 22:18:48,980 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 335 transitions. Word has length 65 [2018-10-26 22:18:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:48,980 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 335 transitions. [2018-10-26 22:18:48,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:18:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 335 transitions. [2018-10-26 22:18:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 22:18:48,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:48,982 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:48,982 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:48,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:48,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1300794170, now seen corresponding path program 2 times [2018-10-26 22:18:48,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:48,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:49,441 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 22:18:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:50,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:50,108 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:50,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:18:50,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:18:50,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:50,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:50,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:18:50,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,442 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 34 treesize of output 50 [2018-10-26 22:18:50,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,463 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:18:50,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-26 22:18:50,732 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,732 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 51 treesize of output 53 [2018-10-26 22:18:50,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,735 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:50,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 71 [2018-10-26 22:18:50,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,762 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:18:50,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-26 22:18:50,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-26 22:18:50,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,882 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,883 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-10-26 22:18:50,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,902 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:18:50,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-26 22:18:51,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-26 22:18:51,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:51,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 22:18:51,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:51,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:51,116 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:18:51,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-26 22:18:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:51,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:51,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-10-26 22:18:51,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-26 22:18:51,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-26 22:18:51,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1700, Unknown=0, NotChecked=0, Total=1892 [2018-10-26 22:18:51,182 INFO L87 Difference]: Start difference. First operand 306 states and 335 transitions. Second operand 44 states. [2018-10-26 22:18:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:52,686 INFO L93 Difference]: Finished difference Result 386 states and 419 transitions. [2018-10-26 22:18:52,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-26 22:18:52,686 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 67 [2018-10-26 22:18:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:52,688 INFO L225 Difference]: With dead ends: 386 [2018-10-26 22:18:52,688 INFO L226 Difference]: Without dead ends: 384 [2018-10-26 22:18:52,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=401, Invalid=3505, Unknown=0, NotChecked=0, Total=3906 [2018-10-26 22:18:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-26 22:18:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2018-10-26 22:18:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-26 22:18:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 328 transitions. [2018-10-26 22:18:52,727 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 328 transitions. Word has length 67 [2018-10-26 22:18:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:52,728 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 328 transitions. [2018-10-26 22:18:52,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-26 22:18:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 328 transitions. [2018-10-26 22:18:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-26 22:18:52,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:52,729 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:52,729 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:52,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash 47502430, now seen corresponding path program 5 times [2018-10-26 22:18:52,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:52,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:52,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:53,129 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2018-10-26 22:18:53,334 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2018-10-26 22:18:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:54,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:54,307 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:54,313 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:18:54,345 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-26 22:18:54,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:54,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:54,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:18:54,556 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:54,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 61 [2018-10-26 22:18:54,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,582 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:18:54,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-26 22:18:54,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,669 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 52 treesize of output 54 [2018-10-26 22:18:54,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,676 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-26 22:18:54,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:54,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2018-10-26 22:18:54,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-26 22:18:54,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-26 22:18:54,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,787 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:18:54,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-10-26 22:18:54,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-26 22:18:54,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:54,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 22:18:54,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:54,844 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:18:54,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-26 22:18:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:18:54,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:54,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-10-26 22:18:54,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-26 22:18:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-26 22:18:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:18:54,897 INFO L87 Difference]: Start difference. First operand 299 states and 328 transitions. Second operand 33 states. [2018-10-26 22:18:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:57,780 INFO L93 Difference]: Finished difference Result 521 states and 567 transitions. [2018-10-26 22:18:57,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-26 22:18:57,780 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2018-10-26 22:18:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:57,782 INFO L225 Difference]: With dead ends: 521 [2018-10-26 22:18:57,782 INFO L226 Difference]: Without dead ends: 445 [2018-10-26 22:18:57,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=994, Invalid=4706, Unknown=0, NotChecked=0, Total=5700 [2018-10-26 22:18:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-26 22:18:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 267. [2018-10-26 22:18:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-26 22:18:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 289 transitions. [2018-10-26 22:18:57,834 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 289 transitions. Word has length 68 [2018-10-26 22:18:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:57,834 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 289 transitions. [2018-10-26 22:18:57,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-26 22:18:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 289 transitions. [2018-10-26 22:18:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 22:18:57,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:57,836 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:57,836 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:57,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2087155470, now seen corresponding path program 2 times [2018-10-26 22:18:57,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:57,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:57,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:58,243 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-26 22:18:58,501 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-26 22:18:58,810 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-10-26 22:18:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:59,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:59,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:59,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:18:59,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:18:59,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:59,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:59,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-26 22:18:59,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:59,393 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 17 treesize of output 30 [2018-10-26 22:18:59,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:59,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:59,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:18:59,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-10-26 22:18:59,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-10-26 22:18:59,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:59,759 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:18:59,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-26 22:18:59,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:59,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:59,769 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:18:59,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-26 22:18:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:59,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:59,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-10-26 22:18:59,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-26 22:18:59,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-26 22:18:59,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2018-10-26 22:18:59,829 INFO L87 Difference]: Start difference. First operand 267 states and 289 transitions. Second operand 31 states. [2018-10-26 22:19:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:01,353 INFO L93 Difference]: Finished difference Result 408 states and 434 transitions. [2018-10-26 22:19:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:19:01,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-10-26 22:19:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:01,355 INFO L225 Difference]: With dead ends: 408 [2018-10-26 22:19:01,355 INFO L226 Difference]: Without dead ends: 406 [2018-10-26 22:19:01,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=328, Invalid=2324, Unknown=0, NotChecked=0, Total=2652 [2018-10-26 22:19:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-26 22:19:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 263. [2018-10-26 22:19:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-26 22:19:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 284 transitions. [2018-10-26 22:19:01,392 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 284 transitions. Word has length 72 [2018-10-26 22:19:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:01,392 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 284 transitions. [2018-10-26 22:19:01,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-26 22:19:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 284 transitions. [2018-10-26 22:19:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 22:19:01,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:01,393 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:01,393 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:01,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:01,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1794356367, now seen corresponding path program 6 times [2018-10-26 22:19:01,393 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:01,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:01,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:01,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:01,903 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:01,910 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:19:01,949 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-26 22:19:01,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:01,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:02,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:02,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-26 22:19:02,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 22:19:02,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 22:19:02,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:19:02,058 INFO L87 Difference]: Start difference. First operand 263 states and 284 transitions. Second operand 14 states. [2018-10-26 22:19:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:02,458 INFO L93 Difference]: Finished difference Result 391 states and 418 transitions. [2018-10-26 22:19:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 22:19:02,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-26 22:19:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:02,460 INFO L225 Difference]: With dead ends: 391 [2018-10-26 22:19:02,460 INFO L226 Difference]: Without dead ends: 354 [2018-10-26 22:19:02,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-10-26 22:19:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-26 22:19:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 277. [2018-10-26 22:19:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-26 22:19:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 298 transitions. [2018-10-26 22:19:02,501 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 298 transitions. Word has length 72 [2018-10-26 22:19:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:02,501 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 298 transitions. [2018-10-26 22:19:02,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 22:19:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 298 transitions. [2018-10-26 22:19:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 22:19:02,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:02,503 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 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] [2018-10-26 22:19:02,503 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -622242011, now seen corresponding path program 2 times [2018-10-26 22:19:02,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:02,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:02,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:02,731 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-26 22:19:02,884 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 22:19:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 11 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:04,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:04,912 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:04,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:19:04,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:19:04,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:04,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:05,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:19:05,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:05,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 61 [2018-10-26 22:19:05,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:05,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:05,192 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:19:05,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-26 22:19:05,430 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,431 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 51 treesize of output 53 [2018-10-26 22:19:05,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:05,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 71 [2018-10-26 22:19:05,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:05,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:05,464 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:19:05,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-26 22:19:05,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-26 22:19:05,578 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:05,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 106 [2018-10-26 22:19:05,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:05,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:05,617 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:19:05,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-26 22:19:05,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,991 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 65 treesize of output 63 [2018-10-26 22:19:05,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:05,997 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,002 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:06,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,004 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:06,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,015 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 191 [2018-10-26 22:19:06,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:19:06,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:06,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:06,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2018-10-26 22:19:06,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-10-26 22:19:06,338 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,346 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,363 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 161 [2018-10-26 22:19:06,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:19:06,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:19:06,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-26 22:19:06,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-10-26 22:19:06,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-26 22:19:06,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:06,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 22:19:06,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:06,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:06,723 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:19:06,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-26 22:19:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:06,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 57 [2018-10-26 22:19:06,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-26 22:19:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-26 22:19:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2840, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 22:19:06,834 INFO L87 Difference]: Start difference. First operand 277 states and 298 transitions. Second operand 57 states. [2018-10-26 22:19:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:10,698 INFO L93 Difference]: Finished difference Result 342 states and 365 transitions. [2018-10-26 22:19:10,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-26 22:19:10,699 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 73 [2018-10-26 22:19:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:10,700 INFO L225 Difference]: With dead ends: 342 [2018-10-26 22:19:10,701 INFO L226 Difference]: Without dead ends: 325 [2018-10-26 22:19:10,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 44 SyntacticMatches, 17 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=931, Invalid=7811, Unknown=0, NotChecked=0, Total=8742 [2018-10-26 22:19:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-26 22:19:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 241. [2018-10-26 22:19:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-26 22:19:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 259 transitions. [2018-10-26 22:19:10,746 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 259 transitions. Word has length 73 [2018-10-26 22:19:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:10,746 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 259 transitions. [2018-10-26 22:19:10,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-26 22:19:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 259 transitions. [2018-10-26 22:19:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-26 22:19:10,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:10,747 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:10,747 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:10,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1163723925, now seen corresponding path program 1 times [2018-10-26 22:19:10,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:10,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:10,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:11,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:11,242 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:11,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:11,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:11,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:19:11,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:11,479 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 34 treesize of output 50 [2018-10-26 22:19:11,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:11,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:11,497 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:19:11,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-26 22:19:11,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:11,643 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 52 treesize of output 54 [2018-10-26 22:19:11,646 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:11,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:11,649 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-26 22:19:11,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:11,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:11,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:11,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:30 [2018-10-26 22:19:11,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-26 22:19:11,767 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:11,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:11,769 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:11,770 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:11,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:11,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-26 22:19:11,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:11,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:11,779 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:19:11,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-26 22:19:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:11,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:11,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 35 [2018-10-26 22:19:11,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-26 22:19:11,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-26 22:19:11,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 22:19:11,835 INFO L87 Difference]: Start difference. First operand 241 states and 259 transitions. Second operand 35 states. [2018-10-26 22:19:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:16,024 INFO L93 Difference]: Finished difference Result 356 states and 378 transitions. [2018-10-26 22:19:16,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-26 22:19:16,025 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-10-26 22:19:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:16,026 INFO L225 Difference]: With dead ends: 356 [2018-10-26 22:19:16,026 INFO L226 Difference]: Without dead ends: 354 [2018-10-26 22:19:16,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3641 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1035, Invalid=10307, Unknown=0, NotChecked=0, Total=11342 [2018-10-26 22:19:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-26 22:19:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 254. [2018-10-26 22:19:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-26 22:19:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 273 transitions. [2018-10-26 22:19:16,083 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 273 transitions. Word has length 75 [2018-10-26 22:19:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:16,084 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 273 transitions. [2018-10-26 22:19:16,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-26 22:19:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 273 transitions. [2018-10-26 22:19:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-26 22:19:16,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:16,085 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:16,085 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:16,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2019441042, now seen corresponding path program 3 times [2018-10-26 22:19:16,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:16,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:16,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:16,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:16,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:18,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:18,273 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:18,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:19:18,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:19:18,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:18,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:18,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:19:18,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,427 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 23 treesize of output 37 [2018-10-26 22:19:18,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:18,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:18,444 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:19:18,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-26 22:19:18,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-26 22:19:18,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,528 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 35 treesize of output 70 [2018-10-26 22:19:18,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:18,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:18,554 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:19:18,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2018-10-26 22:19:18,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-10-26 22:19:18,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,845 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,852 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 148 [2018-10-26 22:19:18,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-26 22:19:18,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:19:18,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:19:18,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:116 [2018-10-26 22:19:19,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-10-26 22:19:19,490 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,496 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,498 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:19,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 101 [2018-10-26 22:19:19,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:19,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2018-10-26 22:19:19,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-26 22:19:19,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,727 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,735 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 24 treesize of output 55 [2018-10-26 22:19:19,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,761 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:19:19,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-26 22:19:20,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 22:19:20,004 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 22:19:20,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:20,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:20,006 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:19:20,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-26 22:19:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:20,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:20,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 48 [2018-10-26 22:19:20,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-26 22:19:20,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-26 22:19:20,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2018-10-26 22:19:20,096 INFO L87 Difference]: Start difference. First operand 254 states and 273 transitions. Second operand 48 states. [2018-10-26 22:19:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:23,820 INFO L93 Difference]: Finished difference Result 369 states and 395 transitions. [2018-10-26 22:19:23,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-26 22:19:23,820 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 76 [2018-10-26 22:19:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:23,821 INFO L225 Difference]: With dead ends: 369 [2018-10-26 22:19:23,822 INFO L226 Difference]: Without dead ends: 352 [2018-10-26 22:19:23,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 24 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=623, Invalid=6019, Unknown=0, NotChecked=0, Total=6642 [2018-10-26 22:19:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-26 22:19:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2018-10-26 22:19:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-26 22:19:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 307 transitions. [2018-10-26 22:19:23,896 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 307 transitions. Word has length 76 [2018-10-26 22:19:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:23,897 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 307 transitions. [2018-10-26 22:19:23,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-26 22:19:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 307 transitions. [2018-10-26 22:19:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-26 22:19:23,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:23,898 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:23,898 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:23,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash -515741841, now seen corresponding path program 3 times [2018-10-26 22:19:23,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:23,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:23,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:23,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:24,991 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-10-26 22:19:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:25,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:25,438 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:19:25,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:19:25,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:25,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:25,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:19:25,792 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:25,793 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 23 treesize of output 37 [2018-10-26 22:19:25,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:25,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:25,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:25,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-10-26 22:19:25,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-26 22:19:25,946 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:25,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:25,948 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:25,953 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 30 treesize of output 73 [2018-10-26 22:19:25,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:25,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:25,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:25,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:30 [2018-10-26 22:19:26,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-26 22:19:26,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:26,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:26,162 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:26,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-10-26 22:19:26,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:26,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:26,178 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:19:26,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-26 22:19:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:26,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-10-26 22:19:26,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-26 22:19:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-26 22:19:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 22:19:26,245 INFO L87 Difference]: Start difference. First operand 286 states and 307 transitions. Second operand 37 states. [2018-10-26 22:19:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:28,829 INFO L93 Difference]: Finished difference Result 434 states and 463 transitions. [2018-10-26 22:19:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 22:19:28,829 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2018-10-26 22:19:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:28,831 INFO L225 Difference]: With dead ends: 434 [2018-10-26 22:19:28,831 INFO L226 Difference]: Without dead ends: 432 [2018-10-26 22:19:28,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=501, Invalid=3405, Unknown=0, NotChecked=0, Total=3906 [2018-10-26 22:19:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-26 22:19:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 310. [2018-10-26 22:19:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-26 22:19:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 334 transitions. [2018-10-26 22:19:28,894 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 334 transitions. Word has length 76 [2018-10-26 22:19:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:28,894 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 334 transitions. [2018-10-26 22:19:28,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-26 22:19:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 334 transitions. [2018-10-26 22:19:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-26 22:19:28,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:28,895 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:28,895 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:28,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1889992209, now seen corresponding path program 4 times [2018-10-26 22:19:28,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:28,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:28,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:29,447 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 5 [2018-10-26 22:19:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:30,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:30,312 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:30,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:19:30,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:19:30,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:30,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:30,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:19:30,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:19:30,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,471 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:19:30,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 22:19:30,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:19:30,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:30,684 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 23 treesize of output 37 [2018-10-26 22:19:30,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,700 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:19:30,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-26 22:19:30,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-26 22:19:30,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:30,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:30,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:30,839 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 25 treesize of output 58 [2018-10-26 22:19:30,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,860 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:19:30,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-10-26 22:19:30,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-26 22:19:30,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:30,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:30,972 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:30,977 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 25 treesize of output 58 [2018-10-26 22:19:30,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:30,995 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:19:30,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-26 22:19:31,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 22:19:31,193 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 22:19:31,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:31,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:31,196 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:19:31,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-26 22:19:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:31,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:31,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-10-26 22:19:31,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 22:19:31,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 22:19:31,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:19:31,262 INFO L87 Difference]: Start difference. First operand 310 states and 334 transitions. Second operand 43 states. [2018-10-26 22:19:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:34,145 INFO L93 Difference]: Finished difference Result 611 states and 658 transitions. [2018-10-26 22:19:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-26 22:19:34,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 76 [2018-10-26 22:19:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:34,147 INFO L225 Difference]: With dead ends: 611 [2018-10-26 22:19:34,147 INFO L226 Difference]: Without dead ends: 554 [2018-10-26 22:19:34,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=935, Invalid=7075, Unknown=0, NotChecked=0, Total=8010 [2018-10-26 22:19:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-26 22:19:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 318. [2018-10-26 22:19:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-26 22:19:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 343 transitions. [2018-10-26 22:19:34,203 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 343 transitions. Word has length 76 [2018-10-26 22:19:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:34,203 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 343 transitions. [2018-10-26 22:19:34,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 22:19:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 343 transitions. [2018-10-26 22:19:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-26 22:19:34,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:34,204 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:34,205 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:34,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash -715265710, now seen corresponding path program 7 times [2018-10-26 22:19:34,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:34,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:34,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:34,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:34,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:34,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:34,927 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:34,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:34,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:19:34,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:19:34,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:34,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:34,996 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:19:34,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 22:19:35,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-26 22:19:35,139 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:35,142 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 22 treesize of output 35 [2018-10-26 22:19:35,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:35,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:35,161 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:19:35,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-10-26 22:19:35,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-26 22:19:35,265 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:35,266 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:35,267 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:35,271 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 29 treesize of output 70 [2018-10-26 22:19:35,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:35,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:35,289 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:19:35,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-26 22:19:35,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-10-26 22:19:35,393 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:35,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:35,395 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:35,396 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:35,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2018-10-26 22:19:35,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:35,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:35,408 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:19:35,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-26 22:19:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:35,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:35,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2018-10-26 22:19:35,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 22:19:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 22:19:35,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:19:35,470 INFO L87 Difference]: Start difference. First operand 318 states and 343 transitions. Second operand 27 states. [2018-10-26 22:19:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:37,007 INFO L93 Difference]: Finished difference Result 449 states and 480 transitions. [2018-10-26 22:19:37,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-26 22:19:37,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-10-26 22:19:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:37,009 INFO L225 Difference]: With dead ends: 449 [2018-10-26 22:19:37,010 INFO L226 Difference]: Without dead ends: 447 [2018-10-26 22:19:37,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-10-26 22:19:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-26 22:19:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 366. [2018-10-26 22:19:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-26 22:19:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 396 transitions. [2018-10-26 22:19:37,093 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 396 transitions. Word has length 76 [2018-10-26 22:19:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:37,093 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 396 transitions. [2018-10-26 22:19:37,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 22:19:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 396 transitions. [2018-10-26 22:19:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 22:19:37,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:37,094 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:37,095 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:37,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash 326259627, now seen corresponding path program 3 times [2018-10-26 22:19:37,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:37,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:37,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:38,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:38,105 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:38,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:19:38,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:19:38,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:38,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:38,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-26 22:19:38,447 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,449 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 34 treesize of output 50 [2018-10-26 22:19:38,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:38,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:38,471 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:19:38,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-26 22:19:38,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,688 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 50 treesize of output 52 [2018-10-26 22:19:38,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:38,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 86 [2018-10-26 22:19:38,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:38,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:38,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:38,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:40 [2018-10-26 22:19:38,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-26 22:19:38,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:38,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 89 [2018-10-26 22:19:38,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:38,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:39,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:39,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2018-10-26 22:19:39,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-10-26 22:19:39,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:39,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:39,055 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:39,056 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:39,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 92 [2018-10-26 22:19:39,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:39,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:39,079 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:19:39,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:21 [2018-10-26 22:19:39,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-10-26 22:19:39,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:39,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:39,237 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:39,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:39,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-10-26 22:19:39,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:39,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:39,247 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:19:39,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-10-26 22:19:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 52 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:39,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:39,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 47 [2018-10-26 22:19:39,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-26 22:19:39,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-26 22:19:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1950, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:19:39,323 INFO L87 Difference]: Start difference. First operand 366 states and 396 transitions. Second operand 47 states. [2018-10-26 22:19:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:47,332 INFO L93 Difference]: Finished difference Result 707 states and 762 transitions. [2018-10-26 22:19:47,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-26 22:19:47,332 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2018-10-26 22:19:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:47,334 INFO L225 Difference]: With dead ends: 707 [2018-10-26 22:19:47,334 INFO L226 Difference]: Without dead ends: 650 [2018-10-26 22:19:47,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9728 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2018, Invalid=23742, Unknown=0, NotChecked=0, Total=25760 [2018-10-26 22:19:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-26 22:19:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 372. [2018-10-26 22:19:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-26 22:19:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 403 transitions. [2018-10-26 22:19:47,421 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 403 transitions. Word has length 79 [2018-10-26 22:19:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:47,421 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 403 transitions. [2018-10-26 22:19:47,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-26 22:19:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 403 transitions. [2018-10-26 22:19:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 22:19:47,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:47,422 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:47,422 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:47,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2049798021, now seen corresponding path program 2 times [2018-10-26 22:19:47,423 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:47,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:47,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:47,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:47,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:19:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:19:47,484 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:19:47,502 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,503 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,504 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,505 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,505 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,505 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,506 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,506 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,506 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,506 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,508 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,510 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,510 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,510 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,510 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,511 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,513 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,513 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,513 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,513 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,514 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,514 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,514 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,514 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,515 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,515 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,515 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,515 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,516 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,516 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,516 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,516 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,517 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,517 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,517 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,517 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,519 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,520 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,520 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,520 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,520 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,520 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,521 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,521 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,521 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,521 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,522 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,523 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,524 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,524 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,524 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,524 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,524 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,525 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,525 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,525 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,525 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,526 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,527 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,528 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,528 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,528 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,528 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,531 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,532 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,532 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,532 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,532 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,532 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,533 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,533 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,533 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,533 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,533 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,537 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,537 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,537 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,537 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,537 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,538 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,538 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,538 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,538 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,538 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,539 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,541 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:19:47,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:19:47 BoogieIcfgContainer [2018-10-26 22:19:47,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:19:47,567 INFO L168 Benchmark]: Toolchain (without parser) took 127511.76 ms. Allocated memory was 1.6 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 1.9 GB in the end (delta: -500.3 MB). Peak memory consumption was 624.3 MB. Max. memory is 7.1 GB. [2018-10-26 22:19:47,568 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:19:47,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.60 ms. Allocated memory is still 1.6 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:19:47,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.59 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:19:47,569 INFO L168 Benchmark]: Boogie Preprocessor took 29.76 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:19:47,569 INFO L168 Benchmark]: RCFGBuilder took 555.52 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-10-26 22:19:47,569 INFO L168 Benchmark]: TraceAbstraction took 126511.65 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 375.4 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 285.5 MB). Peak memory consumption was 660.9 MB. Max. memory is 7.1 GB. [2018-10-26 22:19:47,571 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.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 367.60 ms. Allocated memory is still 1.6 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 42.59 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.76 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 555.52 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 126511.65 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 375.4 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 285.5 MB). Peak memory consumption was 660.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] CALL int v[SIZE]; [L13] RET int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR, FCALL v[i] [L19] FCALL v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND FALSE !(j