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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:27:14,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:27:14,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:27:14,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:27:14,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:27:14,966 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:27:14,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:27:14,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:27:14,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:27:14,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:27:14,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:27:14,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:27:14,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:27:14,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:27:14,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:27:14,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:27:14,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:27:14,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:27:15,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:27:15,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:27:15,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:27:15,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:27:15,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:27:15,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:27:15,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:27:15,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:27:15,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:27:15,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:27:15,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:27:15,021 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:27:15,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:27:15,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:27:15,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:27:15,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:27:15,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:27:15,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:27:15,027 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-09-30 10:27:15,056 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:27:15,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:27:15,058 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:27:15,058 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:27:15,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:27:15,059 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:27:15,060 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:27:15,060 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:27:15,061 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:27:15,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:27:15,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:27:15,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:27:15,061 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:27:15,061 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:27:15,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:27:15,062 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:27:15,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:27:15,062 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:27:15,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:27:15,064 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:27:15,064 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:27:15,064 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:27:15,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:15,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:27:15,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:27:15,065 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:27:15,065 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:27:15,066 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:27:15,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:27:15,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:27:15,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:27:15,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:27:15,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:27:15,150 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:27:15,151 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:27:15,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl [2018-09-30 10:27:15,152 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl' [2018-09-30 10:27:15,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:27:15,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:27:15,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:15,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:27:15,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:27:15,279 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.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,294 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.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:15,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:27:15,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:27:15,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:27:15,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/1) ... [2018-09-30 10:27:15,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:27:15,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:27:15,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:27:15,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:27:15,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (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-09-30 10:27:15,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:27:15,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:27:15,942 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:27:15,943 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:15 BoogieIcfgContainer [2018-09-30 10:27:15,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:27:15,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:27:15,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:27:15,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:27:15,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:15" (1/2) ... [2018-09-30 10:27:15,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dcef5a and model type pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:27:15, skipping insertion in model container [2018-09-30 10:27:15,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:15" (2/2) ... [2018-09-30 10:27:15,953 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl [2018-09-30 10:27:15,964 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:27:15,976 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:27:16,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:27:16,036 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:27:16,036 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:27:16,037 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:27:16,037 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:27:16,037 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:27:16,037 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:27:16,037 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:27:16,037 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:27:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-09-30 10:27:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:16,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:16,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:16,075 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:16,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-09-30 10:27:16,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:16,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:16,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:16,408 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:16,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:16,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:16,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:16,429 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-09-30 10:27:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:16,505 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-09-30 10:27:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:16,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:27:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:16,517 INFO L225 Difference]: With dead ends: 39 [2018-09-30 10:27:16,518 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:27:16,521 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-09-30 10:27:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:27:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-09-30 10:27:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:27:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-09-30 10:27:16,574 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-09-30 10:27:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:16,574 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-09-30 10:27:16,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-09-30 10:27:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:16,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:16,576 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:16,577 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:16,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash -100955755, now seen corresponding path program 1 times [2018-09-30 10:27:16,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:16,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:16,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:16,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:16,765 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:16,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:27:16,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:27:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:27:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:27:16,768 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-09-30 10:27:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:16,888 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-09-30 10:27:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:16,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-09-30 10:27:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:16,890 INFO L225 Difference]: With dead ends: 46 [2018-09-30 10:27:16,892 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 10:27:16,893 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-09-30 10:27:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 10:27:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-09-30 10:27:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:27:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-09-30 10:27:16,911 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2018-09-30 10:27:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:16,912 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-09-30 10:27:16,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:27:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-09-30 10:27:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:16,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:16,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:16,915 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:16,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash -493923183, now seen corresponding path program 1 times [2018-09-30 10:27:16,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:16,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:16,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:16,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:16,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:16,992 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-09-30 10:27:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:17,039 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-09-30 10:27:17,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:17,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:27:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:17,044 INFO L225 Difference]: With dead ends: 55 [2018-09-30 10:27:17,044 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 10:27:17,045 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-09-30 10:27:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 10:27:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-09-30 10:27:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-30 10:27:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-09-30 10:27:17,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 12 [2018-09-30 10:27:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:17,068 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-09-30 10:27:17,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-09-30 10:27:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:27:17,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:17,070 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:17,070 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:17,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1628792711, now seen corresponding path program 1 times [2018-09-30 10:27:17,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:17,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:17,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:17,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:17,210 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:17,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:17,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:17,212 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 3 states. [2018-09-30 10:27:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:17,252 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2018-09-30 10:27:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:17,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:27:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:17,255 INFO L225 Difference]: With dead ends: 111 [2018-09-30 10:27:17,255 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:27:17,256 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-09-30 10:27:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:27:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-09-30 10:27:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 10:27:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-09-30 10:27:17,281 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 22 [2018-09-30 10:27:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:17,282 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-09-30 10:27:17,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-09-30 10:27:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:27:17,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:17,287 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:17,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:17,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:17,288 INFO L82 PathProgramCache]: Analyzing trace with hash -819446085, now seen corresponding path program 1 times [2018-09-30 10:27:17,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:17,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:17,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:17,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:17,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:17,464 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:17,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:17,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:17,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:17,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:17,466 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-09-30 10:27:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:17,562 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-09-30 10:27:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:17,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:27:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:17,571 INFO L225 Difference]: With dead ends: 213 [2018-09-30 10:27:17,572 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 10:27:17,574 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-09-30 10:27:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 10:27:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-09-30 10:27:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 10:27:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-09-30 10:27:17,609 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-09-30 10:27:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:17,609 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-09-30 10:27:17,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-09-30 10:27:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:27:17,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:17,611 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:17,612 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:17,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash -762187783, now seen corresponding path program 1 times [2018-09-30 10:27:17,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:17,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:17,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:17,723 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:17,723 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-09-30 10:27:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:17,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:27:18,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:18,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:27:18,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:27:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:27:18,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:27:18,091 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-09-30 10:27:18,416 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:27:19,265 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 10:27:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:19,326 INFO L93 Difference]: Finished difference Result 386 states and 480 transitions. [2018-09-30 10:27:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:27:19,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-09-30 10:27:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:19,329 INFO L225 Difference]: With dead ends: 386 [2018-09-30 10:27:19,329 INFO L226 Difference]: Without dead ends: 202 [2018-09-30 10:27:19,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:27:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-30 10:27:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2018-09-30 10:27:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-30 10:27:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2018-09-30 10:27:19,380 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 22 [2018-09-30 10:27:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:19,380 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2018-09-30 10:27:19,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:27:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2018-09-30 10:27:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 10:27:19,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:19,383 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:27:19,383 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:19,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash 518092167, now seen corresponding path program 2 times [2018-09-30 10:27:19,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:19,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:19,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 10:27:19,483 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:19,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:19,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:19,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:19,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:19,484 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand 3 states. [2018-09-30 10:27:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:19,576 INFO L93 Difference]: Finished difference Result 375 states and 448 transitions. [2018-09-30 10:27:19,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:19,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-30 10:27:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:19,578 INFO L225 Difference]: With dead ends: 375 [2018-09-30 10:27:19,578 INFO L226 Difference]: Without dead ends: 187 [2018-09-30 10:27:19,582 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-09-30 10:27:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-30 10:27:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2018-09-30 10:27:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-30 10:27:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2018-09-30 10:27:19,636 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 42 [2018-09-30 10:27:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:19,638 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2018-09-30 10:27:19,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2018-09-30 10:27:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 10:27:19,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:19,641 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:27:19,641 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:19,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash -537457785, now seen corresponding path program 3 times [2018-09-30 10:27:19,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:19,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:19,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:19,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-09-30 10:27:19,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:19,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:19,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:19,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:19,718 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand 3 states. [2018-09-30 10:27:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:19,725 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-09-30 10:27:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:19,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-30 10:27:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:19,726 INFO L225 Difference]: With dead ends: 153 [2018-09-30 10:27:19,726 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:27:19,727 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-09-30 10:27:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:27:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:27:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:27:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:27:19,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-09-30 10:27:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:19,728 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:27:19,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:27:19,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:27:19,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:27:19,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:19,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:20,070 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 10:27:20,470 WARN L178 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-09-30 10:27:20,826 WARN L178 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:27:21,035 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-09-30 10:27:21,218 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-09-30 10:27:21,380 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:27:21,682 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 10:27:21,798 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-09-30 10:27:21,801 INFO L422 ceAbstractionStarter]: At program point L289(lines 284 290) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-09-30 10:27:21,801 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 311) no Hoare annotation was computed. [2018-09-30 10:27:21,802 INFO L422 ceAbstractionStarter]: At program point L223(lines 214 224) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:21,802 INFO L422 ceAbstractionStarter]: At program point L246(lines 237 247) the Hoare annotation is: (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (<= 1 ~mode2)) (.cse5 (<= ~mode2 1)) (.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (not (= ~p2_old ~nomsg)) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and .cse3 .cse4 .cse5 .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse3 .cse4 .cse5 .cse0 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse1 .cse2 .cse6))) [2018-09-30 10:27:21,802 INFO L422 ceAbstractionStarter]: At program point L308(lines 199 308) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:21,802 INFO L422 ceAbstractionStarter]: At program point L228(lines 228 238) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:21,803 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 311) no Hoare annotation was computed. [2018-09-30 10:27:21,803 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 311) no Hoare annotation was computed. [2018-09-30 10:27:21,803 INFO L422 ceAbstractionStarter]: At program point L251(lines 251 260) the Hoare annotation is: (let ((.cse3 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (<= 1 ~mode2)) (.cse5 (<= ~mode2 1)) (.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (not (= ~p2_old ~nomsg)) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and .cse3 .cse4 .cse5 .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse3 .cse4 .cse5 .cse0 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse1 .cse2 .cse6))) [2018-09-30 10:27:21,803 INFO L422 ceAbstractionStarter]: At program point L278(lines 278 285) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 10:27:21,804 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 310) no Hoare annotation was computed. [2018-09-30 10:27:21,804 INFO L422 ceAbstractionStarter]: At program point L305(lines 305 309) the Hoare annotation is: false [2018-09-30 10:27:21,804 INFO L422 ceAbstractionStarter]: At program point L206(lines 206 215) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:21,804 INFO L422 ceAbstractionStarter]: At program point L299(lines 299 306) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-09-30 10:27:21,805 INFO L422 ceAbstractionStarter]: At program point L266(lines 259 267) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:27:21,819 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,820 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,825 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,825 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,836 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,836 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,845 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,864 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:27:21 BoogieIcfgContainer [2018-09-30 10:27:21,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:27:21,867 INFO L168 Benchmark]: Toolchain (without parser) took 6610.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 362.1 MB). Peak memory consumption was 362.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:21,873 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-09-30 10:27:21,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.26 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-09-30 10:27:21,875 INFO L168 Benchmark]: Boogie Preprocessor took 39.48 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-09-30 10:27:21,875 INFO L168 Benchmark]: RCFGBuilder took 597.75 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-09-30 10:27:21,877 INFO L168 Benchmark]: TraceAbstraction took 5919.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:21,882 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.19 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 44.26 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 39.48 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 597.75 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 5919.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 310]: 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: 199]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 259]: Loop Invariant [2018-09-30 10:27:21,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 251]: Loop Invariant [2018-09-30 10:27:21,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,904 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,905 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~78 - InvariantResult [Line: 237]: Loop Invariant [2018-09-30 10:27:21,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,912 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,913 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,913 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 278]: Loop Invariant [2018-09-30 10:27:21,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:21,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= check_~tmp~78 - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 137 SDslu, 148 SDs, 0 SdLazy, 135 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 80 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 67 NumberOfFragments, 691 HoareAnnotationTreeSize, 11 FomulaSimplifications, 2266 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 199 ConstructedInterpolants, 6 QuantifiedInterpolants, 15543 SizeOfPredicates, 1 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 148/160 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.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-27-21-933.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-27-21-933.csv Received shutdown request...