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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:07:41,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:07:41,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:07:41,370 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:07:41,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:07:41,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:07:41,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:07:41,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:07:41,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:07:41,378 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:07:41,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:07:41,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:07:41,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:07:41,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:07:41,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:07:41,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:07:41,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:07:41,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:07:41,389 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:07:41,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:07:41,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:07:41,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:07:41,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:07:41,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:07:41,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:07:41,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:07:41,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:07:41,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:07:41,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:07:41,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:07:41,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:07:41,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:07:41,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:07:41,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:07:41,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:07:41,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:07:41,408 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:07:41,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:07:41,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:07:41,427 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:07:41,427 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:07:41,427 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:07:41,427 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:07:41,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:07:41,428 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:07:41,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:07:41,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:07:41,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:07:41,429 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:07:41,430 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:07:41,430 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:07:41,431 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:07:41,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:07:41,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:07:41,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:07:41,500 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:07:41,501 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:07:41,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-15 15:07:41,502 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-15 15:07:41,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:07:41,611 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:07:41,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:07:41,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:07:41,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:07:41,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:07:41,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:07:41,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:07:41,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:07:41,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:07:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:07:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:07:42,994 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:07:42,995 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:42 BoogieIcfgContainer [2018-10-15 15:07:42,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:07:42,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:07:42,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:07:43,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:07:43,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/2) ... [2018-10-15 15:07:43,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52298904 and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:43, skipping insertion in model container [2018-10-15 15:07:43,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:42" (2/2) ... [2018-10-15 15:07:43,003 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-15 15:07:43,013 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:07:43,022 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:07:43,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:07:43,065 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:07:43,066 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:07:43,066 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:07:43,066 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:07:43,066 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:07:43,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:07:43,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:07:43,067 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:07:43,067 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:07:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states. [2018-10-15 15:07:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 15:07:43,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:43,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:43,121 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:43,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash -872407173, now seen corresponding path program 1 times [2018-10-15 15:07:43,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:43,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:43,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:43,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:43,726 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 3 states. [2018-10-15 15:07:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:43,810 INFO L93 Difference]: Finished difference Result 393 states and 406 transitions. [2018-10-15 15:07:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:43,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2018-10-15 15:07:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:43,832 INFO L225 Difference]: With dead ends: 393 [2018-10-15 15:07:43,832 INFO L226 Difference]: Without dead ends: 393 [2018-10-15 15:07:43,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-15 15:07:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2018-10-15 15:07:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-15 15:07:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 404 transitions. [2018-10-15 15:07:43,906 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 404 transitions. Word has length 267 [2018-10-15 15:07:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:43,907 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 404 transitions. [2018-10-15 15:07:43,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 404 transitions. [2018-10-15 15:07:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 15:07:43,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:43,917 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:43,918 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:43,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:43,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1604013356, now seen corresponding path program 1 times [2018-10-15 15:07:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:44,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:44,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:07:44,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:07:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:07:44,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:07:44,640 INFO L87 Difference]: Start difference. First operand 390 states and 404 transitions. Second operand 8 states. [2018-10-15 15:07:45,080 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:07:45,610 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 15:07:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:45,770 INFO L93 Difference]: Finished difference Result 612 states and 639 transitions. [2018-10-15 15:07:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:07:45,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 269 [2018-10-15 15:07:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:45,784 INFO L225 Difference]: With dead ends: 612 [2018-10-15 15:07:45,785 INFO L226 Difference]: Without dead ends: 612 [2018-10-15 15:07:45,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:07:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-10-15 15:07:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 408. [2018-10-15 15:07:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-15 15:07:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 422 transitions. [2018-10-15 15:07:45,814 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 422 transitions. Word has length 269 [2018-10-15 15:07:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:45,815 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 422 transitions. [2018-10-15 15:07:45,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:07:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 422 transitions. [2018-10-15 15:07:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 15:07:45,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:45,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:45,821 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:45,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash 301075917, now seen corresponding path program 1 times [2018-10-15 15:07:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:46,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:46,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:46,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:46,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:46,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,142 INFO L87 Difference]: Start difference. First operand 408 states and 422 transitions. Second operand 3 states. [2018-10-15 15:07:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:46,199 INFO L93 Difference]: Finished difference Result 590 states and 615 transitions. [2018-10-15 15:07:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:46,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2018-10-15 15:07:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:46,203 INFO L225 Difference]: With dead ends: 590 [2018-10-15 15:07:46,203 INFO L226 Difference]: Without dead ends: 590 [2018-10-15 15:07:46,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-15 15:07:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 586. [2018-10-15 15:07:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-10-15 15:07:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 611 transitions. [2018-10-15 15:07:46,227 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 611 transitions. Word has length 270 [2018-10-15 15:07:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:46,228 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 611 transitions. [2018-10-15 15:07:46,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 611 transitions. [2018-10-15 15:07:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-15 15:07:46,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:46,242 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:46,243 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:46,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:46,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2014046642, now seen corresponding path program 1 times [2018-10-15 15:07:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:46,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:46,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:46,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:46,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,434 INFO L87 Difference]: Start difference. First operand 586 states and 611 transitions. Second operand 3 states. [2018-10-15 15:07:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:46,460 INFO L93 Difference]: Finished difference Result 789 states and 826 transitions. [2018-10-15 15:07:46,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:46,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2018-10-15 15:07:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:46,469 INFO L225 Difference]: With dead ends: 789 [2018-10-15 15:07:46,469 INFO L226 Difference]: Without dead ends: 789 [2018-10-15 15:07:46,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-15 15:07:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 786. [2018-10-15 15:07:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2018-10-15 15:07:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 824 transitions. [2018-10-15 15:07:46,486 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 824 transitions. Word has length 273 [2018-10-15 15:07:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:46,486 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 824 transitions. [2018-10-15 15:07:46,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 824 transitions. [2018-10-15 15:07:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-15 15:07:46,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:46,493 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:46,493 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:46,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1272098683, now seen corresponding path program 1 times [2018-10-15 15:07:46,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:46,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:46,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:46,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,698 INFO L87 Difference]: Start difference. First operand 786 states and 824 transitions. Second operand 3 states. [2018-10-15 15:07:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:46,797 INFO L93 Difference]: Finished difference Result 1355 states and 1425 transitions. [2018-10-15 15:07:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:46,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2018-10-15 15:07:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:46,807 INFO L225 Difference]: With dead ends: 1355 [2018-10-15 15:07:46,807 INFO L226 Difference]: Without dead ends: 1355 [2018-10-15 15:07:46,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-10-15 15:07:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1328. [2018-10-15 15:07:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-10-15 15:07:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1399 transitions. [2018-10-15 15:07:46,844 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1399 transitions. Word has length 345 [2018-10-15 15:07:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:46,845 INFO L481 AbstractCegarLoop]: Abstraction has 1328 states and 1399 transitions. [2018-10-15 15:07:46,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1399 transitions. [2018-10-15 15:07:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-15 15:07:46,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:46,849 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:46,849 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:46,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1712133534, now seen corresponding path program 1 times [2018-10-15 15:07:46,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-15 15:07:47,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:47,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:47,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:47,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:47,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,058 INFO L87 Difference]: Start difference. First operand 1328 states and 1399 transitions. Second operand 3 states. [2018-10-15 15:07:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:47,142 INFO L93 Difference]: Finished difference Result 1331 states and 1395 transitions. [2018-10-15 15:07:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:47,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2018-10-15 15:07:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:47,149 INFO L225 Difference]: With dead ends: 1331 [2018-10-15 15:07:47,149 INFO L226 Difference]: Without dead ends: 1331 [2018-10-15 15:07:47,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2018-10-15 15:07:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1328. [2018-10-15 15:07:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-10-15 15:07:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1393 transitions. [2018-10-15 15:07:47,173 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1393 transitions. Word has length 346 [2018-10-15 15:07:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:47,173 INFO L481 AbstractCegarLoop]: Abstraction has 1328 states and 1393 transitions. [2018-10-15 15:07:47,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1393 transitions. [2018-10-15 15:07:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-15 15:07:47,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:47,177 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:47,177 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:47,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1291459484, now seen corresponding path program 2 times [2018-10-15 15:07:47,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:47,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:47,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:47,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:47,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,411 INFO L87 Difference]: Start difference. First operand 1328 states and 1393 transitions. Second operand 3 states. [2018-10-15 15:07:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:47,514 INFO L93 Difference]: Finished difference Result 2421 states and 2539 transitions. [2018-10-15 15:07:47,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:47,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2018-10-15 15:07:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:47,525 INFO L225 Difference]: With dead ends: 2421 [2018-10-15 15:07:47,525 INFO L226 Difference]: Without dead ends: 2421 [2018-10-15 15:07:47,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2018-10-15 15:07:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2370. [2018-10-15 15:07:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2018-10-15 15:07:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2489 transitions. [2018-10-15 15:07:47,566 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2489 transitions. Word has length 346 [2018-10-15 15:07:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:47,567 INFO L481 AbstractCegarLoop]: Abstraction has 2370 states and 2489 transitions. [2018-10-15 15:07:47,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2489 transitions. [2018-10-15 15:07:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 15:07:47,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:47,571 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:47,571 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:47,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1899963626, now seen corresponding path program 1 times [2018-10-15 15:07:47,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-15 15:07:47,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:47,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:47,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,787 INFO L87 Difference]: Start difference. First operand 2370 states and 2489 transitions. Second operand 3 states. [2018-10-15 15:07:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:47,876 INFO L93 Difference]: Finished difference Result 1289 states and 1341 transitions. [2018-10-15 15:07:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:47,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-15 15:07:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:47,882 INFO L225 Difference]: With dead ends: 1289 [2018-10-15 15:07:47,883 INFO L226 Difference]: Without dead ends: 1289 [2018-10-15 15:07:47,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-15 15:07:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1286. [2018-10-15 15:07:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2018-10-15 15:07:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1339 transitions. [2018-10-15 15:07:47,904 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1339 transitions. Word has length 347 [2018-10-15 15:07:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:47,905 INFO L481 AbstractCegarLoop]: Abstraction has 1286 states and 1339 transitions. [2018-10-15 15:07:47,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1339 transitions. [2018-10-15 15:07:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 15:07:47,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:47,908 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:47,908 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:47,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1082445736, now seen corresponding path program 2 times [2018-10-15 15:07:47,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:48,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:48,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:48,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:48,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:48,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:48,166 INFO L87 Difference]: Start difference. First operand 1286 states and 1339 transitions. Second operand 3 states. [2018-10-15 15:07:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:48,285 INFO L93 Difference]: Finished difference Result 2337 states and 2431 transitions. [2018-10-15 15:07:48,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:48,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-15 15:07:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:48,297 INFO L225 Difference]: With dead ends: 2337 [2018-10-15 15:07:48,298 INFO L226 Difference]: Without dead ends: 2337 [2018-10-15 15:07:48,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2018-10-15 15:07:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2286. [2018-10-15 15:07:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2018-10-15 15:07:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 2381 transitions. [2018-10-15 15:07:48,352 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 2381 transitions. Word has length 347 [2018-10-15 15:07:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:48,353 INFO L481 AbstractCegarLoop]: Abstraction has 2286 states and 2381 transitions. [2018-10-15 15:07:48,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2381 transitions. [2018-10-15 15:07:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:07:48,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:48,357 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:48,357 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:48,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2008254502, now seen corresponding path program 1 times [2018-10-15 15:07:48,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:48,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:48,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:48,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:48,625 INFO L87 Difference]: Start difference. First operand 2286 states and 2381 transitions. Second operand 3 states. [2018-10-15 15:07:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:48,749 INFO L93 Difference]: Finished difference Result 4301 states and 4467 transitions. [2018-10-15 15:07:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:48,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-15 15:07:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:48,766 INFO L225 Difference]: With dead ends: 4301 [2018-10-15 15:07:48,766 INFO L226 Difference]: Without dead ends: 4301 [2018-10-15 15:07:48,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2018-10-15 15:07:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4202. [2018-10-15 15:07:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4202 states. [2018-10-15 15:07:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4202 states to 4202 states and 4369 transitions. [2018-10-15 15:07:48,840 INFO L78 Accepts]: Start accepts. Automaton has 4202 states and 4369 transitions. Word has length 348 [2018-10-15 15:07:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:48,841 INFO L481 AbstractCegarLoop]: Abstraction has 4202 states and 4369 transitions. [2018-10-15 15:07:48,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4202 states and 4369 transitions. [2018-10-15 15:07:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:07:48,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:48,846 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:48,846 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:48,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:48,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1907789620, now seen corresponding path program 1 times [2018-10-15 15:07:48,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-15 15:07:49,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:49,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:49,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:49,167 INFO L87 Difference]: Start difference. First operand 4202 states and 4369 transitions. Second operand 3 states. [2018-10-15 15:07:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:49,263 INFO L93 Difference]: Finished difference Result 2205 states and 2275 transitions. [2018-10-15 15:07:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:49,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-10-15 15:07:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:49,274 INFO L225 Difference]: With dead ends: 2205 [2018-10-15 15:07:49,274 INFO L226 Difference]: Without dead ends: 2205 [2018-10-15 15:07:49,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-15 15:07:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2202. [2018-10-15 15:07:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-10-15 15:07:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2273 transitions. [2018-10-15 15:07:49,309 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2273 transitions. Word has length 349 [2018-10-15 15:07:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:49,309 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 2273 transitions. [2018-10-15 15:07:49,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2273 transitions. [2018-10-15 15:07:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:07:49,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:49,313 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:49,314 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:49,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:49,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2104798662, now seen corresponding path program 2 times [2018-10-15 15:07:49,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:49,774 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:07:50,000 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-15 15:07:50,619 WARN L179 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-15 15:07:50,873 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-15 15:07:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 38 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:51,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:07:51,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:07:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:07:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:07:51,721 INFO L87 Difference]: Start difference. First operand 2202 states and 2273 transitions. Second operand 10 states. [2018-10-15 15:07:52,606 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-10-15 15:07:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:53,554 INFO L93 Difference]: Finished difference Result 447 states and 446 transitions. [2018-10-15 15:07:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:07:53,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 349 [2018-10-15 15:07:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:53,556 INFO L225 Difference]: With dead ends: 447 [2018-10-15 15:07:53,557 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:07:53,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:07:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:07:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:07:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:07:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:07:53,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 349 [2018-10-15 15:07:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:53,559 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:07:53,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:07:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:07:53,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:07:53,564 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:07:53 BoogieIcfgContainer [2018-10-15 15:07:53,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:07:53,565 INFO L168 Benchmark]: Toolchain (without parser) took 11955.46 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 73.4 MB). Peak memory consumption was 514.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:53,567 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:07:53,567 INFO L168 Benchmark]: Boogie Preprocessor took 86.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:07:53,568 INFO L168 Benchmark]: RCFGBuilder took 1295.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:53,569 INFO L168 Benchmark]: TraceAbstraction took 10567.98 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 20.6 MB). Peak memory consumption was 461.5 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:53,572 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1295.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10567.98 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 20.6 MB). Peak memory consumption was 461.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 300 locations, 1 error locations. SAFE Result, 10.5s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4210 SDtfs, 1981 SDslu, 5577 SDs, 0 SdLazy, 405 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4202occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 451 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3856 NumberOfCodeBlocks, 3856 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3844 ConstructedInterpolants, 0 QuantifiedInterpolants, 4185464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 447/461 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-07-53-583.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-07-53-583.csv Received shutdown request...