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/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:18:47,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:18:47,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:18:47,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:18:47,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:18:47,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:18:47,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:18:47,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:18:47,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:18:47,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:18:47,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:18:47,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:18:47,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:18:47,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:18:47,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:18:47,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:18:47,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:18:47,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:18:47,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:18:47,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:18:47,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:18:47,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:18:47,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:18:47,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:18:47,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:18:47,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:18:47,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:18:47,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:18:47,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:18:47,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:18:47,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:18:47,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:18:47,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:18:47,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:18:47,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:18:47,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:18:47,504 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:18:47,519 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:18:47,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:18:47,520 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:18:47,520 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:18:47,521 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:18:47,521 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:18:47,521 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:18:47,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:18:47,522 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:18:47,522 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:18:47,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:18:47,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:18:47,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:18:47,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:18:47,523 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:18:47,523 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:18:47,523 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:18:47,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:18:47,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:18:47,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:18:47,524 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:18:47,524 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:18:47,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:18:47,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:18:47,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:18:47,525 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:18:47,525 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:18:47,525 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:18:47,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:18:47,526 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:18:47,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:18:47,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:18:47,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:18:47,600 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:18:47,601 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:18:47,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl [2018-10-04 12:18:47,602 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl' [2018-10-04 12:18:47,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:18:47,703 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:18:47,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:18:47,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:18:47,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:18:47,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:18:47,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:18:47,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:18:47,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:18:47,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/1) ... [2018-10-04 12:18:47,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:18:47,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:18:47,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:18:47,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:18:47,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (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-10-04 12:18:47,852 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 12:18:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:18:47,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:18:48,507 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:18:48,507 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:18:48 BoogieIcfgContainer [2018-10-04 12:18:48,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:18:48,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:18:48,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:18:48,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:18:48,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:47" (1/2) ... [2018-10-04 12:18:48,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3afb45 and model type pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:18:48, skipping insertion in model container [2018-10-04 12:18:48,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:18:48" (2/2) ... [2018-10-04 12:18:48,515 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl [2018-10-04 12:18:48,523 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:18:48,532 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:18:48,582 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:18:48,582 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:18:48,583 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:18:48,583 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:18:48,583 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:18:48,583 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:18:48,583 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:18:48,583 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:18:48,584 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:18:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 12:18:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:48,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:48,607 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:48,608 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:48,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-04 12:18:48,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:48,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:48,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:48,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:48,812 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-04 12:18:48,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:48,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:48,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:48,837 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-04 12:18:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:48,889 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-10-04 12:18:48,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:48,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:18:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:48,902 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:18:48,902 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:18:48,906 INFO L605 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-10-04 12:18:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:18:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:18:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:18:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 12:18:48,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-10-04 12:18:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:48,949 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 12:18:48,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 12:18:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:48,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:48,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:48,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:48,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2078913255, now seen corresponding path program 1 times [2018-10-04 12:18:48,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:48,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:48,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:49,076 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-04 12:18:49,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:49,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:49,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:49,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:49,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:49,080 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-10-04 12:18:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:49,157 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2018-10-04 12:18:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:49,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:18:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:49,159 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:18:49,159 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:18:49,160 INFO L605 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-10-04 12:18:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:18:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-04 12:18:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:18:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-10-04 12:18:49,170 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 14 [2018-10-04 12:18:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:49,170 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-10-04 12:18:49,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-10-04 12:18:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:49,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:49,172 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:49,172 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:49,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2136171557, now seen corresponding path program 1 times [2018-10-04 12:18:49,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:49,364 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-04 12:18:49,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:49,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:18:49,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:18:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:18:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:18:49,369 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 4 states. [2018-10-04 12:18:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:49,630 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2018-10-04 12:18:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:18:49,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:18:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:49,633 INFO L225 Difference]: With dead ends: 80 [2018-10-04 12:18:49,633 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:18:49,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:18:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:18:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-10-04 12:18:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:18:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-10-04 12:18:49,656 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 14 [2018-10-04 12:18:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:49,658 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-10-04 12:18:49,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:18:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-10-04 12:18:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:49,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:49,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:49,661 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:49,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2136111975, now seen corresponding path program 1 times [2018-10-04 12:18:49,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:49,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:49,801 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-04 12:18:49,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:49,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:18:49,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:18:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:18:49,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:18:49,803 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 4 states. [2018-10-04 12:18:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:49,951 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2018-10-04 12:18:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:18:49,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:18:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:49,955 INFO L225 Difference]: With dead ends: 68 [2018-10-04 12:18:49,955 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 12:18:49,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:18:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 12:18:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2018-10-04 12:18:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:18:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-10-04 12:18:49,972 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 14 [2018-10-04 12:18:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:49,972 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-10-04 12:18:49,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:18:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-10-04 12:18:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:18:49,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:49,974 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:49,974 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:49,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:49,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1820747817, now seen corresponding path program 1 times [2018-10-04 12:18:49,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:49,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:49,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:50,081 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-04 12:18:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:50,082 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 3 states. [2018-10-04 12:18:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:50,124 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-10-04 12:18:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:50,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:18:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:50,126 INFO L225 Difference]: With dead ends: 73 [2018-10-04 12:18:50,126 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:18:50,127 INFO L605 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-10-04 12:18:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:18:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-04 12:18:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:18:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2018-10-04 12:18:50,139 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 14 [2018-10-04 12:18:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:50,139 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-10-04 12:18:50,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2018-10-04 12:18:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:18:50,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:50,141 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:50,141 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:50,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1361822969, now seen corresponding path program 1 times [2018-10-04 12:18:50,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:50,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:50,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:50,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:50,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:50,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:18:50,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:50,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:50,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:50,233 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 3 states. [2018-10-04 12:18:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:50,264 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2018-10-04 12:18:50,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:50,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 12:18:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:50,266 INFO L225 Difference]: With dead ends: 99 [2018-10-04 12:18:50,266 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:18:50,266 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-04 12:18:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:18:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 12:18:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:18:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2018-10-04 12:18:50,279 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 26 [2018-10-04 12:18:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:50,280 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2018-10-04 12:18:50,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-10-04 12:18:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:18:50,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:50,281 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:50,282 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:50,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:50,282 INFO L82 PathProgramCache]: Analyzing trace with hash 552476343, now seen corresponding path program 1 times [2018-10-04 12:18:50,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:50,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:50,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:50,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:50,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:50,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:50,577 INFO L227 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-10-04 12:18:50,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:50,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:18:50,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:50,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:18:50,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:18:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:18:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:18:50,829 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 7 states. [2018-10-04 12:18:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:51,213 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-10-04 12:18:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:18:51,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-04 12:18:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:51,218 INFO L225 Difference]: With dead ends: 73 [2018-10-04 12:18:51,218 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:18:51,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:18:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:18:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:18:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:18:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:18:51,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-04 12:18:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:51,221 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:18:51,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:18:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:18:51,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:18:51,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:18:51,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:18:51,731 WARN L178 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-04 12:18:51,836 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-04 12:18:52,280 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-04 12:18:52,422 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 313) no Hoare annotation was computed. [2018-10-04 12:18:52,422 INFO L421 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse3 (<= ~mode3 1)) (.cse4 (not (= (+ ~p2_old 1) 0))) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= 512 ~mode2)) (and .cse2 (<= ~r1 1) .cse3 .cse4 .cse1 (= ~mode1 0)) (and .cse0 .cse2 (<= 1 ULTIMATE.start_main_~c1~85) .cse3 .cse4 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1 (<= 1 ULTIMATE.start_check_~tmp~78)))) [2018-10-04 12:18:52,423 INFO L421 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode3 1) (not (= (+ ~p2_old 1) 0)) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-10-04 12:18:52,423 INFO L421 ceAbstractionStarter]: At program point L310(lines 191 310) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= 512 ~mode2) (= ~mode1 0)) (and .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode3 1) (not (= (+ ~p2_old 1) 0)) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1 (<= 1 ULTIMATE.start_check_~tmp~78)))) [2018-10-04 12:18:52,423 INFO L421 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (let ((.cse3 (<= ~r1 0)) (.cse0 (<= ~mode3 1)) (.cse1 (not (= (+ ~p2_old 1) 0))) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 1) .cse0 .cse1 .cse2 (= ~mode1 0)) (and .cse3 .cse2 (<= 0 ~p2_new)) (and .cse3 .cse0 .cse1 .cse2))) [2018-10-04 12:18:52,424 INFO L421 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode3 1) (not (= (+ ~p2_old 1) 0)) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-10-04 12:18:52,424 INFO L421 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode3 1) (not (= (+ ~p2_old 1) 0)) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-10-04 12:18:52,424 INFO L421 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode3 1) (not (= (+ ~p2_old 1) 0)) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-10-04 12:18:52,424 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 313) no Hoare annotation was computed. [2018-10-04 12:18:52,425 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 313) no Hoare annotation was computed. [2018-10-04 12:18:52,425 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-10-04 12:18:52,425 INFO L421 ceAbstractionStarter]: At program point L214(lines 204 215) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse3 (<= ~mode3 1)) (.cse4 (not (= (+ ~p2_old 1) 0))) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= 512 ~mode2)) (and .cse2 (<= ~r1 1) .cse3 .cse4 .cse1 (= ~mode1 0)) (and .cse0 .cse2 (<= 1 ULTIMATE.start_main_~c1~85) .cse3 .cse4 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1 (<= 1 ULTIMATE.start_check_~tmp~78)))) [2018-10-04 12:18:52,426 INFO L421 ceAbstractionStarter]: At program point L243(lines 243 252) the Hoare annotation is: (let ((.cse3 (<= ~r1 0)) (.cse0 (<= ~mode3 1)) (.cse1 (not (= (+ ~p2_old 1) 0))) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 1) .cse0 .cse1 .cse2 (= ~mode1 0)) (and .cse3 .cse2 (<= 0 ~p2_new)) (and .cse3 .cse0 .cse1 .cse2))) [2018-10-04 12:18:52,426 INFO L421 ceAbstractionStarter]: At program point L307(lines 307 311) the Hoare annotation is: false [2018-10-04 12:18:52,426 INFO L421 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode3 1) (not (= (+ ~p2_old 1) 0)) (= 0 (+ ~nomsg 1))) [2018-10-04 12:18:52,426 INFO L421 ceAbstractionStarter]: At program point L196(lines 196 205) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= 512 ~mode2) (= ~mode1 0)) (and .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode3 1) (not (= (+ ~p2_old 1) 0)) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) .cse1 (<= 1 ULTIMATE.start_check_~tmp~78)))) [2018-10-04 12:18:52,426 INFO L421 ceAbstractionStarter]: At program point L258(lines 251 259) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode3 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p2_new)) [2018-10-04 12:18:52,447 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:18:52 BoogieIcfgContainer [2018-10-04 12:18:52,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:18:52,448 INFO L168 Benchmark]: Toolchain (without parser) took 4745.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:52,449 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-04 12:18:52,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.04 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-04 12:18:52,451 INFO L168 Benchmark]: Boogie Preprocessor took 32.55 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-04 12:18:52,451 INFO L168 Benchmark]: RCFGBuilder took 726.64 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:52,452 INFO L168 Benchmark]: TraceAbstraction took 3938.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 182.4 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:52,457 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.20 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 Procedure Inliner took 43.04 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 32.55 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 726.64 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3938.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 182.4 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: 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 - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 512 <= ~mode2) || (((((!(0 == assert_~arg) && ~r1 <= 1) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && ~mode1 == 0)) || (((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 512 <= ~mode2) && ~mode1 == 0) || (((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((~r1 <= 1 && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && ~mode1 == 0) || ((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || (((~r1 <= 0 && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && 1 <= main_~c1~85) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 1 <= main_~c1~85) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 512 <= ~mode2) || (((((!(0 == assert_~arg) && ~r1 <= 1) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && ~mode1 == 0)) || (((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode3 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p2_new - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((((~r1 <= 1 && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && ~mode1 == 0) || ((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || (((~r1 <= 0 && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1 - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78 - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 512 <= ~mode2) && ~mode1 == 0) || (((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode3 <= 1) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 162 SDtfs, 141 SDslu, 140 SDs, 0 SdLazy, 72 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 52 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 39 NumberOfFragments, 479 HoareAnnotationTreeSize, 13 FomulaSimplifications, 485 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 8839 SizeOfPredicates, 1 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 28/36 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.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-18-52-474.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-18-52-474.csv Received shutdown request...