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/20170304-DifficultPathPrograms/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:47:48,196 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:47:48,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:47:48,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:47:48,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:47:48,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:47:48,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:47:48,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:47:48,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:47:48,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:47:48,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:47:48,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:47:48,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:47:48,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:47:48,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:47:48,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:47:48,229 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:47:48,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:47:48,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:47:48,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:47:48,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:47:48,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:47:48,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:47:48,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:47:48,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:47:48,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:47:48,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:47:48,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:47:48,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:47:48,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:47:48,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:47:48,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:47:48,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:47:48,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:47:48,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:47:48,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:47:48,249 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-04 09:47:48,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:47:48,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:47:48,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:47:48,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:47:48,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:47:48,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:47:48,268 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:47:48,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:47:48,269 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:47:48,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:47:48,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:47:48,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:47:48,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:47:48,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:47:48,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:47:48,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:47:48,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:47:48,271 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:47:48,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:47:48,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:47:48,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:47:48,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:47:48,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:47:48,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:47:48,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:47:48,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:47:48,272 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:47:48,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:47:48,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:47:48,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:47:48,273 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:47:48,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:47:48,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:47:48,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:47:48,344 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:47:48,344 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:47:48,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl [2018-10-04 09:47:48,346 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2018-10-04 09:47:48,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:47:48,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:47:48,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:48,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:47:48,432 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:47:48,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:48,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:47:48,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:47:48,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:47:48,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... [2018-10-04 09:47:48,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:47:48,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:47:48,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:47:48,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:47:48,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:47:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:47:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:47:48,937 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:47:48,938 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:48 BoogieIcfgContainer [2018-10-04 09:47:48,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:47:48,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:47:48,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:47:48,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:47:48,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:48" (1/2) ... [2018-10-04 09:47:48,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f660358 and model type string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:47:48, skipping insertion in model container [2018-10-04 09:47:48,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:48" (2/2) ... [2018-10-04 09:47:48,952 INFO L112 eAbstractionObserver]: Analyzing ICFG string.i_3.bpl [2018-10-04 09:47:48,963 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:47:48,975 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:47:49,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:47:49,036 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:47:49,036 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:47:49,036 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:47:49,036 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:47:49,036 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:47:49,039 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:47:49,039 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:47:49,040 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:47:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-04 09:47:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:47:49,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 09:47:49,066 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,073 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-04 09:47:49,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:49,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:49,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:49,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:49,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:49,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,271 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-04 09:47:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:49,344 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-10-04 09:47:49,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:49,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-04 09:47:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:49,378 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:47:49,378 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:47:49,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:47:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:47:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:47:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-04 09:47:49,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-10-04 09:47:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:49,453 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-04 09:47:49,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-04 09:47:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:47:49,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,454 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:49,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,455 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-10-04 09:47:49,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:47:49,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:49,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:47:49,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:49,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:47:49,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:47:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:47:49,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,691 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-10-04 09:47:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:49,770 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-04 09:47:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:47:49,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-04 09:47:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:49,771 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:47:49,771 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:47:49,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 09:47:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:47:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 09:47:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 09:47:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-04 09:47:49,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-04 09:47:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:49,781 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-04 09:47:49,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:47:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-04 09:47:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:47:49,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,782 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-04 09:47:49,782 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,782 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-10-04 09:47:49,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 09:47:49,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:49,882 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:49,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:47:49,941 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:47:49,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:47:49,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 09:47:50,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:50,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:47:50,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:47:50,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:47:50,058 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:50,058 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-10-04 09:47:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:50,148 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-04 09:47:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:47:50,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-04 09:47:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:50,150 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:47:50,150 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:47:50,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:47:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:47:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 09:47:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:47:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-04 09:47:50,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-10-04 09:47:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:50,159 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-04 09:47:50,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:47:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-04 09:47:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:47:50,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:50,160 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-10-04 09:47:50,161 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:50,162 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:50,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-10-04 09:47:50,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:50,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:50,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:47:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 09:47:50,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:50,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:50,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:47:50,372 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:47:50,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:47:50,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 09:47:50,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:50,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:47:50,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:47:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:47:50,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:50,586 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-10-04 09:47:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:50,629 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-10-04 09:47:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:47:50,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-04 09:47:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:50,634 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:47:50,634 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:47:50,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 4 [2018-10-04 09:47:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:47:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 09:47:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 09:47:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-04 09:47:50,641 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-10-04 09:47:50,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:50,641 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-04 09:47:50,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:47:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-04 09:47:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:47:50,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:50,642 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-10-04 09:47:50,643 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:50,643 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-10-04 09:47:50,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:50,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:47:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 09:47:50,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:50,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:47:50,912 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:47:50,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:47:50,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 09:47:51,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:51,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:47:51,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:47:51,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:47:51,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:51,014 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-10-04 09:47:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:51,100 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-04 09:47:51,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:47:51,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-04 09:47:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:51,102 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:47:51,102 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:47:51,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 5 [2018-10-04 09:47:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:47:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 09:47:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:47:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-04 09:47:51,109 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-10-04 09:47:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:51,110 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-04 09:47:51,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:47:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-04 09:47:51,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:47:51,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:51,112 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-10-04 09:47:51,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:51,112 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:51,113 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-10-04 09:47:51,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:51,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:51,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:47:51,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:47:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:47:51,244 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 09:47:51,293 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:47:51 BoogieIcfgContainer [2018-10-04 09:47:51,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:47:51,295 INFO L168 Benchmark]: Toolchain (without parser) took 2864.85 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: 150.7 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:51,297 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:51,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:51,301 INFO L168 Benchmark]: Boogie Preprocessor took 37.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:51,302 INFO L168 Benchmark]: RCFGBuilder took 415.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:51,303 INFO L168 Benchmark]: TraceAbstraction took 2350.94 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: 129.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:51,313 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.28 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 51.91 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 37.80 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 415.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2350.94 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: 129.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 89]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 72. Possible FailurePath: [L23] havoc main_#res; [L24] havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5; [L25] havoc main_~string_A~5; [L26] havoc main_~string_B~5; [L27] havoc main_~i~5; [L28] havoc main_~j~5; [L29] havoc main_~nc_A~5; [L30] havoc main_~nc_B~5; [L31] main_~found~5 := 0; [L32] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L35] assume true; VAL [main_~found~5=0, main_~i~5=0] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=1] [L35] assume true; VAL [main_~found~5=0, main_~i~5=1] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=2] [L35] assume true; VAL [main_~found~5=0, main_~i~5=2] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=3] [L35] assume true; VAL [main_~found~5=0, main_~i~5=3] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=4] [L35] assume true; VAL [main_~found~5=0, main_~i~5=4] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=5] [L35] assume true; VAL [main_~found~5=0, main_~i~5=5] [L40] assume !(main_~i~5 < 5); [L41] assume !!(main_~string_A~5[4] == 0); [L42] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L54] assume true; VAL [main_~found~5=0, main_~i~5=0] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=1] [L54] assume true; VAL [main_~found~5=0, main_~i~5=1] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=2] [L54] assume true; VAL [main_~found~5=0, main_~i~5=2] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=3] [L54] assume true; VAL [main_~found~5=0, main_~i~5=3] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=4] [L54] assume true; VAL [main_~found~5=0, main_~i~5=4] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=5] [L54] assume true; VAL [main_~found~5=0, main_~i~5=5] [L59] assume !(main_~i~5 < 5); [L60] assume !!(main_~string_B~5[4] == 0); [L61] main_~nc_A~5 := 0; [L62] assume true; [L63] assume !(main_~string_A~5[main_~nc_A~5] != 0); [L64] main_~nc_B~5 := 0; [L65] assume true; [L66] assume !(main_~string_B~5[main_~nc_B~5] != 0); [L67] assume !!(main_~nc_B~5 >= main_~nc_A~5); [L68] main_~j~5 := 0; [L69] main_~i~5 := main_~j~5; [L70] assume true; [L71] assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5); [L72] main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5); [L73] __VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0); [L74] havoc __VERIFIER_assert_~cond; [L75] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L76] assume __VERIFIER_assert_~cond == 0; [L77] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L89] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 2.2s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 25 SDslu, 30 SDs, 0 SdLazy, 40 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 3845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 80/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-47-51-331.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-47-51-331.csv Received shutdown request...