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/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 15:39:58,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 15:39:58,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 15:39:58,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 15:39:58,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 15:39:58,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 15:39:58,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 15:39:58,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 15:39:58,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 15:39:58,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 15:39:58,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 15:39:58,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 15:39:58,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 15:39:58,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 15:39:58,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 15:39:58,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 15:39:58,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 15:39:58,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 15:39:58,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 15:39:58,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 15:39:58,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 15:39:58,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 15:39:58,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 15:39:58,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 15:39:58,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 15:39:58,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 15:39:58,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 15:39:58,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 15:39:58,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 15:39:58,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 15:39:58,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 15:39:58,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 15:39:58,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 15:39:58,408 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 15:39:58,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 15:39:58,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 15:39:58,412 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-23 15:39:58,436 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 15:39:58,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 15:39:58,437 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 15:39:58,437 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 15:39:58,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 15:39:58,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 15:39:58,438 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 15:39:58,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 15:39:58,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 15:39:58,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 15:39:58,439 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 15:39:58,439 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 15:39:58,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 15:39:58,440 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 15:39:58,440 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 15:39:58,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 15:39:58,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 15:39:58,441 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 15:39:58,441 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 15:39:58,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 15:39:58,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 15:39:58,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 15:39:58,442 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 15:39:58,442 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 15:39:58,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 15:39:58,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 15:39:58,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 15:39:58,442 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 15:39:58,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 15:39:58,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 15:39:58,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 15:39:58,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 15:39:58,504 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 15:39:58,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-23 15:39:58,564 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/563b340e0/e8a99a26059c4621993d8fe850e6af82/FLAGdc3afecfb [2018-10-23 15:39:58,990 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 15:39:58,990 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-23 15:39:58,998 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/563b340e0/e8a99a26059c4621993d8fe850e6af82/FLAGdc3afecfb [2018-10-23 15:39:59,013 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/563b340e0/e8a99a26059c4621993d8fe850e6af82 [2018-10-23 15:39:59,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 15:39:59,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 15:39:59,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 15:39:59,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 15:39:59,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 15:39:59,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbc7c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59, skipping insertion in model container [2018-10-23 15:39:59,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 15:39:59,062 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 15:39:59,279 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 15:39:59,292 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 15:39:59,330 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 15:39:59,360 INFO L193 MainTranslator]: Completed translation [2018-10-23 15:39:59,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59 WrapperNode [2018-10-23 15:39:59,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 15:39:59,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 15:39:59,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 15:39:59,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 15:39:59,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 15:39:59,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 15:39:59,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 15:39:59,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 15:39:59,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... [2018-10-23 15:39:59,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 15:39:59,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 15:39:59,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 15:39:59,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 15:39:59,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 15:39:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-23 15:39:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-23 15:39:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 15:39:59,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 15:39:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-23 15:39:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-23 15:40:00,087 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 15:40:00,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 03:40:00 BoogieIcfgContainer [2018-10-23 15:40:00,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 15:40:00,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 15:40:00,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 15:40:00,092 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 15:40:00,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 03:39:59" (1/3) ... [2018-10-23 15:40:00,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200f07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 03:40:00, skipping insertion in model container [2018-10-23 15:40:00,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:39:59" (2/3) ... [2018-10-23 15:40:00,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200f07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 03:40:00, skipping insertion in model container [2018-10-23 15:40:00,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 03:40:00" (3/3) ... [2018-10-23 15:40:00,096 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-10-23 15:40:00,106 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 15:40:00,114 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 15:40:00,133 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 15:40:00,176 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 15:40:00,177 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 15:40:00,177 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 15:40:00,177 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 15:40:00,177 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 15:40:00,178 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 15:40:00,178 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 15:40:00,178 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 15:40:00,178 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 15:40:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-23 15:40:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-23 15:40:00,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:00,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:00,205 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:00,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash -794186159, now seen corresponding path program 1 times [2018-10-23 15:40:00,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:00,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:00,346 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-23 15:40:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 15:40:00,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 15:40:00,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-23 15:40:00,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-23 15:40:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-23 15:40:00,368 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-23 15:40:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:00,388 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2018-10-23 15:40:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-23 15:40:00,389 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-23 15:40:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:00,400 INFO L225 Difference]: With dead ends: 75 [2018-10-23 15:40:00,400 INFO L226 Difference]: Without dead ends: 41 [2018-10-23 15:40:00,404 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-23 15:40:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-23 15:40:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-23 15:40:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-23 15:40:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-23 15:40:00,438 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 21 [2018-10-23 15:40:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:00,438 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-23 15:40:00,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-23 15:40:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-23 15:40:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 15:40:00,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:00,440 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:00,440 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:00,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash -593923913, now seen corresponding path program 1 times [2018-10-23 15:40:00,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:00,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:00,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:00,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:00,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:00,519 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-23 15:40:00,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 15:40:00,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 15:40:00,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 15:40:00,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 15:40:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 15:40:00,523 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 3 states. [2018-10-23 15:40:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:00,612 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-10-23 15:40:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 15:40:00,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-23 15:40:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:00,615 INFO L225 Difference]: With dead ends: 71 [2018-10-23 15:40:00,615 INFO L226 Difference]: Without dead ends: 45 [2018-10-23 15:40:00,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 15:40:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-23 15:40:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-23 15:40:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-23 15:40:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-10-23 15:40:00,628 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-10-23 15:40:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:00,630 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-10-23 15:40:00,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 15:40:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-10-23 15:40:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-23 15:40:00,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:00,632 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:00,632 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:00,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash 496444158, now seen corresponding path program 1 times [2018-10-23 15:40:00,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:00,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:00,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:00,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:00,758 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-23 15:40:00,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:00,759 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-23 15:40:00,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:00,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:00,843 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-23 15:40:00,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:00,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-23 15:40:00,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 15:40:00,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 15:40:00,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 15:40:00,867 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2018-10-23 15:40:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:01,125 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-10-23 15:40:01,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 15:40:01,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-23 15:40:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:01,129 INFO L225 Difference]: With dead ends: 75 [2018-10-23 15:40:01,129 INFO L226 Difference]: Without dead ends: 49 [2018-10-23 15:40:01,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 15:40:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-23 15:40:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-10-23 15:40:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-23 15:40:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-10-23 15:40:01,142 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-10-23 15:40:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:01,142 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-10-23 15:40:01,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 15:40:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-10-23 15:40:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-23 15:40:01,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:01,146 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:01,146 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:01,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1750358469, now seen corresponding path program 2 times [2018-10-23 15:40:01,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:01,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:01,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:01,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:01,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:01,290 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-23 15:40:01,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:01,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-23 15:40:01,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:01,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 15:40:01,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 15:40:01,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-10-23 15:40:01,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 15:40:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 15:40:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-23 15:40:01,414 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2018-10-23 15:40:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:01,736 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-10-23 15:40:01,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 15:40:01,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-10-23 15:40:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:01,738 INFO L225 Difference]: With dead ends: 94 [2018-10-23 15:40:01,738 INFO L226 Difference]: Without dead ends: 68 [2018-10-23 15:40:01,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 15:40:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-23 15:40:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2018-10-23 15:40:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-23 15:40:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-23 15:40:01,748 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 31 [2018-10-23 15:40:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:01,748 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-23 15:40:01,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 15:40:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-23 15:40:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-23 15:40:01,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:01,750 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:01,751 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:01,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2127477742, now seen corresponding path program 1 times [2018-10-23 15:40:01,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:01,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 15:40:01,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:01,897 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-23 15:40:01,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:01,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 15:40:01,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:01,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-23 15:40:01,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 15:40:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 15:40:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-23 15:40:01,984 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2018-10-23 15:40:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:02,145 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-10-23 15:40:02,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 15:40:02,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-23 15:40:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:02,147 INFO L225 Difference]: With dead ends: 87 [2018-10-23 15:40:02,147 INFO L226 Difference]: Without dead ends: 59 [2018-10-23 15:40:02,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-23 15:40:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-23 15:40:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-23 15:40:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-23 15:40:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-10-23 15:40:02,155 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 46 [2018-10-23 15:40:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:02,155 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-10-23 15:40:02,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 15:40:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-10-23 15:40:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-23 15:40:02,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:02,157 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:02,157 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:02,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1834611179, now seen corresponding path program 2 times [2018-10-23 15:40:02,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:02,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:02,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 15:40:02,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:02,500 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-23 15:40:02,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:02,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:40:02,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:02,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 15:40:02,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:02,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-23 15:40:02,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 15:40:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 15:40:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-23 15:40:02,574 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2018-10-23 15:40:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:02,979 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-10-23 15:40:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 15:40:02,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-23 15:40:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:02,981 INFO L225 Difference]: With dead ends: 125 [2018-10-23 15:40:02,981 INFO L226 Difference]: Without dead ends: 97 [2018-10-23 15:40:02,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-23 15:40:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-23 15:40:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 61. [2018-10-23 15:40:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-23 15:40:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-10-23 15:40:03,002 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 50 [2018-10-23 15:40:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:03,002 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-10-23 15:40:03,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 15:40:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-10-23 15:40:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-23 15:40:03,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:03,006 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:03,007 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:03,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:03,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1755968700, now seen corresponding path program 3 times [2018-10-23 15:40:03,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:03,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:03,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:03,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:03,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 15:40:03,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 15:40:03,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 15:40:03,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 15:40:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 15:40:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 15:40:03,149 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-10-23 15:40:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:03,319 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-10-23 15:40:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 15:40:03,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-10-23 15:40:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:03,320 INFO L225 Difference]: With dead ends: 105 [2018-10-23 15:40:03,320 INFO L226 Difference]: Without dead ends: 80 [2018-10-23 15:40:03,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 15:40:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-23 15:40:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-10-23 15:40:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-23 15:40:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-10-23 15:40:03,329 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 54 [2018-10-23 15:40:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:03,330 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-10-23 15:40:03,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 15:40:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-10-23 15:40:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-23 15:40:03,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:03,331 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:03,332 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:03,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1400751282, now seen corresponding path program 1 times [2018-10-23 15:40:03,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:03,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:03,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 15:40:03,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:03,453 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-23 15:40:03,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:03,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 15:40:04,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:04,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-23 15:40:04,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 15:40:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 15:40:04,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-23 15:40:04,056 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 9 states. [2018-10-23 15:40:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:04,355 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-10-23 15:40:04,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 15:40:04,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-10-23 15:40:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:04,359 INFO L225 Difference]: With dead ends: 124 [2018-10-23 15:40:04,359 INFO L226 Difference]: Without dead ends: 99 [2018-10-23 15:40:04,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-10-23 15:40:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-23 15:40:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-10-23 15:40:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-23 15:40:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-10-23 15:40:04,370 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 60 [2018-10-23 15:40:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:04,370 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-10-23 15:40:04,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 15:40:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-10-23 15:40:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-23 15:40:04,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:04,372 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:04,373 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:04,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash -77800680, now seen corresponding path program 2 times [2018-10-23 15:40:04,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:04,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:04,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-23 15:40:04,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 15:40:04,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 15:40:04,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 15:40:04,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 15:40:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 15:40:04,486 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 5 states. [2018-10-23 15:40:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:04,608 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-10-23 15:40:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 15:40:04,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-10-23 15:40:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:04,609 INFO L225 Difference]: With dead ends: 146 [2018-10-23 15:40:04,609 INFO L226 Difference]: Without dead ends: 101 [2018-10-23 15:40:04,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 15:40:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-23 15:40:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-10-23 15:40:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-23 15:40:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-10-23 15:40:04,620 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 88 [2018-10-23 15:40:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:04,621 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-10-23 15:40:04,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 15:40:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-10-23 15:40:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-23 15:40:04,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:04,623 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:04,623 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:04,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash 916290126, now seen corresponding path program 3 times [2018-10-23 15:40:04,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:04,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:04,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-23 15:40:04,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:04,865 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-23 15:40:04,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:40:04,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-23 15:40:04,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:04,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-23 15:40:05,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:05,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-23 15:40:05,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 15:40:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 15:40:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-23 15:40:05,115 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 11 states. [2018-10-23 15:40:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:05,336 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-10-23 15:40:05,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 15:40:05,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-10-23 15:40:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:05,338 INFO L225 Difference]: With dead ends: 154 [2018-10-23 15:40:05,338 INFO L226 Difference]: Without dead ends: 107 [2018-10-23 15:40:05,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-23 15:40:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-23 15:40:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-10-23 15:40:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-23 15:40:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-10-23 15:40:05,359 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 94 [2018-10-23 15:40:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:05,360 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-10-23 15:40:05,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 15:40:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-10-23 15:40:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-23 15:40:05,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:05,362 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:05,362 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:05,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash 907761752, now seen corresponding path program 4 times [2018-10-23 15:40:05,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:05,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:05,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-23 15:40:05,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:05,660 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-23 15:40:05,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:40:05,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:40:05,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:05,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-23 15:40:05,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:05,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-23 15:40:05,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-23 15:40:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-23 15:40:05,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-23 15:40:05,887 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 15 states. [2018-10-23 15:40:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:06,636 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2018-10-23 15:40:06,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-23 15:40:06,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-10-23 15:40:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:06,638 INFO L225 Difference]: With dead ends: 208 [2018-10-23 15:40:06,638 INFO L226 Difference]: Without dead ends: 161 [2018-10-23 15:40:06,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-10-23 15:40:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-23 15:40:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2018-10-23 15:40:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-23 15:40:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-10-23 15:40:06,651 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 100 [2018-10-23 15:40:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:06,652 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-10-23 15:40:06,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-23 15:40:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-10-23 15:40:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-23 15:40:06,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:06,655 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:06,655 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:06,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 712625138, now seen corresponding path program 5 times [2018-10-23 15:40:06,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:06,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 163 proven. 14 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-23 15:40:06,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:06,846 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-23 15:40:06,855 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:40:06,942 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-23 15:40:06,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:06,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:07,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-23 15:40:07,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:07,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:07,843 INFO L303 Elim1Store]: Index analysis took 178 ms [2018-10-23 15:40:07,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 122 [2018-10-23 15:40:07,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2018-10-23 15:40:08,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-23 15:40:08,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-23 15:40:08,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:102 [2018-10-23 15:40:08,373 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 57 treesize of output 50 [2018-10-23 15:40:08,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,410 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,412 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,436 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 97 [2018-10-23 15:40:08,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,556 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 36 [2018-10-23 15:40:08,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-23 15:40:08,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,624 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 24 [2018-10-23 15:40:08,655 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 13 treesize of output 12 [2018-10-23 15:40:08,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,662 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-23 15:40:08,698 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:126, output treesize:88 [2018-10-23 15:40:10,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2018-10-23 15:40:10,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,268 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,272 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,297 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 181 [2018-10-23 15:40:10,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2018-10-23 15:40:10,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:10,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-10-23 15:40:10,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:10,600 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-10-23 15:40:10,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-10-23 15:40:10,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:10,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:10,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-23 15:40:10,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:167, output treesize:28 [2018-10-23 15:40:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 192 proven. 71 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-23 15:40:10,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:10,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 28] total 32 [2018-10-23 15:40:10,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-23 15:40:10,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-23 15:40:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-10-23 15:40:10,907 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 32 states. [2018-10-23 15:40:14,809 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2018-10-23 15:40:15,145 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-23 15:40:15,518 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-23 15:40:15,811 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-10-23 15:40:16,182 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2018-10-23 15:40:16,920 WARN L179 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-10-23 15:40:17,210 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-23 15:40:17,503 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2018-10-23 15:40:17,782 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2018-10-23 15:40:18,037 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2018-10-23 15:40:20,560 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-10-23 15:40:22,042 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2018-10-23 15:40:22,231 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-10-23 15:40:22,850 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2018-10-23 15:40:23,082 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-10-23 15:40:23,585 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-10-23 15:40:24,071 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-10-23 15:40:24,487 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-10-23 15:40:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:24,912 INFO L93 Difference]: Finished difference Result 601 states and 682 transitions. [2018-10-23 15:40:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-23 15:40:24,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 135 [2018-10-23 15:40:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:24,918 INFO L225 Difference]: With dead ends: 601 [2018-10-23 15:40:24,919 INFO L226 Difference]: Without dead ends: 536 [2018-10-23 15:40:24,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5422 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2483, Invalid=14029, Unknown=0, NotChecked=0, Total=16512 [2018-10-23 15:40:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-23 15:40:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 309. [2018-10-23 15:40:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-23 15:40:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 356 transitions. [2018-10-23 15:40:24,954 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 356 transitions. Word has length 135 [2018-10-23 15:40:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:24,954 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 356 transitions. [2018-10-23 15:40:24,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-23 15:40:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 356 transitions. [2018-10-23 15:40:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-23 15:40:24,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:24,957 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:24,957 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:24,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash 818812964, now seen corresponding path program 1 times [2018-10-23 15:40:24,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:24,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:24,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 307 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-10-23 15:40:25,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:25,586 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-23 15:40:25,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:25,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-23 15:40:25,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:25,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-23 15:40:25,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-23 15:40:25,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-23 15:40:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-10-23 15:40:25,847 INFO L87 Difference]: Start difference. First operand 309 states and 356 transitions. Second operand 15 states. [2018-10-23 15:40:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:26,534 INFO L93 Difference]: Finished difference Result 585 states and 688 transitions. [2018-10-23 15:40:26,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-23 15:40:26,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 152 [2018-10-23 15:40:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:26,538 INFO L225 Difference]: With dead ends: 585 [2018-10-23 15:40:26,538 INFO L226 Difference]: Without dead ends: 438 [2018-10-23 15:40:26,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-10-23 15:40:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-23 15:40:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 241. [2018-10-23 15:40:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-23 15:40:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2018-10-23 15:40:26,581 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 152 [2018-10-23 15:40:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:26,581 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2018-10-23 15:40:26,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-23 15:40:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2018-10-23 15:40:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-23 15:40:26,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:26,583 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:26,584 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:26,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash -819722602, now seen corresponding path program 2 times [2018-10-23 15:40:26,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:26,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:26,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:27,271 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2018-10-23 15:40:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-10-23 15:40:27,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:27,526 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-23 15:40:27,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:27,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:40:27,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:27,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:28,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-10-23 15:40:28,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-10-23 15:40:28,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,503 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-23 15:40:28,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:26 [2018-10-23 15:40:28,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-23 15:40:28,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-23 15:40:28,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,573 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-23 15:40:28,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-23 15:40:28,836 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-23 15:40:28,840 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:28,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 55 [2018-10-23 15:40:28,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,868 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-23 15:40:28,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:23 [2018-10-23 15:40:28,906 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-23 15:40:28,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:28,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 45 [2018-10-23 15:40:28,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:28,929 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-23 15:40:28,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-23 15:40:29,111 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-23 15:40:29,114 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:29,116 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-23 15:40:29,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:29,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:29,123 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-23 15:40:29,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:40:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 119 proven. 357 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-23 15:40:29,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:29,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31] total 41 [2018-10-23 15:40:29,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-23 15:40:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-23 15:40:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2018-10-23 15:40:29,237 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand 41 states. [2018-10-23 15:40:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:33,363 INFO L93 Difference]: Finished difference Result 694 states and 812 transitions. [2018-10-23 15:40:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-23 15:40:33,363 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-23 15:40:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:33,366 INFO L225 Difference]: With dead ends: 694 [2018-10-23 15:40:33,366 INFO L226 Difference]: Without dead ends: 550 [2018-10-23 15:40:33,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=780, Invalid=6026, Unknown=0, NotChecked=0, Total=6806 [2018-10-23 15:40:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-23 15:40:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 359. [2018-10-23 15:40:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-23 15:40:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 408 transitions. [2018-10-23 15:40:33,404 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 408 transitions. Word has length 158 [2018-10-23 15:40:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:33,404 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 408 transitions. [2018-10-23 15:40:33,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-23 15:40:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 408 transitions. [2018-10-23 15:40:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-23 15:40:33,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:33,407 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:33,407 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:33,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:33,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1790866580, now seen corresponding path program 1 times [2018-10-23 15:40:33,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:33,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:33,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:33,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:33,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:34,238 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-10-23 15:40:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-10-23 15:40:34,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:34,545 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-23 15:40:34,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:34,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:34,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-23 15:40:34,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-23 15:40:34,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:34,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:34,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-23 15:40:34,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-23 15:40:34,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-23 15:40:34,810 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-23 15:40:34,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-23 15:40:34,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-23 15:40:34,896 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:34,898 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:34,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-10-23 15:40:34,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:34,917 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-23 15:40:34,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-23 15:40:35,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-23 15:40:35,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,063 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-23 15:40:35,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:35,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,093 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-23 15:40:35,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,277 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-23 15:40:35,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:35,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,412 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-23 15:40:35,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,504 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-23 15:40:35,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:35,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,535 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-23 15:40:35,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,555 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-23 15:40:35,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:35,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,676 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-23 15:40:35,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,759 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-23 15:40:35,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:35,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,789 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-23 15:40:35,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,817 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-23 15:40:35,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:35,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,843 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-23 15:40:35,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:35,869 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-23 15:40:35,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:35,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:35,970 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-23 15:40:35,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:36,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:36,271 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-23 15:40:36,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:36,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:36,375 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-23 15:40:36,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:36,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:36,661 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-23 15:40:36,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-23 15:40:36,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-23 15:40:36,767 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-23 15:40:36,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:36,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:36,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 15:40:36,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:27 [2018-10-23 15:40:37,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-23 15:40:37,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:37,381 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:37,402 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:37,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-23 15:40:37,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:37,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:37,415 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-23 15:40:37,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2018-10-23 15:40:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-10-23 15:40:37,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:37,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-10-23 15:40:37,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-23 15:40:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-23 15:40:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-10-23 15:40:37,612 INFO L87 Difference]: Start difference. First operand 359 states and 408 transitions. Second operand 31 states. [2018-10-23 15:40:39,338 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2018-10-23 15:40:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:41,003 INFO L93 Difference]: Finished difference Result 398 states and 447 transitions. [2018-10-23 15:40:41,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-23 15:40:41,003 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2018-10-23 15:40:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:41,005 INFO L225 Difference]: With dead ends: 398 [2018-10-23 15:40:41,005 INFO L226 Difference]: Without dead ends: 396 [2018-10-23 15:40:41,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=617, Invalid=2575, Unknown=0, NotChecked=0, Total=3192 [2018-10-23 15:40:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-23 15:40:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 366. [2018-10-23 15:40:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-23 15:40:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 415 transitions. [2018-10-23 15:40:41,042 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 415 transitions. Word has length 165 [2018-10-23 15:40:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:41,042 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 415 transitions. [2018-10-23 15:40:41,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-23 15:40:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 415 transitions. [2018-10-23 15:40:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-23 15:40:41,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:41,044 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:41,045 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:41,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1396560024, now seen corresponding path program 2 times [2018-10-23 15:40:41,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:41,798 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-10-23 15:40:41,939 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2018-10-23 15:40:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 155 proven. 202 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-23 15:40:43,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:43,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 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-23 15:40:43,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:43,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:40:43,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:43,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:43,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-23 15:40:43,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-23 15:40:43,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-23 15:40:43,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-23 15:40:43,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-23 15:40:43,308 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-23 15:40:43,311 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:43,312 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-23 15:40:43,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-23 15:40:43,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:43,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:43,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-23 15:40:43,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-10-23 15:40:43,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-10-23 15:40:43,409 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-23 15:40:43,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,431 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-23 15:40:43,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-10-23 15:40:43,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-23 15:40:43,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-23 15:40:43,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 15:40:43,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-23 15:40:43,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-23 15:40:43,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-23 15:40:43,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 15:40:43,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-23 15:40:43,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-23 15:40:43,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-23 15:40:43,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 15:40:43,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-23 15:40:43,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-23 15:40:43,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-23 15:40:43,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:43,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-23 15:40:43,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:48 [2018-10-23 15:40:52,014 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-10-23 15:40:54,071 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-23 15:40:56,211 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-23 15:40:58,330 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-23 15:41:00,398 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-23 15:41:02,553 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2018-10-23 15:41:04,619 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2018-10-23 15:41:06,693 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2018-10-23 15:41:06,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-10-23 15:41:06,706 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:06,706 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:06,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:06,707 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:06,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-10-23 15:41:06,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:06,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-10-23 15:41:06,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:06,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:06,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:06,742 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:15 [2018-10-23 15:41:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 203 proven. 47 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-10-23 15:41:06,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:06,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16] total 41 [2018-10-23 15:41:06,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-23 15:41:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-23 15:41:06,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1431, Unknown=3, NotChecked=0, Total=1640 [2018-10-23 15:41:06,897 INFO L87 Difference]: Start difference. First operand 366 states and 415 transitions. Second operand 41 states. [2018-10-23 15:41:31,549 WARN L179 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-23 15:41:35,814 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-23 15:41:39,919 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-10-23 15:41:44,086 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-23 15:41:48,371 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-10-23 15:41:52,529 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-10-23 15:41:58,831 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2018-10-23 15:42:03,040 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-23 15:42:07,318 WARN L179 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-10-23 15:42:11,554 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2018-10-23 15:42:15,802 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-23 15:42:20,053 WARN L179 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-23 15:42:24,232 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-23 15:42:28,381 WARN L179 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-10-23 15:42:32,650 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-10-23 15:42:44,981 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-10-23 15:42:51,181 WARN L179 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-10-23 15:43:13,495 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-23 15:43:23,662 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-23 15:43:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:24,984 INFO L93 Difference]: Finished difference Result 736 states and 845 transitions. [2018-10-23 15:43:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-23 15:43:24,985 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-10-23 15:43:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:24,987 INFO L225 Difference]: With dead ends: 736 [2018-10-23 15:43:24,987 INFO L226 Difference]: Without dead ends: 426 [2018-10-23 15:43:24,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 164 SyntacticMatches, 24 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 123.3s TimeCoverageRelationStatistics Valid=1168, Invalid=4514, Unknown=18, NotChecked=0, Total=5700 [2018-10-23 15:43:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-23 15:43:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 399. [2018-10-23 15:43:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-23 15:43:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 454 transitions. [2018-10-23 15:43:25,030 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 454 transitions. Word has length 172 [2018-10-23 15:43:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:25,031 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 454 transitions. [2018-10-23 15:43:25,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-23 15:43:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 454 transitions. [2018-10-23 15:43:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-23 15:43:25,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:25,033 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:25,033 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:25,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash -896521002, now seen corresponding path program 3 times [2018-10-23 15:43:25,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:25,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:25,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:25,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:25,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:25,808 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2018-10-23 15:43:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 208 proven. 44 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-23 15:43:26,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:26,229 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-23 15:43:26,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:43:26,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-23 15:43:26,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:26,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:26,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-23 15:43:26,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-23 15:43:26,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-23 15:43:26,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-23 15:43:26,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-23 15:43:26,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-23 15:43:26,502 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-23 15:43:26,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-23 15:43:26,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-23 15:43:26,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,551 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-10-23 15:43:26,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-10-23 15:43:26,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-10-23 15:43:26,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,610 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,610 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,611 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-10-23 15:43:26,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-10-23 15:43:26,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 48 treesize of output 37 [2018-10-23 15:43:26,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-10-23 15:43:26,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-10-23 15:43:26,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-23 15:43:26,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-10-23 15:43:26,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-10-23 15:43:26,911 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-23 15:43:26,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,944 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-23 15:43:26,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-10-23 15:43:27,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-10-23 15:43:27,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-23 15:43:27,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 15:43:27,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-10-23 15:43:27,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2018-10-23 15:43:27,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 34 [2018-10-23 15:43:27,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-23 15:43:27,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:87 [2018-10-23 15:43:27,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-10-23 15:43:27,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 45 [2018-10-23 15:43:27,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-23 15:43:27,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-10-23 15:43:27,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 96 [2018-10-23 15:43:27,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 56 [2018-10-23 15:43:27,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:27,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-23 15:43:27,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:113, output treesize:109 [2018-10-23 15:43:28,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2018-10-23 15:43:28,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-10-23 15:43:28,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:28,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 1 [2018-10-23 15:43:28,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:28,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:28,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:28,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:112, output treesize:10 [2018-10-23 15:43:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 101 proven. 14 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-10-23 15:43:28,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:28,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-10-23 15:43:28,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-23 15:43:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-23 15:43:28,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2018-10-23 15:43:28,403 INFO L87 Difference]: Start difference. First operand 399 states and 454 transitions. Second operand 37 states. [2018-10-23 15:43:29,115 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-10-23 15:43:29,257 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-10-23 15:43:29,415 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-10-23 15:43:29,590 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-10-23 15:43:30,671 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-10-23 15:43:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:31,204 INFO L93 Difference]: Finished difference Result 773 states and 883 transitions. [2018-10-23 15:43:31,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-23 15:43:31,204 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-10-23 15:43:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:31,206 INFO L225 Difference]: With dead ends: 773 [2018-10-23 15:43:31,206 INFO L226 Difference]: Without dead ends: 415 [2018-10-23 15:43:31,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=752, Invalid=2440, Unknown=0, NotChecked=0, Total=3192 [2018-10-23 15:43:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-23 15:43:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 414. [2018-10-23 15:43:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-23 15:43:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 469 transitions. [2018-10-23 15:43:31,253 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 469 transitions. Word has length 172 [2018-10-23 15:43:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:31,254 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 469 transitions. [2018-10-23 15:43:31,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-23 15:43:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 469 transitions. [2018-10-23 15:43:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-23 15:43:31,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:31,255 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:31,256 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:31,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:31,256 INFO L82 PathProgramCache]: Analyzing trace with hash 592744212, now seen corresponding path program 4 times [2018-10-23 15:43:31,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:31,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:31,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:32,463 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2018-10-23 15:43:32,602 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2018-10-23 15:43:32,732 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2018-10-23 15:43:34,851 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2018-10-23 15:43:35,017 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-10-23 15:43:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 164 proven. 293 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-23 15:43:35,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:35,407 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-23 15:43:35,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:43:35,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:43:35,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:35,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:35,819 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-23 15:43:35,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:35,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:35,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:35,831 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-23 15:43:35,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:35,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:35,851 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-23 15:43:35,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-10-23 15:43:35,856 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-23 15:43:35,859 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:35,859 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:35,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:35,868 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-23 15:43:35,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:35,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:35,889 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-23 15:43:35,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:25 [2018-10-23 15:43:36,097 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 34 treesize of output 26 [2018-10-23 15:43:36,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,102 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 26 treesize of output 18 [2018-10-23 15:43:36,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,107 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-23 15:43:36,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2018-10-23 15:43:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 253 proven. 99 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-23 15:43:36,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:36,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 19] total 54 [2018-10-23 15:43:36,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-23 15:43:36,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-23 15:43:36,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2641, Unknown=0, NotChecked=0, Total=2862 [2018-10-23 15:43:36,197 INFO L87 Difference]: Start difference. First operand 414 states and 469 transitions. Second operand 54 states. [2018-10-23 15:43:36,548 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 25 [2018-10-23 15:43:37,643 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 28 [2018-10-23 15:43:38,919 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 31 [2018-10-23 15:43:39,813 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-10-23 15:43:41,231 WARN L179 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-10-23 15:43:41,865 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 34 [2018-10-23 15:43:42,362 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2018-10-23 15:43:42,565 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2018-10-23 15:43:42,751 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 25 [2018-10-23 15:43:46,729 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 45 [2018-10-23 15:43:46,911 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 35 [2018-10-23 15:43:47,194 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 44 [2018-10-23 15:43:47,504 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-23 15:43:48,237 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2018-10-23 15:43:48,613 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2018-10-23 15:43:48,801 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-10-23 15:43:48,951 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 42 [2018-10-23 15:43:51,841 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 46 [2018-10-23 15:43:53,285 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-10-23 15:43:53,698 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 39 [2018-10-23 15:43:54,328 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2018-10-23 15:43:55,021 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-10-23 15:43:55,250 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 42 [2018-10-23 15:43:55,425 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2018-10-23 15:43:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:55,850 INFO L93 Difference]: Finished difference Result 1190 states and 1386 transitions. [2018-10-23 15:43:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-23 15:43:55,851 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 172 [2018-10-23 15:43:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:55,853 INFO L225 Difference]: With dead ends: 1190 [2018-10-23 15:43:55,853 INFO L226 Difference]: Without dead ends: 868 [2018-10-23 15:43:55,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 159 SyntacticMatches, 15 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13321 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=4887, Invalid=31023, Unknown=0, NotChecked=0, Total=35910 [2018-10-23 15:43:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-10-23 15:43:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 652. [2018-10-23 15:43:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-23 15:43:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 742 transitions. [2018-10-23 15:43:55,934 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 742 transitions. Word has length 172 [2018-10-23 15:43:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:55,934 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 742 transitions. [2018-10-23 15:43:55,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-23 15:43:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 742 transitions. [2018-10-23 15:43:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-23 15:43:55,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:55,936 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:55,937 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:55,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1966656236, now seen corresponding path program 5 times [2018-10-23 15:43:55,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:55,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:56,828 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2018-10-23 15:43:57,061 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2018-10-23 15:43:58,140 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-23 15:43:58,463 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-23 15:43:58,650 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-23 15:43:58,813 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2018-10-23 15:43:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 219 proven. 212 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-23 15:43:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:59,320 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-23 15:43:59,329 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:43:59,458 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-23 15:43:59,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:59,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:59,898 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-23 15:43:59,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:59,930 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 79 [2018-10-23 15:43:59,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-23 15:43:59,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-23 15:43:59,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-23 15:43:59,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:73 [2018-10-23 15:44:00,070 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 24 [2018-10-23 15:44:00,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-23 15:44:00,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:44:00,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:44:00,121 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 38 [2018-10-23 15:44:00,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:00,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:00,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:00,131 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-23 15:44:00,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-23 15:44:00,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:44:00,181 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 24 [2018-10-23 15:44:00,184 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 13 treesize of output 12 [2018-10-23 15:44:00,184 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-23 15:44:00,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:44:00,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-23 15:44:00,216 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:100, output treesize:53 [2018-10-23 15:44:02,071 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-23 15:44:02,327 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 70 treesize of output 57 [2018-10-23 15:44:02,332 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,335 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,338 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:44:02,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 129 [2018-10-23 15:44:02,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:44:02,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:44:02,397 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-23 15:44:02,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:72 [2018-10-23 15:44:02,499 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 52 treesize of output 43 [2018-10-23 15:44:02,502 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,508 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:44:02,510 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 43 treesize of output 103 [2018-10-23 15:44:02,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:44:02,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:44:02,548 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-23 15:44:02,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:73 [2018-10-23 15:44:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 300 proven. 145 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-23 15:44:03,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:44:03,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 67 [2018-10-23 15:44:03,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-23 15:44:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-23 15:44:03,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4130, Unknown=0, NotChecked=0, Total=4422 [2018-10-23 15:44:03,570 INFO L87 Difference]: Start difference. First operand 652 states and 742 transitions. Second operand 67 states. [2018-10-23 15:44:04,366 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2018-10-23 15:44:04,714 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2018-10-23 15:44:04,909 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2018-10-23 15:44:05,100 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-10-23 15:44:05,477 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-10-23 15:44:05,749 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-10-23 15:44:07,422 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 46 [2018-10-23 15:44:07,858 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2018-10-23 15:44:08,321 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 45 [2018-10-23 15:44:08,901 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 49 [2018-10-23 15:44:09,111 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2018-10-23 15:44:09,392 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-10-23 15:44:10,066 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2018-10-23 15:44:10,213 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2018-10-23 15:44:10,642 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2018-10-23 15:44:12,046 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 47 [2018-10-23 15:44:12,446 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 57 [2018-10-23 15:44:12,846 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 46 [2018-10-23 15:44:15,469 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-10-23 15:44:17,886 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 45 [2018-10-23 15:44:18,074 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-10-23 15:44:18,382 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2018-10-23 15:44:18,626 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-10-23 15:44:18,808 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-23 15:44:19,353 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 46 [2018-10-23 15:44:19,687 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 46 [2018-10-23 15:44:20,037 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 44 [2018-10-23 15:44:20,544 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 48 [2018-10-23 15:44:20,731 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 35 [2018-10-23 15:44:20,990 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 53 [2018-10-23 15:44:21,347 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 47 [2018-10-23 15:44:21,748 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 54 [2018-10-23 15:44:22,290 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 54 [2018-10-23 15:44:22,640 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 50 [2018-10-23 15:44:23,012 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 55 [2018-10-23 15:44:23,392 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 57 [2018-10-23 15:44:24,046 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 49 [2018-10-23 15:44:24,453 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 Received shutdown request... [2018-10-23 15:44:25,789 WARN L187 SmtUtils]: Removed 6 from assertion stack [2018-10-23 15:44:25,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-23 15:44:25,790 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 15:44:25,793 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 15:44:25,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 03:44:25 BoogieIcfgContainer [2018-10-23 15:44:25,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 15:44:25,794 INFO L168 Benchmark]: Toolchain (without parser) took 266771.90 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 939.5 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -982.0 MB). Peak memory consumption was 832.7 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:25,795 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 15:44:25,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:25,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 15:44:25,795 INFO L168 Benchmark]: Boogie Preprocessor took 54.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 15:44:25,796 INFO L168 Benchmark]: RCFGBuilder took 615.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -742.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:25,796 INFO L168 Benchmark]: TraceAbstraction took 265704.95 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 212.9 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -250.5 MB). Peak memory consumption was 837.5 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:25,798 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.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 337.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 615.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -742.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 265704.95 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 212.9 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -250.5 MB). Peak memory consumption was 837.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (652states) and FLOYD_HOARE automaton (currently 122 states, 67 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. TIMEOUT Result, 265.6s OverallTime, 19 OverallIterations, 15 TraceHistogramMax, 207.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 817 SDtfs, 6820 SDslu, 6884 SDs, 0 SdLazy, 11698 SolverSat, 2242 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 55.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2573 GetRequests, 1631 SyntacticMatches, 64 SemanticMatches, 877 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35465 ImplicationChecksByTransitivity, 195.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 992 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 54.4s InterpolantComputationTime, 3598 NumberOfCodeBlocks, 3391 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3564 ConstructedInterpolants, 258 QuantifiedInterpolants, 6118630 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2618 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 34 InterpolantComputations, 5 PerfectInterpolantSequences, 7265/9233 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown