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_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:39:07,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:39:07,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:39:07,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:39:07,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:39:07,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:39:07,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:39:07,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:39:07,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:39:07,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:39:07,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:39:07,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:39:07,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:39:07,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:39:07,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:39:07,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:39:07,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:39:07,155 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:39:07,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:39:07,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:39:07,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:39:07,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:39:07,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:39:07,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:39:07,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:39:07,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:39:07,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:39:07,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:39:07,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:39:07,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:39:07,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:39:07,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:39:07,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:39:07,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:39:07,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:39:07,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:39:07,190 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:39:07,210 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:39:07,211 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:39:07,211 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:39:07,212 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:39:07,212 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:39:07,212 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:39:07,213 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:39:07,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:39:07,213 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:39:07,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:39:07,213 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:39:07,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:39:07,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:39:07,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:39:07,214 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:39:07,214 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:39:07,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:39:07,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:39:07,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:39:07,215 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:39:07,215 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:39:07,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:39:07,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:39:07,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:39:07,216 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:39:07,216 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:39:07,217 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:39:07,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:39:07,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:39:07,217 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:39:07,217 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:39:07,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:39:07,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:39:07,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:39:07,292 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:39:07,292 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:39:07,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl [2018-10-01 00:39:07,293 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl' [2018-10-01 00:39:07,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:39:07,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:39:07,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:07,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:39:07,376 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:39:07,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:07,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:39:07,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:39:07,415 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:39:07,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/1) ... [2018-10-01 00:39:07,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:39:07,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:39:07,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:39:07,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:39:07,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (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-01 00:39:07,522 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:39:07,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:39:07,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:39:08,022 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:39:08,022 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:08 BoogieIcfgContainer [2018-10-01 00:39:08,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:39:08,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:39:08,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:39:08,026 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:39:08,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:07" (1/2) ... [2018-10-01 00:39:08,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf1cccd and model type pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:39:08, skipping insertion in model container [2018-10-01 00:39:08,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:08" (2/2) ... [2018-10-01 00:39:08,030 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl [2018-10-01 00:39:08,037 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:39:08,046 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:39:08,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:39:08,094 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:39:08,094 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:39:08,094 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:39:08,094 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:39:08,094 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:39:08,094 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:39:08,095 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:39:08,095 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:39:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-01 00:39:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:08,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:08,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:08,116 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:08,123 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash 738430141, now seen corresponding path program 1 times [2018-10-01 00:39:08,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:08,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:08,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:08,343 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-01 00:39:08,346 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:08,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:08,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:08,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:08,367 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-01 00:39:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:08,430 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-01 00:39:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:08,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:39:08,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:08,445 INFO L225 Difference]: With dead ends: 48 [2018-10-01 00:39:08,445 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:39:08,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:39:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-01 00:39:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:39:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-01 00:39:08,491 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-01 00:39:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:08,491 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-01 00:39:08,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-01 00:39:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:08,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:08,492 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:08,493 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:08,493 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1418488511, now seen corresponding path program 1 times [2018-10-01 00:39:08,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:08,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:08,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:08,579 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-01 00:39:08,580 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:08,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:08,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:08,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:08,582 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:08,582 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-01 00:39:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:08,733 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-01 00:39:08,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:08,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:39:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:08,735 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:39:08,736 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:39:08,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:39:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-01 00:39:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:39:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2018-10-01 00:39:08,760 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 15 [2018-10-01 00:39:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:08,762 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2018-10-01 00:39:08,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2018-10-01 00:39:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:08,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:08,763 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:08,763 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:08,764 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -356518851, now seen corresponding path program 1 times [2018-10-01 00:39:08,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:08,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:08,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:08,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:08,968 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-01 00:39:08,969 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:08,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:39:08,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:08,970 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:08,970 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand 4 states. [2018-10-01 00:39:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:09,176 INFO L93 Difference]: Finished difference Result 133 states and 182 transitions. [2018-10-01 00:39:09,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:09,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-01 00:39:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:09,186 INFO L225 Difference]: With dead ends: 133 [2018-10-01 00:39:09,186 INFO L226 Difference]: Without dead ends: 131 [2018-10-01 00:39:09,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-01 00:39:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 63. [2018-10-01 00:39:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:39:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2018-10-01 00:39:09,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 15 [2018-10-01 00:39:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:09,221 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2018-10-01 00:39:09,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2018-10-01 00:39:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:09,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,223 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:09,224 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,224 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash -356459269, now seen corresponding path program 1 times [2018-10-01 00:39:09,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:09,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:09,441 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-01 00:39:09,442 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:09,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:39:09,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:09,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:09,443 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:09,444 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand 4 states. [2018-10-01 00:39:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:09,779 INFO L93 Difference]: Finished difference Result 175 states and 233 transitions. [2018-10-01 00:39:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:09,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-01 00:39:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:09,786 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:39:09,786 INFO L226 Difference]: Without dead ends: 113 [2018-10-01 00:39:09,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-01 00:39:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2018-10-01 00:39:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:39:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2018-10-01 00:39:09,816 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 15 [2018-10-01 00:39:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:09,816 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2018-10-01 00:39:09,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2018-10-01 00:39:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:09,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:09,817 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,818 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash 889000381, now seen corresponding path program 1 times [2018-10-01 00:39:09,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:09,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:09,859 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-01 00:39:09,860 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:09,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:09,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:09,861 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:09,861 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 3 states. [2018-10-01 00:39:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:09,903 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-10-01 00:39:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:09,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:39:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:09,905 INFO L225 Difference]: With dead ends: 101 [2018-10-01 00:39:09,905 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:39:09,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:39:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-01 00:39:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:39:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2018-10-01 00:39:09,931 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 15 [2018-10-01 00:39:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:09,934 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2018-10-01 00:39:09,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-10-01 00:39:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:39:09,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,935 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] [2018-10-01 00:39:09,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,936 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash 139263349, now seen corresponding path program 1 times [2018-10-01 00:39:09,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:10,051 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:10,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:39:10,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:10,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:10,052 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 4 states. [2018-10-01 00:39:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:10,724 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2018-10-01 00:39:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:10,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-01 00:39:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:10,727 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:39:10,727 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:39:10,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:39:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-10-01 00:39:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:39:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-10-01 00:39:10,747 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 28 [2018-10-01 00:39:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:10,747 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-10-01 00:39:10,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-10-01 00:39:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:39:10,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:10,749 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:10,749 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:10,749 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1701100223, now seen corresponding path program 2 times [2018-10-01 00:39:10,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:10,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 00:39:10,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:10,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:39:10,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:10,827 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:10,827 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 3 states. [2018-10-01 00:39:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:10,846 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-10-01 00:39:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:10,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-01 00:39:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:10,848 INFO L225 Difference]: With dead ends: 78 [2018-10-01 00:39:10,849 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:39:10,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:39:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:39:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:39:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:39:10,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-10-01 00:39:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:10,851 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:39:10,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:39:10,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:39:10,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:39:10,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:11,108 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-01 00:39:11,427 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-01 00:39:11,466 INFO L422 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:11,467 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 309) no Hoare annotation was computed. [2018-10-01 00:39:11,467 INFO L422 ceAbstractionStarter]: At program point L275(lines 270 276) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-10-01 00:39:11,468 INFO L422 ceAbstractionStarter]: At program point L304(lines 171 304) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~62)) (and .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-10-01 00:39:11,468 INFO L422 ceAbstractionStarter]: At program point L296(lines 296 305) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-10-01 00:39:11,468 INFO L422 ceAbstractionStarter]: At program point L197(lines 188 198) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:11,468 INFO L422 ceAbstractionStarter]: At program point L292(lines 288 293) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 |ULTIMATE.start_assert_#in~arg|) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-10-01 00:39:11,469 INFO L422 ceAbstractionStarter]: At program point L255(lines 255 262) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1)) [2018-10-01 00:39:11,469 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 41 310) no Hoare annotation was computed. [2018-10-01 00:39:11,469 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 41 310) no Hoare annotation was computed. [2018-10-01 00:39:11,469 INFO L422 ceAbstractionStarter]: At program point L243(lines 234 244) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (not (= ~nomsg ~p3_new))) [2018-10-01 00:39:11,471 INFO L422 ceAbstractionStarter]: At program point L177(lines 177 189) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~62)) (and .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-10-01 00:39:11,471 INFO L422 ceAbstractionStarter]: At program point L202(lines 202 212) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:11,471 INFO L422 ceAbstractionStarter]: At program point L264(lines 261 271) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1)) [2018-10-01 00:39:11,472 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 41 310) no Hoare annotation was computed. [2018-10-01 00:39:11,472 INFO L422 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:11,472 INFO L422 ceAbstractionStarter]: At program point L282(lines 282 289) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-10-01 00:39:11,472 INFO L422 ceAbstractionStarter]: At program point L307(lines 307 308) the Hoare annotation is: false [2018-10-01 00:39:11,500 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:39:11 BoogieIcfgContainer [2018-10-01 00:39:11,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:39:11,501 INFO L168 Benchmark]: Toolchain (without parser) took 4129.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:11,503 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-01 00:39:11,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.31 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-01 00:39:11,505 INFO L168 Benchmark]: Boogie Preprocessor took 35.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-01 00:39:11,507 INFO L168 Benchmark]: RCFGBuilder took 571.76 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:11,508 INFO L168 Benchmark]: TraceAbstraction took 3477.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:11,514 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.25 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 38.31 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 35.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 571.76 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3477.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 309]: 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: 282]: Loop Invariant Derived loop invariant: (((!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= check_~tmp~62 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_~arg) && 1 <= check_~tmp~62) || ((~r1 <= 0 && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_~arg) && 1 <= assert_#in~arg) && 1 <= check_~tmp~62 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && !(~nomsg == ~p3_new) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1) && 1 <= check_~tmp~62 - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_~arg) && 1 <= check_~tmp~62) || ((~r1 <= 0 && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_#in~arg) && 1 <= check_~tmp~62 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 132 SDslu, 174 SDs, 0 SdLazy, 76 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, 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, 7 MinimizatonAttempts, 126 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 29 NumberOfFragments, 215 HoareAnnotationTreeSize, 14 FomulaSimplifications, 672 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 5652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 52/52 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.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-39-11-552.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-39-11-552.csv Received shutdown request...