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.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:13:12,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:13:12,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:13:12,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:13:12,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:13:12,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:13:12,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:13:12,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:13:12,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:13:12,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:13:12,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:13:12,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:13:12,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:13:12,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:13:12,898 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:13:12,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:13:12,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:13:12,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:13:12,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:13:12,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:13:12,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:13:12,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:13:12,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:13:12,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:13:12,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:13:12,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:13:12,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:13:12,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:13:12,919 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:13:12,920 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:13:12,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:13:12,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:13:12,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:13:12,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:13:12,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:13:12,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:13:12,926 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 09:13:12,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:13:12,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:13:12,946 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:13:12,946 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:13:12,947 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:13:12,947 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:13:12,947 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:13:12,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:13:12,947 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:13:12,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:13:12,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:13:12,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:13:12,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:13:12,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:13:12,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:13:12,949 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:13:12,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:13:12,949 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:13:12,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:13:12,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:13:12,950 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:13:12,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:13:12,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:13:12,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:13:12,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:13:12,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:13:12,951 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:13:12,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:13:12,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:13:12,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:13:13,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:13:13,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:13:13,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:13:13,026 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:13:13,027 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:13:13,028 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.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl [2018-10-04 09:13:13,029 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl' [2018-10-04 09:13:13,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:13:13,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:13:13,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:13:13,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:13:13,131 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:13:13,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:13:13,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:13:13,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:13:13,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:13:13,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/1) ... [2018-10-04 09:13:13,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:13:13,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:13:13,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:13:13,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:13:13,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (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 09:13:13,326 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 09:13:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:13:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:13:13,925 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:13:13,925 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:13:13 BoogieIcfgContainer [2018-10-04 09:13:13,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:13:13,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:13:13,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:13:13,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:13:13,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:13" (1/2) ... [2018-10-04 09:13:13,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd93ead and model type pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:13:13, skipping insertion in model container [2018-10-04 09:13:13,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:13:13" (2/2) ... [2018-10-04 09:13:13,933 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl [2018-10-04 09:13:13,943 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:13:13,951 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:13:14,007 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:13:14,008 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:13:14,008 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:13:14,009 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:13:14,009 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:13:14,009 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:13:14,009 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:13:14,009 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:13:14,010 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:13:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-04 09:13:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:13:14,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:14,046 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:14,047 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:14,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-10-04 09:13:14,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:14,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:14,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:14,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:14,324 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 09:13:14,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:14,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:13:14,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:14,351 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-04 09:13:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:14,419 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2018-10-04 09:13:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:14,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:13:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:14,431 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:13:14,431 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:13:14,435 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 09:13:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:13:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 09:13:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:13:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-10-04 09:13:14,481 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2018-10-04 09:13:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:14,481 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-10-04 09:13:14,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-10-04 09:13:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:13:14,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:14,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:14,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:14,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 391728025, now seen corresponding path program 1 times [2018-10-04 09:13:14,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:14,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:14,634 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 09:13:14,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:14,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:13:14,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:14,637 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2018-10-04 09:13:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:14,696 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-10-04 09:13:14,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:14,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:13:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:14,698 INFO L225 Difference]: With dead ends: 63 [2018-10-04 09:13:14,698 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:13:14,700 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 09:13:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:13:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-10-04 09:13:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 09:13:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-10-04 09:13:14,712 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 16 [2018-10-04 09:13:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:14,713 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-10-04 09:13:14,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2018-10-04 09:13:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:13:14,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:14,714 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:14,715 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:14,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash 448986327, now seen corresponding path program 1 times [2018-10-04 09:13:14,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:14,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:14,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:14,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:14,844 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 09:13:14,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:14,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:13:14,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:13:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:13:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:13:14,849 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 4 states. [2018-10-04 09:13:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:14,941 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2018-10-04 09:13:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:13:14,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 09:13:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:14,943 INFO L225 Difference]: With dead ends: 87 [2018-10-04 09:13:14,944 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:13:14,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:13:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:13:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2018-10-04 09:13:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:13:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2018-10-04 09:13:14,962 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2018-10-04 09:13:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:14,963 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2018-10-04 09:13:14,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:13:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2018-10-04 09:13:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:13:14,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:14,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:14,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:14,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:14,966 INFO L82 PathProgramCache]: Analyzing trace with hash 448926745, now seen corresponding path program 1 times [2018-10-04 09:13:14,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:14,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:14,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:14,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:15,086 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 09:13:15,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:15,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:13:15,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:13:15,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:13:15,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:13:15,088 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2018-10-04 09:13:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:15,342 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-04 09:13:15,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:13:15,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 09:13:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:15,348 INFO L225 Difference]: With dead ends: 109 [2018-10-04 09:13:15,348 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 09:13:15,349 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 09:13:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 09:13:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2018-10-04 09:13:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:13:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-10-04 09:13:15,380 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 16 [2018-10-04 09:13:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:15,381 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-10-04 09:13:15,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:13:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-10-04 09:13:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:13:15,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:15,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:15,385 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:15,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash -619448807, now seen corresponding path program 1 times [2018-10-04 09:13:15,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:15,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:15,463 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 09:13:15,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:15,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:13:15,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:15,465 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 3 states. [2018-10-04 09:13:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:15,494 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2018-10-04 09:13:15,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:15,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:13:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:15,495 INFO L225 Difference]: With dead ends: 69 [2018-10-04 09:13:15,496 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:13:15,496 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 09:13:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:13:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:13:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:13:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-10-04 09:13:15,507 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2018-10-04 09:13:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:15,507 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-10-04 09:13:15,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-10-04 09:13:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:13:15,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:15,509 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:15,509 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:15,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash -831333387, now seen corresponding path program 1 times [2018-10-04 09:13:15,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:15,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:13:15,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:13:15,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:15,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:15,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:15,624 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2018-10-04 09:13:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:15,657 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2018-10-04 09:13:15,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:15,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:13:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:15,659 INFO L225 Difference]: With dead ends: 77 [2018-10-04 09:13:15,659 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:13:15,659 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 09:13:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:13:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:13:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:13:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-10-04 09:13:15,671 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 30 [2018-10-04 09:13:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:15,672 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-10-04 09:13:15,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-10-04 09:13:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:13:15,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:15,673 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:15,673 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:15,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:15,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1089498825, now seen corresponding path program 1 times [2018-10-04 09:13:15,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:15,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:15,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:13:15,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:15,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:13:15,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:15,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:15,745 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2018-10-04 09:13:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:15,774 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-10-04 09:13:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:15,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:13:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:15,775 INFO L225 Difference]: With dead ends: 77 [2018-10-04 09:13:15,776 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:13:15,776 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 09:13:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:13:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:13:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:13:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-10-04 09:13:15,787 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 30 [2018-10-04 09:13:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:15,788 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-10-04 09:13:15,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-10-04 09:13:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:13:15,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:15,789 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:15,789 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:15,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1482525835, now seen corresponding path program 1 times [2018-10-04 09:13:15,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:13:15,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:13:15,898 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 09:13:15,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:16,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:13:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:13:16,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:13:16,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:13:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:13:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:13:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:13:16,178 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 6 states. [2018-10-04 09:13:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:16,578 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-10-04 09:13:16,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:13:16,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-10-04 09:13:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:16,584 INFO L225 Difference]: With dead ends: 115 [2018-10-04 09:13:16,584 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 09:13:16,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:13:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 09:13:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-10-04 09:13:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 09:13:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-10-04 09:13:16,621 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 30 [2018-10-04 09:13:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:16,625 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-10-04 09:13:16,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:13:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-10-04 09:13:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:13:16,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:16,628 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:16,629 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:16,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1509754543, now seen corresponding path program 2 times [2018-10-04 09:13:16,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:16,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:16,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:16,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:16,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 09:13:16,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:16,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:13:16,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:16,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:16,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:16,750 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 3 states. [2018-10-04 09:13:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:16,797 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2018-10-04 09:13:16,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:16,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:13:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:16,800 INFO L225 Difference]: With dead ends: 127 [2018-10-04 09:13:16,800 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:13:16,801 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 09:13:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:13:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:13:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:13:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-10-04 09:13:16,815 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 44 [2018-10-04 09:13:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:16,816 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-10-04 09:13:16,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-10-04 09:13:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:13:16,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:16,818 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:16,818 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:16,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1974708173, now seen corresponding path program 1 times [2018-10-04 09:13:16,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:16,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:16,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:13:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 09:13:16,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:16,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:13:16,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:16,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:16,878 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 3 states. [2018-10-04 09:13:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:16,881 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-10-04 09:13:16,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:16,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:13:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:16,882 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:13:16,883 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:13:16,883 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 09:13:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:13:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:13:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:13:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:13:16,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-10-04 09:13:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:16,885 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:13:16,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:13:16,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:13:16,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:13:17,286 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-04 09:13:17,432 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-04 09:13:17,555 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-04 09:13:17,678 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-04 09:13:17,825 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2018-10-04 09:13:18,201 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-04 09:13:18,411 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2018-10-04 09:13:18,466 INFO L421 ceAbstractionStarter]: At program point L287(lines 281 288) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1))) (or (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4) .cse0) (and .cse0 (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:13:18,467 INFO L421 ceAbstractionStarter]: At program point L316(lines 316 325) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1)) (.cse1 (<= ~mode3 1))) (or (and (<= ~r1 0) (<= 256 ~mode4) .cse0 .cse1 (not (= ~p3_new ~nomsg))) (and .cse0 (<= ~r1 1) .cse1 (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:13:18,467 INFO L421 ceAbstractionStarter]: At program point L250(lines 250 259) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and .cse0 (<= 512 ~mode3) (<= (+ ~mode1 257) 0) (<= 256 ~mode4)))) [2018-10-04 09:13:18,467 INFO L421 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_old ~nomsg))) [2018-10-04 09:13:18,467 INFO L421 ceAbstractionStarter]: At program point L267(lines 258 268) the Hoare annotation is: (or (and (<= ~mode2 1) (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4))) [2018-10-04 09:13:18,468 INFO L421 ceAbstractionStarter]: At program point L292(lines 292 305) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1))) (or (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4) .cse0) (and .cse0 (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:13:18,468 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 61 391) no Hoare annotation was computed. [2018-10-04 09:13:18,468 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 61 391) no Hoare annotation was computed. [2018-10-04 09:13:18,468 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-10-04 09:13:18,469 INFO L421 ceAbstractionStarter]: At program point L272(lines 272 282) the Hoare annotation is: (or (and (<= ~mode2 1) (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4))) [2018-10-04 09:13:18,469 INFO L421 ceAbstractionStarter]: At program point L363(lines 363 370) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_old ~nomsg))) [2018-10-04 09:13:18,469 INFO L421 ceAbstractionStarter]: At program point L388(lines 388 389) the Hoare annotation is: false [2018-10-04 09:13:18,469 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 61 391) no Hoare annotation was computed. [2018-10-04 09:13:18,469 INFO L421 ceAbstractionStarter]: At program point L331(lines 324 332) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_new ~nomsg))) [2018-10-04 09:13:18,470 INFO L421 ceAbstractionStarter]: At program point L356(lines 352 357) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_old ~nomsg))) [2018-10-04 09:13:18,470 INFO L421 ceAbstractionStarter]: At program point L385(lines 244 385) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and .cse0 (<= 512 ~mode3) (<= (+ ~mode1 257) 0) (<= 256 ~mode4)))) [2018-10-04 09:13:18,470 INFO L421 ceAbstractionStarter]: At program point L377(lines 377 386) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|) (not (= ~p3_old ~nomsg))) [2018-10-04 09:13:18,470 INFO L421 ceAbstractionStarter]: At program point L311(lines 304 312) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1)) (.cse1 (<= ~mode3 1))) (or (and (<= ~r1 0) (<= 256 ~mode4) .cse0 .cse1 (not (= ~p3_new ~nomsg))) (and .cse0 (<= ~r1 1) .cse1 (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:13:18,471 INFO L421 ceAbstractionStarter]: At program point L373(lines 369 374) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 |ULTIMATE.start_assert_#in~arg|) (not (= ~p3_old ~nomsg))) [2018-10-04 09:13:18,502 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:13:18 BoogieIcfgContainer [2018-10-04 09:13:18,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:13:18,504 INFO L168 Benchmark]: Toolchain (without parser) took 5374.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 288.1 MB). Peak memory consumption was 288.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:13:18,507 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:13:18,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:13:18,515 INFO L168 Benchmark]: Boogie Preprocessor took 55.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:13:18,515 INFO L168 Benchmark]: RCFGBuilder took 680.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 09:13:18,516 INFO L168 Benchmark]: TraceAbstraction took 4576.05 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: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. [2018-10-04 09:13:18,520 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 680.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 4576.05 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: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 352]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && 512 <= ~mode3) && ~mode1 + 257 <= 0) && 256 <= ~mode4) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && 1 <= assert_#in~arg) && !(~p3_old == ~nomsg) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 256 <= ~mode4) && ~mode2 <= 1) && ~mode3 <= 1) && !(~p3_new == ~nomsg)) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && 512 <= ~mode3) && ~mode1 + 257 <= 0) && 256 <= ~mode4) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_#in~arg) && !(~p3_old == ~nomsg) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) && ~mode2 <= 1) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 256 <= ~mode4) && ~mode2 <= 1) && ~mode3 <= 1) && !(~p3_new == ~nomsg)) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) && ~mode2 <= 1) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 249 SDtfs, 168 SDslu, 232 SDs, 0 SdLazy, 94 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 68 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 43 NumberOfFragments, 428 HoareAnnotationTreeSize, 15 FomulaSimplifications, 553 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 192 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 15110 SizeOfPredicates, 1 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 130/140 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.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-13-18-555.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-13-18-555.csv Received shutdown request...