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/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:52:27,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:52:27,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:52:27,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:52:27,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:52:27,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:52:27,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:52:27,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:52:27,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:52:27,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:52:27,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:52:27,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:52:27,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:52:27,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:52:27,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:52:27,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:52:27,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:52:27,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:52:27,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:52:27,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:52:27,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:52:27,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:52:27,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:52:27,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:52:27,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:52:27,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:52:27,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:52:27,145 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:52:27,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:52:27,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:52:27,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:52:27,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:52:27,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:52:27,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:52:27,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:52:27,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:52:27,151 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-09-30 10:52:27,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:52:27,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:52:27,185 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:52:27,185 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:52:27,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:52:27,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:52:27,186 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:52:27,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:52:27,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:52:27,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:52:27,187 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:52:27,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:52:27,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:52:27,189 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:52:27,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:52:27,190 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:52:27,190 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:52:27,190 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:52:27,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:52:27,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:52:27,191 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:52:27,191 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:52:27,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:52:27,191 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:52:27,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:52:27,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:52:27,192 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:52:27,192 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:52:27,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:52:27,194 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:52:27,194 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:52:27,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:52:27,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:52:27,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:52:27,277 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:52:27,277 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:52:27,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2018-09-30 10:52:27,279 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-09-30 10:52:27,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:52:27,353 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:52:27,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:52:27,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:52:27,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:52:27,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:52:27,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:52:27,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:52:27,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:52:27,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... [2018-09-30 10:52:27,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:52:27,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:52:27,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:52:27,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:52:27,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:52:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:52:27,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:52:27,756 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:52:27,757 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:52:27 BoogieIcfgContainer [2018-09-30 10:52:27,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:52:27,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:52:27,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:52:27,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:52:27,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:52:27" (1/2) ... [2018-09-30 10:52:27,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c69374 and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:52:27, skipping insertion in model container [2018-09-30 10:52:27,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:52:27" (2/2) ... [2018-09-30 10:52:27,768 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-09-30 10:52:27,781 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:52:27,790 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:52:27,847 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:52:27,848 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:52:27,848 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:52:27,848 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:52:27,849 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:52:27,849 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:52:27,849 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:52:27,849 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:52:27,849 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:52:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-30 10:52:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:52:27,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:27,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:52:27,873 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:27,882 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-30 10:52:27,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:27,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:28,056 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:52:28,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:52:28,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:52:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:52:28,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:28,078 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-30 10:52:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:28,259 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-30 10:52:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:52:28,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 10:52:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:28,280 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:52:28,280 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:52:28,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:52:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 10:52:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 10:52:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 10:52:28,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-30 10:52:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:28,319 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 10:52:28,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:52:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 10:52:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:52:28,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:28,320 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-30 10:52:28,321 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:28,321 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-30 10:52:28,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:28,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:28,418 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:28,418 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:28,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:28,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:28,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:28,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 10:52:28,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:52:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:52:28,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:28,531 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-09-30 10:52:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:28,653 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 10:52:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:52:28,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-30 10:52:28,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:28,655 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:52:28,656 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:52:28,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:52:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 10:52:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:52:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 10:52:28,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-30 10:52:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:28,663 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 10:52:28,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:52:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 10:52:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:52:28,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:28,666 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-30 10:52:28,667 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:28,667 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-30 10:52:28,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:28,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:28,797 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:28,797 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-09-30 10:52:28,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:52:28,830 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:52:28,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:28,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:28,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:28,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:52:28,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:52:28,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:52:28,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:28,974 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-09-30 10:52:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:29,313 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 10:52:29,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:52:29,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-30 10:52:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:29,315 INFO L225 Difference]: With dead ends: 13 [2018-09-30 10:52:29,316 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:52:29,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:52:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 10:52:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:52:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 10:52:29,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-30 10:52:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:29,321 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 10:52:29,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:52:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 10:52:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:52:29,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:29,322 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-30 10:52:29,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:29,323 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-30 10:52:29,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:29,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:29,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:29,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:29,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:29,469 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:29,469 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-09-30 10:52:29,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:52:29,489 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 10:52:29,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:29,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:29,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:29,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:52:29,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:52:29,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:52:29,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:29,580 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-09-30 10:52:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:29,834 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 10:52:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:52:29,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-30 10:52:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:29,836 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:52:29,836 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 10:52:29,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 10:52:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 10:52:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:52:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 10:52:29,840 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-30 10:52:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:29,841 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 10:52:29,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:52:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 10:52:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:52:29,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:29,842 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-30 10:52:29,842 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:29,842 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:29,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-30 10:52:29,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:29,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:29,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:29,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:29,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:29,975 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:29,976 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-09-30 10:52:29,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:52:29,992 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:52:29,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:29,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:30,179 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:30,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:52:30,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:52:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:52:30,181 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:30,181 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-09-30 10:52:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:30,687 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-30 10:52:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:52:30,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-30 10:52:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:30,689 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:52:30,689 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 10:52:30,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 10:52:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 10:52:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 10:52:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-30 10:52:30,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-30 10:52:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:30,694 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-30 10:52:30,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:52:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-30 10:52:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:52:30,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:30,695 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-30 10:52:30,695 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:30,696 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-30 10:52:30,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:30,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:30,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:30,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:30,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:30,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:30,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:30,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:52:30,894 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 10:52:30,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:30,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:30,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:30,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:52:30,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:52:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:52:30,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:30,969 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-09-30 10:52:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:31,370 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 10:52:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:52:31,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-30 10:52:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:31,373 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:52:31,373 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:52:31,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:52:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 10:52:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:52:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 10:52:31,379 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-30 10:52:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:31,379 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 10:52:31,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:52:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 10:52:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:52:31,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:31,380 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-30 10:52:31,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:31,381 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-30 10:52:31,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:31,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:31,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:31,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:31,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:52:31,631 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:52:31,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:31,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:31,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:31,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-30 10:52:31,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:52:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:52:31,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:31,728 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-09-30 10:52:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:32,006 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-30 10:52:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:52:32,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 10:52:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:32,010 INFO L225 Difference]: With dead ends: 21 [2018-09-30 10:52:32,010 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 10:52:32,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 10:52:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 10:52:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 10:52:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-30 10:52:32,015 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-30 10:52:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:32,015 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-30 10:52:32,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:52:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-30 10:52:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:52:32,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:32,016 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-30 10:52:32,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:32,017 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:32,017 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-09-30 10:52:32,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:32,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:32,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:32,315 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:32,315 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:32,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:32,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:32,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:32,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-09-30 10:52:32,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:52:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:52:32,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:32,491 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-09-30 10:52:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:33,052 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-30 10:52:33,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:52:33,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-30 10:52:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:33,054 INFO L225 Difference]: With dead ends: 23 [2018-09-30 10:52:33,054 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 10:52:33,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 10:52:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-30 10:52:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 10:52:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 10:52:33,060 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-30 10:52:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:33,060 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 10:52:33,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:52:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 10:52:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:52:33,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:33,061 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-30 10:52:33,062 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:33,062 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-09-30 10:52:33,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:33,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:33,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:33,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:33,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:52:33,374 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:52:33,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:33,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:33,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:33,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-30 10:52:33,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:52:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:52:33,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:33,457 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-09-30 10:52:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:33,868 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-30 10:52:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:52:33,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 10:52:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:33,870 INFO L225 Difference]: With dead ends: 25 [2018-09-30 10:52:33,870 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 10:52:33,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 10:52:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-30 10:52:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:52:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-30 10:52:33,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-30 10:52:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:33,877 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-30 10:52:33,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:52:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-30 10:52:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:52:33,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:33,878 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-30 10:52:33,878 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:33,878 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:33,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-09-30 10:52:33,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:33,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:33,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:34,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:34,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:52:34,107 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 10:52:34,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:34,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:34,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:34,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-30 10:52:34,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:52:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:52:34,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:34,196 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-09-30 10:52:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:34,788 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-30 10:52:34,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:52:34,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-30 10:52:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:34,789 INFO L225 Difference]: With dead ends: 27 [2018-09-30 10:52:34,789 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:52:34,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:52:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-30 10:52:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:52:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-30 10:52:34,795 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-30 10:52:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:34,795 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-30 10:52:34,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:52:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-30 10:52:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:52:34,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:34,796 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-30 10:52:34,797 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:34,797 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-09-30 10:52:34,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:34,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:34,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:35,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:35,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:35,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:52:35,179 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:52:35,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:35,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:35,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:35,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-09-30 10:52:35,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:52:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:52:35,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:35,505 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-09-30 10:52:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:36,423 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-30 10:52:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:52:36,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-30 10:52:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:36,424 INFO L225 Difference]: With dead ends: 29 [2018-09-30 10:52:36,425 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 10:52:36,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 10:52:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-30 10:52:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 10:52:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-30 10:52:36,430 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-30 10:52:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:36,431 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-30 10:52:36,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:52:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-30 10:52:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:52:36,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:36,432 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-30 10:52:36,432 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:36,432 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-09-30 10:52:36,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:36,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:36,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:36,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:36,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:36,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:36,876 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:36,884 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:52:39,844 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 10:52:39,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:39,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:40,094 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:40,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-30 10:52:40,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:52:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:52:40,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:40,095 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-30 10:52:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:40,752 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 10:52:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:52:40,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-30 10:52:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:40,754 INFO L225 Difference]: With dead ends: 31 [2018-09-30 10:52:40,754 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 10:52:40,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 10:52:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-30 10:52:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:52:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-30 10:52:40,759 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-30 10:52:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:40,760 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-30 10:52:40,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:52:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-30 10:52:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:52:40,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:40,761 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-30 10:52:40,761 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:40,761 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-09-30 10:52:40,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:40,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:40,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:41,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:41,251 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:52:41,378 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:52:41,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:41,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:41,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:41,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-30 10:52:41,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:52:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:52:41,542 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:41,543 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-09-30 10:52:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:42,307 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-30 10:52:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:52:42,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-09-30 10:52:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:42,309 INFO L225 Difference]: With dead ends: 33 [2018-09-30 10:52:42,309 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:52:42,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:52:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-30 10:52:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:52:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-30 10:52:42,315 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-30 10:52:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:42,316 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-30 10:52:42,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:52:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-30 10:52:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:52:42,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:42,317 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-30 10:52:42,317 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:42,317 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:42,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-09-30 10:52:42,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:42,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:42,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:42,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:42,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:42,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:43,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:43,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-09-30 10:52:43,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:52:43,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:52:43,309 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:43,309 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-30 10:52:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:44,286 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 10:52:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:52:44,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-30 10:52:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:44,287 INFO L225 Difference]: With dead ends: 35 [2018-09-30 10:52:44,287 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 10:52:44,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 10:52:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-30 10:52:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 10:52:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-30 10:52:44,294 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-30 10:52:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:44,295 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-30 10:52:44,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:52:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-30 10:52:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 10:52:44,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:44,296 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-30 10:52:44,296 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:44,296 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-09-30 10:52:44,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:44,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:52:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:44,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:44,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:52:44,639 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:52:44,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:44,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:45,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:45,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-30 10:52:45,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:52:45,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:52:45,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:45,220 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-09-30 10:52:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:46,236 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-30 10:52:46,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:52:46,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-09-30 10:52:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:46,237 INFO L225 Difference]: With dead ends: 37 [2018-09-30 10:52:46,237 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:52:46,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:52:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 10:52:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:52:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-30 10:52:46,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-30 10:52:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:46,244 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-30 10:52:46,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:52:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-30 10:52:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:52:46,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:46,245 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-30 10:52:46,245 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:46,245 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:46,245 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-09-30 10:52:46,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:46,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:46,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:46,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:46,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:52:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:46,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:52:46,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:52:46,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:52:46,845 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 10:52:46,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:52:46,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:52:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:52:46,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:52:46,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-30 10:52:46,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:52:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:52:46,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:52:46,955 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-09-30 10:52:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:52:47,983 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-30 10:52:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:52:47,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-30 10:52:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:52:47,986 INFO L225 Difference]: With dead ends: 39 [2018-09-30 10:52:47,986 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:52:47,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:52:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:52:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-30 10:52:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:52:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 10:52:47,991 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-30 10:52:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:52:47,991 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 10:52:47,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:52:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 10:52:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:52:47,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:52:47,992 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-30 10:52:47,993 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:52:47,993 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:52:47,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-09-30 10:52:47,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:52:47,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:52:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:47,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:52:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:52:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 10:52:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 10:52:48,029 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-09-30 10:52:48,054 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:52:48 BoogieIcfgContainer [2018-09-30 10:52:48,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:52:48,055 INFO L168 Benchmark]: Toolchain (without parser) took 20705.27 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 94.4 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 215.7 MB). Peak memory consumption was 310.0 MB. Max. memory is 7.1 GB. [2018-09-30 10:52:48,058 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:52:48,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:52:48,059 INFO L168 Benchmark]: Boogie Preprocessor took 22.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:52:48,059 INFO L168 Benchmark]: RCFGBuilder took 338.73 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-09-30 10:52:48,060 INFO L168 Benchmark]: TraceAbstraction took 20296.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 94.4 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 194.5 MB). Peak memory consumption was 288.9 MB. Max. memory is 7.1 GB. [2018-09-30 10:52:48,065 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.46 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 22.12 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 338.73 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 20296.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 94.4 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 194.5 MB). Peak memory consumption was 288.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of bitwiseOr at line 48, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_~x~5, main_~y~5, main_~xx~5, main_~yy~5, main_~zz~5, main_~z~5, main_~i~5; [L21] main_~x~5 := main_#t~nondet0; [L22] havoc main_#t~nondet0; [L23] main_~y~5 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~5; [L26] havoc main_~yy~5; [L27] havoc main_~zz~5; [L28] main_~z~5 := 0; [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~z~5=0] [L32] assume true; VAL [main_~i~5=0, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1] [L32] assume true; VAL [main_~i~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2] [L32] assume true; VAL [main_~i~5=2] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3] [L32] assume true; VAL [main_~i~5=3] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4] [L32] assume true; VAL [main_~i~5=4] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5] [L32] assume true; VAL [main_~i~5=5] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6] [L32] assume true; VAL [main_~i~5=6] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7] [L32] assume true; VAL [main_~i~5=7] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8] [L32] assume true; VAL [main_~i~5=8] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9] [L32] assume true; VAL [main_~i~5=9] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10] [L32] assume true; VAL [main_~i~5=10] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11] [L32] assume true; VAL [main_~i~5=11] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12] [L32] assume true; VAL [main_~i~5=12] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13] [L32] assume true; VAL [main_~i~5=13] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14] [L32] assume true; VAL [main_~i~5=14] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15] [L32] assume true; VAL [main_~i~5=15] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16] [L32] assume true; VAL [main_~i~5=16] [L37] assume !(main_~i~5 % 4294967296 < 16); [L38] main_~xx~5 := main_~x~5 % 65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); [L50] havoc __VERIFIER_assert_~cond; [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L52] assume __VERIFIER_assert_~cond == 0; [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=0, main_~z~5=1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 20.2s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 0 SDslu, 1497 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 285 SyntacticMatches, 16 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=16, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 88115 SizeOfPredicates, 15 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2720 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/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-52-48-078.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-52-48-078.csv Received shutdown request...