java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:03:21,293 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:03:21,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:03:21,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:03:21,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:03:21,312 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:03:21,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:03:21,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:03:21,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:03:21,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:03:21,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:03:21,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:03:21,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:03:21,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:03:21,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:03:21,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:03:21,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:03:21,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:03:21,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:03:21,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:03:21,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:03:21,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:03:21,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:03:21,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:03:21,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:03:21,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:03:21,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:03:21,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:03:21,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:03:21,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:03:21,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:03:21,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:03:21,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:03:21,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:03:21,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:03:21,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:03:21,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:03:21,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:03:21,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:03:21,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:03:21,389 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:03:21,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:03:21,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:03:21,390 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:03:21,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:03:21,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:03:21,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:03:21,391 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:03:21,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:03:21,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:03:21,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:03:21,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:03:21,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:03:21,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:03:21,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:03:21,393 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:03:21,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:03:21,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:03:21,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:03:21,395 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:03:21,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:03:21,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:03:21,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:03:21,396 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:03:21,396 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:03:21,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:03:21,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:03:21,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:03:21,462 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:03:21,463 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:03:21,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c [2018-11-06 19:03:21,523 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d76f628e/995f0b8977cc4ea6bc54b4cd784e135b/FLAG7b985ab1d [2018-11-06 19:03:22,264 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:03:22,265 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c [2018-11-06 19:03:22,298 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d76f628e/995f0b8977cc4ea6bc54b4cd784e135b/FLAG7b985ab1d [2018-11-06 19:03:22,319 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d76f628e/995f0b8977cc4ea6bc54b4cd784e135b [2018-11-06 19:03:22,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:03:22,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:03:22,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:03:22,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:03:22,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:03:22,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:03:22" (1/1) ... [2018-11-06 19:03:22,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a195d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:22, skipping insertion in model container [2018-11-06 19:03:22,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:03:22" (1/1) ... [2018-11-06 19:03:22,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:03:22,518 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:03:23,880 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:03:23,887 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:03:24,562 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:03:24,593 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:03:24,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24 WrapperNode [2018-11-06 19:03:24,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:03:24,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:03:24,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:03:24,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:03:24,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:24,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:03:25,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:03:25,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:03:25,190 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:03:25,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... [2018-11-06 19:03:25,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:03:25,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:03:25,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:03:25,493 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:03:25,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:03:25,561 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:03:25,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:03:25,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:03:34,358 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:03:34,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:03:34 BoogieIcfgContainer [2018-11-06 19:03:34,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:03:34,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:03:34,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:03:34,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:03:34,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:03:22" (1/3) ... [2018-11-06 19:03:34,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748aa65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:03:34, skipping insertion in model container [2018-11-06 19:03:34,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:03:24" (2/3) ... [2018-11-06 19:03:34,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748aa65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:03:34, skipping insertion in model container [2018-11-06 19:03:34,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:03:34" (3/3) ... [2018-11-06 19:03:34,368 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label07_false-unreach-call.c [2018-11-06 19:03:34,381 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:03:34,391 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:03:34,410 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:03:34,456 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:03:34,457 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:03:34,457 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:03:34,457 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:03:34,457 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:03:34,457 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:03:34,457 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:03:34,457 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:03:34,457 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:03:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-11-06 19:03:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-06 19:03:34,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:03:34,506 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:03:34,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:03:34,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:03:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984234, now seen corresponding path program 1 times [2018-11-06 19:03:34,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:03:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:03:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:34,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:03:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:03:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:03:34,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:03:34,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:03:34,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:03:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:03:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:03:34,731 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 3 states. [2018-11-06 19:03:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:03:41,577 INFO L93 Difference]: Finished difference Result 2391 states and 4632 transitions. [2018-11-06 19:03:41,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:03:41,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-06 19:03:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:03:41,614 INFO L225 Difference]: With dead ends: 2391 [2018-11-06 19:03:41,615 INFO L226 Difference]: Without dead ends: 1568 [2018-11-06 19:03:41,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:03:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-11-06 19:03:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2018-11-06 19:03:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2018-11-06 19:03:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2601 transitions. [2018-11-06 19:03:41,765 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2601 transitions. Word has length 7 [2018-11-06 19:03:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:03:41,765 INFO L480 AbstractCegarLoop]: Abstraction has 1568 states and 2601 transitions. [2018-11-06 19:03:41,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:03:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2601 transitions. [2018-11-06 19:03:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-06 19:03:41,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:03:41,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:03:41,770 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:03:41,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:03:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1382629178, now seen corresponding path program 1 times [2018-11-06 19:03:41,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:03:41,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:03:41,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:41,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:03:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:03:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:03:41,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:03:41,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:03:41,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:03:41,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:03:41,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:03:41,992 INFO L87 Difference]: Start difference. First operand 1568 states and 2601 transitions. Second operand 3 states. [2018-11-06 19:03:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:03:50,034 INFO L93 Difference]: Finished difference Result 4638 states and 7738 transitions. [2018-11-06 19:03:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:03:50,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-06 19:03:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:03:50,052 INFO L225 Difference]: With dead ends: 4638 [2018-11-06 19:03:50,053 INFO L226 Difference]: Without dead ends: 3072 [2018-11-06 19:03:50,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:03:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-11-06 19:03:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2018-11-06 19:03:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2018-11-06 19:03:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4785 transitions. [2018-11-06 19:03:50,121 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4785 transitions. Word has length 79 [2018-11-06 19:03:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:03:50,122 INFO L480 AbstractCegarLoop]: Abstraction has 3072 states and 4785 transitions. [2018-11-06 19:03:50,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:03:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4785 transitions. [2018-11-06 19:03:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-06 19:03:50,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:03:50,126 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:03:50,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:03:50,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:03:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash 901345351, now seen corresponding path program 1 times [2018-11-06 19:03:50,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:03:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:03:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:03:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:03:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:03:50,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:03:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:03:50,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:03:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:03:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:03:50,334 INFO L87 Difference]: Start difference. First operand 3072 states and 4785 transitions. Second operand 4 states. [2018-11-06 19:03:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:03:58,088 INFO L93 Difference]: Finished difference Result 12158 states and 19012 transitions. [2018-11-06 19:03:58,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:03:58,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-06 19:03:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:03:58,136 INFO L225 Difference]: With dead ends: 12158 [2018-11-06 19:03:58,137 INFO L226 Difference]: Without dead ends: 9088 [2018-11-06 19:03:58,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:03:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-11-06 19:03:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9088. [2018-11-06 19:03:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2018-11-06 19:03:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 12491 transitions. [2018-11-06 19:03:58,320 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 12491 transitions. Word has length 82 [2018-11-06 19:03:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:03:58,321 INFO L480 AbstractCegarLoop]: Abstraction has 9088 states and 12491 transitions. [2018-11-06 19:03:58,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:03:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 12491 transitions. [2018-11-06 19:03:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-06 19:03:58,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:03:58,327 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:03:58,327 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:03:58,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:03:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash 808225171, now seen corresponding path program 1 times [2018-11-06 19:03:58,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:03:58,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:03:58,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:58,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:03:58,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:03:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:03:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:03:58,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:03:58,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:03:58,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:03:58,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:03:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:03:58,635 INFO L87 Difference]: Start difference. First operand 9088 states and 12491 transitions. Second operand 4 states. [2018-11-06 19:04:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:05,840 INFO L93 Difference]: Finished difference Result 35532 states and 48960 transitions. [2018-11-06 19:04:05,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:04:05,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-06 19:04:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:05,922 INFO L225 Difference]: With dead ends: 35532 [2018-11-06 19:04:05,923 INFO L226 Difference]: Without dead ends: 26446 [2018-11-06 19:04:05,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26446 states. [2018-11-06 19:04:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26446 to 18112. [2018-11-06 19:04:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18112 states. [2018-11-06 19:04:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18112 states to 18112 states and 23341 transitions. [2018-11-06 19:04:06,335 INFO L78 Accepts]: Start accepts. Automaton has 18112 states and 23341 transitions. Word has length 89 [2018-11-06 19:04:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:06,336 INFO L480 AbstractCegarLoop]: Abstraction has 18112 states and 23341 transitions. [2018-11-06 19:04:06,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:04:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 18112 states and 23341 transitions. [2018-11-06 19:04:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-06 19:04:06,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:06,339 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:04:06,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:06,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash 395154341, now seen corresponding path program 1 times [2018-11-06 19:04:06,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:06,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:06,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:06,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:06,600 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:04:06,788 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-11-06 19:04:07,314 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-11-06 19:04:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:07,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:07,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:04:07,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:04:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:04:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:04:07,357 INFO L87 Difference]: Start difference. First operand 18112 states and 23341 transitions. Second operand 6 states. [2018-11-06 19:04:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:16,902 INFO L93 Difference]: Finished difference Result 38478 states and 49029 transitions. [2018-11-06 19:04:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:04:16,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-06 19:04:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:16,943 INFO L225 Difference]: With dead ends: 38478 [2018-11-06 19:04:16,943 INFO L226 Difference]: Without dead ends: 20368 [2018-11-06 19:04:16,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:04:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20368 states. [2018-11-06 19:04:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20368 to 20368. [2018-11-06 19:04:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20368 states. [2018-11-06 19:04:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20368 states to 20368 states and 25102 transitions. [2018-11-06 19:04:17,250 INFO L78 Accepts]: Start accepts. Automaton has 20368 states and 25102 transitions. Word has length 94 [2018-11-06 19:04:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:17,252 INFO L480 AbstractCegarLoop]: Abstraction has 20368 states and 25102 transitions. [2018-11-06 19:04:17,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:04:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20368 states and 25102 transitions. [2018-11-06 19:04:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-06 19:04:17,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:17,254 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:04:17,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:17,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1684756667, now seen corresponding path program 1 times [2018-11-06 19:04:17,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:17,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:17,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:17,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:17,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:17,947 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-06 19:04:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:18,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:04:18,160 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:04:18,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:18,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:04:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:18,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:04:18,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 19:04:18,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:04:18,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:04:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:04:18,396 INFO L87 Difference]: Start difference. First operand 20368 states and 25102 transitions. Second operand 6 states. [2018-11-06 19:04:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:33,478 INFO L93 Difference]: Finished difference Result 64078 states and 77928 transitions. [2018-11-06 19:04:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:04:33,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-06 19:04:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:33,549 INFO L225 Difference]: With dead ends: 64078 [2018-11-06 19:04:33,550 INFO L226 Difference]: Without dead ends: 42205 [2018-11-06 19:04:33,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:04:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42205 states. [2018-11-06 19:04:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42205 to 27887. [2018-11-06 19:04:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27887 states. [2018-11-06 19:04:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27887 states to 27887 states and 32191 transitions. [2018-11-06 19:04:34,147 INFO L78 Accepts]: Start accepts. Automaton has 27887 states and 32191 transitions. Word has length 149 [2018-11-06 19:04:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:34,148 INFO L480 AbstractCegarLoop]: Abstraction has 27887 states and 32191 transitions. [2018-11-06 19:04:34,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:04:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 27887 states and 32191 transitions. [2018-11-06 19:04:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-06 19:04:34,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:34,152 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:04:34,152 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:34,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:34,153 INFO L82 PathProgramCache]: Analyzing trace with hash -747845316, now seen corresponding path program 1 times [2018-11-06 19:04:34,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:34,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:34,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:34,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:34,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-06 19:04:34,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:04:34,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:04:34,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:04:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:04:34,466 INFO L87 Difference]: Start difference. First operand 27887 states and 32191 transitions. Second operand 3 states. [2018-11-06 19:04:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:39,586 INFO L93 Difference]: Finished difference Result 62540 states and 72545 transitions. [2018-11-06 19:04:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:04:39,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-11-06 19:04:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:39,637 INFO L225 Difference]: With dead ends: 62540 [2018-11-06 19:04:39,638 INFO L226 Difference]: Without dead ends: 35407 [2018-11-06 19:04:39,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:04:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35407 states. [2018-11-06 19:04:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35407 to 35407. [2018-11-06 19:04:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35407 states. [2018-11-06 19:04:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35407 states to 35407 states and 40577 transitions. [2018-11-06 19:04:40,307 INFO L78 Accepts]: Start accepts. Automaton has 35407 states and 40577 transitions. Word has length 240 [2018-11-06 19:04:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:40,308 INFO L480 AbstractCegarLoop]: Abstraction has 35407 states and 40577 transitions. [2018-11-06 19:04:40,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:04:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35407 states and 40577 transitions. [2018-11-06 19:04:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-06 19:04:40,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:40,315 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:04:40,315 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:40,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:40,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1775731377, now seen corresponding path program 1 times [2018-11-06 19:04:40,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:40,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:40,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:40,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:40,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-06 19:04:40,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:40,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:04:40,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:04:40,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:04:40,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:04:40,658 INFO L87 Difference]: Start difference. First operand 35407 states and 40577 transitions. Second operand 3 states. [2018-11-06 19:04:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:45,693 INFO L93 Difference]: Finished difference Result 70060 states and 80395 transitions. [2018-11-06 19:04:45,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:04:45,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-11-06 19:04:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:45,740 INFO L225 Difference]: With dead ends: 70060 [2018-11-06 19:04:45,741 INFO L226 Difference]: Without dead ends: 35407 [2018-11-06 19:04:45,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:04:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35407 states. [2018-11-06 19:04:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35407 to 35407. [2018-11-06 19:04:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35407 states. [2018-11-06 19:04:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35407 states to 35407 states and 39278 transitions. [2018-11-06 19:04:46,171 INFO L78 Accepts]: Start accepts. Automaton has 35407 states and 39278 transitions. Word has length 309 [2018-11-06 19:04:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:46,171 INFO L480 AbstractCegarLoop]: Abstraction has 35407 states and 39278 transitions. [2018-11-06 19:04:46,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:04:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35407 states and 39278 transitions. [2018-11-06 19:04:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-06 19:04:46,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:46,180 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:04:46,180 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:46,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1873491081, now seen corresponding path program 1 times [2018-11-06 19:04:46,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:46,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-06 19:04:46,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:46,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:04:46,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:04:46,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:04:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:04:46,462 INFO L87 Difference]: Start difference. First operand 35407 states and 39278 transitions. Second operand 3 states. [2018-11-06 19:04:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:52,524 INFO L93 Difference]: Finished difference Result 85100 states and 95124 transitions. [2018-11-06 19:04:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:04:52,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-11-06 19:04:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:52,579 INFO L225 Difference]: With dead ends: 85100 [2018-11-06 19:04:52,579 INFO L226 Difference]: Without dead ends: 50447 [2018-11-06 19:04:52,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:04:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50447 states. [2018-11-06 19:04:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50447 to 50447. [2018-11-06 19:04:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50447 states. [2018-11-06 19:04:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50447 states to 50447 states and 55975 transitions. [2018-11-06 19:04:53,151 INFO L78 Accepts]: Start accepts. Automaton has 50447 states and 55975 transitions. Word has length 337 [2018-11-06 19:04:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:53,152 INFO L480 AbstractCegarLoop]: Abstraction has 50447 states and 55975 transitions. [2018-11-06 19:04:53,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:04:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 50447 states and 55975 transitions. [2018-11-06 19:04:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-11-06 19:04:53,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:53,164 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:04:53,164 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:53,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1307002014, now seen corresponding path program 1 times [2018-11-06 19:04:53,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:53,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:53,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-06 19:04:53,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:53,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:04:53,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:04:53,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:04:53,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:53,617 INFO L87 Difference]: Start difference. First operand 50447 states and 55975 transitions. Second operand 4 states. [2018-11-06 19:04:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:59,897 INFO L93 Difference]: Finished difference Result 100140 states and 111191 transitions. [2018-11-06 19:04:59,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:04:59,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 397 [2018-11-06 19:04:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:59,953 INFO L225 Difference]: With dead ends: 100140 [2018-11-06 19:04:59,953 INFO L226 Difference]: Without dead ends: 50447 [2018-11-06 19:04:59,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:05:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50447 states. [2018-11-06 19:05:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50447 to 50447. [2018-11-06 19:05:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50447 states. [2018-11-06 19:05:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50447 states to 50447 states and 53496 transitions. [2018-11-06 19:05:00,411 INFO L78 Accepts]: Start accepts. Automaton has 50447 states and 53496 transitions. Word has length 397 [2018-11-06 19:05:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:00,412 INFO L480 AbstractCegarLoop]: Abstraction has 50447 states and 53496 transitions. [2018-11-06 19:05:00,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:05:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 50447 states and 53496 transitions. [2018-11-06 19:05:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-06 19:05:00,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:00,427 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:05:00,427 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:00,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash 823321056, now seen corresponding path program 1 times [2018-11-06 19:05:00,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:00,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:00,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-11-06 19:05:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:00,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:05:00,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:05:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:05:00,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:05:00,764 INFO L87 Difference]: Start difference. First operand 50447 states and 53496 transitions. Second operand 3 states. [2018-11-06 19:05:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:04,839 INFO L93 Difference]: Finished difference Result 100888 states and 107108 transitions. [2018-11-06 19:05:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:05:04,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2018-11-06 19:05:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:04,890 INFO L225 Difference]: With dead ends: 100888 [2018-11-06 19:05:04,891 INFO L226 Difference]: Without dead ends: 51195 [2018-11-06 19:05:04,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:05:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51195 states. [2018-11-06 19:05:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51195 to 51195. [2018-11-06 19:05:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51195 states. [2018-11-06 19:05:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51195 states to 51195 states and 53599 transitions. [2018-11-06 19:05:05,332 INFO L78 Accepts]: Start accepts. Automaton has 51195 states and 53599 transitions. Word has length 419 [2018-11-06 19:05:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:05,333 INFO L480 AbstractCegarLoop]: Abstraction has 51195 states and 53599 transitions. [2018-11-06 19:05:05,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:05:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51195 states and 53599 transitions. [2018-11-06 19:05:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-11-06 19:05:05,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:05,354 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:05:05,354 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:05,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:05,354 INFO L82 PathProgramCache]: Analyzing trace with hash -195895467, now seen corresponding path program 1 times [2018-11-06 19:05:05,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:05,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:05,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:05,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:05,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:05,931 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:05:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-06 19:05:06,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:06,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:05:06,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:05:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:05:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:05:06,114 INFO L87 Difference]: Start difference. First operand 51195 states and 53599 transitions. Second operand 4 states. [2018-11-06 19:05:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:10,875 INFO L93 Difference]: Finished difference Result 123444 states and 129460 transitions. [2018-11-06 19:05:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:05:10,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 602 [2018-11-06 19:05:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:10,943 INFO L225 Difference]: With dead ends: 123444 [2018-11-06 19:05:10,943 INFO L226 Difference]: Without dead ends: 73003 [2018-11-06 19:05:10,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:05:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73003 states. [2018-11-06 19:05:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73003 to 73003. [2018-11-06 19:05:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73003 states. [2018-11-06 19:05:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73003 states to 73003 states and 76364 transitions. [2018-11-06 19:05:11,524 INFO L78 Accepts]: Start accepts. Automaton has 73003 states and 76364 transitions. Word has length 602 [2018-11-06 19:05:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:11,525 INFO L480 AbstractCegarLoop]: Abstraction has 73003 states and 76364 transitions. [2018-11-06 19:05:11,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:05:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 73003 states and 76364 transitions. [2018-11-06 19:05:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-11-06 19:05:11,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:11,544 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:05:11,544 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:11,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash -998756597, now seen corresponding path program 1 times [2018-11-06 19:05:11,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:11,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-06 19:05:12,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:12,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:05:12,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:05:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:05:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:05:12,222 INFO L87 Difference]: Start difference. First operand 73003 states and 76364 transitions. Second operand 4 states. [2018-11-06 19:05:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:18,921 INFO L93 Difference]: Finished difference Result 145252 states and 151969 transitions. [2018-11-06 19:05:18,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:05:18,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 606 [2018-11-06 19:05:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:19,005 INFO L225 Difference]: With dead ends: 145252 [2018-11-06 19:05:19,006 INFO L226 Difference]: Without dead ends: 71495 [2018-11-06 19:05:19,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:05:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71495 states. [2018-11-06 19:05:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71495 to 71495. [2018-11-06 19:05:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71495 states. [2018-11-06 19:05:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71495 states to 71495 states and 74522 transitions. [2018-11-06 19:05:19,825 INFO L78 Accepts]: Start accepts. Automaton has 71495 states and 74522 transitions. Word has length 606 [2018-11-06 19:05:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:19,826 INFO L480 AbstractCegarLoop]: Abstraction has 71495 states and 74522 transitions. [2018-11-06 19:05:19,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:05:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 71495 states and 74522 transitions. [2018-11-06 19:05:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-11-06 19:05:19,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:19,857 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:05:19,857 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:19,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1070355263, now seen corresponding path program 1 times [2018-11-06 19:05:19,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:19,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:19,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-06 19:05:20,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:20,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:05:20,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:05:20,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:05:20,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:05:20,358 INFO L87 Difference]: Start difference. First operand 71495 states and 74522 transitions. Second operand 3 states. [2018-11-06 19:05:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:25,470 INFO L93 Difference]: Finished difference Result 179833 states and 187831 transitions. [2018-11-06 19:05:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:05:25,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 635 [2018-11-06 19:05:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:25,583 INFO L225 Difference]: With dead ends: 179833 [2018-11-06 19:05:25,583 INFO L226 Difference]: Without dead ends: 109092 [2018-11-06 19:05:25,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:05:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109092 states. [2018-11-06 19:05:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109092 to 106836. [2018-11-06 19:05:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106836 states. [2018-11-06 19:05:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106836 states to 106836 states and 110702 transitions. [2018-11-06 19:05:26,497 INFO L78 Accepts]: Start accepts. Automaton has 106836 states and 110702 transitions. Word has length 635 [2018-11-06 19:05:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:26,497 INFO L480 AbstractCegarLoop]: Abstraction has 106836 states and 110702 transitions. [2018-11-06 19:05:26,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:05:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 106836 states and 110702 transitions. [2018-11-06 19:05:26,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-11-06 19:05:26,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:26,519 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:05:26,520 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:26,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:26,520 INFO L82 PathProgramCache]: Analyzing trace with hash -301306774, now seen corresponding path program 1 times [2018-11-06 19:05:26,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:26,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:26,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:26,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:26,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-06 19:05:27,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:27,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:05:27,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:05:27,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:05:27,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:05:27,142 INFO L87 Difference]: Start difference. First operand 106836 states and 110702 transitions. Second operand 6 states. [2018-11-06 19:05:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:35,344 INFO L93 Difference]: Finished difference Result 213475 states and 221202 transitions. [2018-11-06 19:05:35,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:05:35,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 672 [2018-11-06 19:05:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:35,432 INFO L225 Difference]: With dead ends: 213475 [2018-11-06 19:05:35,433 INFO L226 Difference]: Without dead ends: 93081 [2018-11-06 19:05:35,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:05:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93081 states. [2018-11-06 19:05:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93081 to 89516. [2018-11-06 19:05:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89516 states. [2018-11-06 19:05:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89516 states to 89516 states and 91810 transitions. [2018-11-06 19:05:36,289 INFO L78 Accepts]: Start accepts. Automaton has 89516 states and 91810 transitions. Word has length 672 [2018-11-06 19:05:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:36,289 INFO L480 AbstractCegarLoop]: Abstraction has 89516 states and 91810 transitions. [2018-11-06 19:05:36,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:05:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 89516 states and 91810 transitions. [2018-11-06 19:05:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-11-06 19:05:36,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:36,306 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:05:36,306 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:36,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash 625184252, now seen corresponding path program 1 times [2018-11-06 19:05:36,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:36,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:36,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:37,015 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:05:37,358 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-11-06 19:05:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 26 proven. 634 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-06 19:05:38,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:05:38,279 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:05:38,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:38,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:05:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-06 19:05:39,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:05:39,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-11-06 19:05:39,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:05:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:05:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:05:39,504 INFO L87 Difference]: Start difference. First operand 89516 states and 91810 transitions. Second operand 9 states. [2018-11-06 19:06:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:01,026 INFO L93 Difference]: Finished difference Result 197079 states and 202146 transitions. [2018-11-06 19:06:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 19:06:01,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 689 [2018-11-06 19:06:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:01,127 INFO L225 Difference]: With dead ends: 197079 [2018-11-06 19:06:01,128 INFO L226 Difference]: Without dead ends: 100787 [2018-11-06 19:06:01,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 696 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-06 19:06:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100787 states. [2018-11-06 19:06:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100787 to 81987. [2018-11-06 19:06:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81987 states. [2018-11-06 19:06:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81987 states to 81987 states and 84103 transitions. [2018-11-06 19:06:02,285 INFO L78 Accepts]: Start accepts. Automaton has 81987 states and 84103 transitions. Word has length 689 [2018-11-06 19:06:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:02,286 INFO L480 AbstractCegarLoop]: Abstraction has 81987 states and 84103 transitions. [2018-11-06 19:06:02,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:06:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 81987 states and 84103 transitions. [2018-11-06 19:06:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2018-11-06 19:06:02,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:02,309 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:06:02,309 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:02,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1460066374, now seen corresponding path program 1 times [2018-11-06 19:06:02,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:02,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:02,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:02,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:02,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 150 proven. 591 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-06 19:06:03,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:06:03,913 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:06:03,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:04,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:06:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-11-06 19:06:04,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:06:04,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-06 19:06:04,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:06:04,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:06:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:06:04,777 INFO L87 Difference]: Start difference. First operand 81987 states and 84103 transitions. Second operand 11 states. [2018-11-06 19:06:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:35,208 INFO L93 Difference]: Finished difference Result 202348 states and 207694 transitions. [2018-11-06 19:06:35,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 19:06:35,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 728 [2018-11-06 19:06:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:35,366 INFO L225 Difference]: With dead ends: 202348 [2018-11-06 19:06:35,367 INFO L226 Difference]: Without dead ends: 118102 [2018-11-06 19:06:35,415 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-11-06 19:06:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118102 states. [2018-11-06 19:06:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118102 to 79727. [2018-11-06 19:06:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79727 states. [2018-11-06 19:06:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79727 states to 79727 states and 81538 transitions. [2018-11-06 19:06:36,264 INFO L78 Accepts]: Start accepts. Automaton has 79727 states and 81538 transitions. Word has length 728 [2018-11-06 19:06:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:36,265 INFO L480 AbstractCegarLoop]: Abstraction has 79727 states and 81538 transitions. [2018-11-06 19:06:36,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:06:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 79727 states and 81538 transitions. [2018-11-06 19:06:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-11-06 19:06:36,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:36,289 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:06:36,289 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:36,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 429350737, now seen corresponding path program 1 times [2018-11-06 19:06:36,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:36,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:36,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:36,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:36,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 19:06:37,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:06:37,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:06:37,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:06:37,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:06:37,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:37,450 INFO L87 Difference]: Start difference. First operand 79727 states and 81538 transitions. Second operand 4 states. [2018-11-06 19:06:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:42,646 INFO L93 Difference]: Finished difference Result 163212 states and 166913 transitions. [2018-11-06 19:06:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:06:42,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 739 [2018-11-06 19:06:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:42,733 INFO L225 Difference]: With dead ends: 163212 [2018-11-06 19:06:42,733 INFO L226 Difference]: Without dead ends: 84239 [2018-11-06 19:06:42,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84239 states. [2018-11-06 19:06:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84239 to 78975. [2018-11-06 19:06:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78975 states. [2018-11-06 19:06:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78975 states to 78975 states and 80749 transitions. [2018-11-06 19:06:43,411 INFO L78 Accepts]: Start accepts. Automaton has 78975 states and 80749 transitions. Word has length 739 [2018-11-06 19:06:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:43,411 INFO L480 AbstractCegarLoop]: Abstraction has 78975 states and 80749 transitions. [2018-11-06 19:06:43,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:06:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78975 states and 80749 transitions. [2018-11-06 19:06:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-11-06 19:06:43,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:43,428 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:06:43,428 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:43,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash -394278024, now seen corresponding path program 1 times [2018-11-06 19:06:43,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:43,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:43,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:43,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:43,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-06 19:06:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:06:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:06:44,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:06:44,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:06:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:06:44,673 INFO L87 Difference]: Start difference. First operand 78975 states and 80749 transitions. Second operand 5 states. [2018-11-06 19:06:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:50,597 INFO L93 Difference]: Finished difference Result 159452 states and 163044 transitions. [2018-11-06 19:06:50,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:06:50,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 773 [2018-11-06 19:06:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:50,669 INFO L225 Difference]: With dead ends: 159452 [2018-11-06 19:06:50,669 INFO L226 Difference]: Without dead ends: 78971 [2018-11-06 19:06:50,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:06:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78971 states. [2018-11-06 19:06:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78971 to 77467. [2018-11-06 19:06:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77467 states. [2018-11-06 19:06:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77467 states to 77467 states and 79166 transitions. [2018-11-06 19:06:51,739 INFO L78 Accepts]: Start accepts. Automaton has 77467 states and 79166 transitions. Word has length 773 [2018-11-06 19:06:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:51,740 INFO L480 AbstractCegarLoop]: Abstraction has 77467 states and 79166 transitions. [2018-11-06 19:06:51,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:06:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 77467 states and 79166 transitions. [2018-11-06 19:06:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2018-11-06 19:06:51,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:51,761 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:06:51,761 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:51,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:51,762 INFO L82 PathProgramCache]: Analyzing trace with hash 124236343, now seen corresponding path program 1 times [2018-11-06 19:06:51,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:51,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:51,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:52,412 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:06:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-11-06 19:06:53,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:06:53,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:06:53,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:06:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:06:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:53,174 INFO L87 Difference]: Start difference. First operand 77467 states and 79166 transitions. Second operand 4 states. [2018-11-06 19:06:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:58,825 INFO L93 Difference]: Finished difference Result 156436 states and 159855 transitions. [2018-11-06 19:06:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:06:58,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 815 [2018-11-06 19:06:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:58,894 INFO L225 Difference]: With dead ends: 156436 [2018-11-06 19:06:58,894 INFO L226 Difference]: Without dead ends: 79723 [2018-11-06 19:06:58,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79723 states. [2018-11-06 19:06:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79723 to 77467. [2018-11-06 19:06:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77467 states. [2018-11-06 19:06:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77467 states to 77467 states and 79160 transitions. [2018-11-06 19:06:59,666 INFO L78 Accepts]: Start accepts. Automaton has 77467 states and 79160 transitions. Word has length 815 [2018-11-06 19:06:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:59,667 INFO L480 AbstractCegarLoop]: Abstraction has 77467 states and 79160 transitions. [2018-11-06 19:06:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:06:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 77467 states and 79160 transitions. [2018-11-06 19:06:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2018-11-06 19:06:59,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:59,698 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:06:59,698 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:59,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1893959463, now seen corresponding path program 1 times [2018-11-06 19:06:59,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:59,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:59,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:07:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-06 19:07:00,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:07:00,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:07:00,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:07:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:07:00,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:00,474 INFO L87 Difference]: Start difference. First operand 77467 states and 79160 transitions. Second operand 4 states. [2018-11-06 19:07:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:07:06,577 INFO L93 Difference]: Finished difference Result 166212 states and 170066 transitions. [2018-11-06 19:07:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:07:06,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 840 [2018-11-06 19:07:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:07:06,669 INFO L225 Difference]: With dead ends: 166212 [2018-11-06 19:07:06,669 INFO L226 Difference]: Without dead ends: 89499 [2018-11-06 19:07:06,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89499 states. [2018-11-06 19:07:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89499 to 88747. [2018-11-06 19:07:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88747 states. [2018-11-06 19:07:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88747 states to 88747 states and 90627 transitions. [2018-11-06 19:07:07,557 INFO L78 Accepts]: Start accepts. Automaton has 88747 states and 90627 transitions. Word has length 840 [2018-11-06 19:07:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:07:07,558 INFO L480 AbstractCegarLoop]: Abstraction has 88747 states and 90627 transitions. [2018-11-06 19:07:07,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:07:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 88747 states and 90627 transitions. [2018-11-06 19:07:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-11-06 19:07:07,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:07:07,588 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:07:07,589 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:07:07,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:07:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash 903506855, now seen corresponding path program 1 times [2018-11-06 19:07:07,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:07:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:07:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:07:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:07:08,324 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:07:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 19:07:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:07:09,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:07:09,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:07:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:07:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:09,470 INFO L87 Difference]: Start difference. First operand 88747 states and 90627 transitions. Second operand 4 states. Received shutdown request... [2018-11-06 19:07:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:07:10,732 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:07:10,737 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:07:10,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:07:10 BoogieIcfgContainer [2018-11-06 19:07:10,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:07:10,738 INFO L168 Benchmark]: Toolchain (without parser) took 228405.50 ms. Allocated memory was 1.6 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 871.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:10,739 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:07:10,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2259.14 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:10,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 595.10 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 815.8 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:10,741 INFO L168 Benchmark]: Boogie Preprocessor took 301.91 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:10,741 INFO L168 Benchmark]: RCFGBuilder took 8866.59 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 201.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -136.8 MB). Peak memory consumption was 598.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:10,742 INFO L168 Benchmark]: TraceAbstraction took 216377.29 ms. Allocated memory was 2.6 GB in the beginning and 4.0 GB in the end (delta: 1.4 GB). Free memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: -649.0 MB). Peak memory consumption was 746.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:10,747 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.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2259.14 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 595.10 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 815.8 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 301.91 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8866.59 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 201.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -136.8 MB). Peak memory consumption was 598.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216377.29 ms. Allocated memory was 2.6 GB in the beginning and 4.0 GB in the end (delta: 1.4 GB). Free memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: -649.0 MB). Peak memory consumption was 746.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (88747states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (2735 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 216.2s OverallTime, 22 OverallIterations, 6 TraceHistogramMax, 184.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16400 SDtfs, 53896 SDslu, 1760 SDs, 0 SdLazy, 116069 SolverSat, 13919 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 143.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 1622 SyntacticMatches, 20 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106836occurred in iteration=14, 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: 12.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 95424 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 11738 NumberOfCodeBlocks, 11738 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 11713 ConstructedInterpolants, 0 QuantifiedInterpolants, 24746747 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 11304/12534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown