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-9f4048f [2018-10-04 12:50:54,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:50:54,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:50:54,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:50:54,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:50:54,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:50:54,826 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:50:54,828 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:50:54,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:50:54,832 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:50:54,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:50:54,835 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:50:54,836 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:50:54,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:50:54,839 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:50:54,839 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:50:54,840 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:50:54,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:50:54,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:50:54,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:50:54,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:50:54,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:50:54,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:50:54,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:50:54,866 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:50:54,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:50:54,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:50:54,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:50:54,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:50:54,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:50:54,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:50:54,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:50:54,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:50:54,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:50:54,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:50:54,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:50:54,878 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:50:54,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:50:54,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:50:54,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:50:54,910 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:50:54,910 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:50:54,910 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:50:54,911 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:50:54,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:50:54,913 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:50:54,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:50:54,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:50:54,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:50:54,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:50:54,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:50:54,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:50:54,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:50:54,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:50:54,915 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:50:54,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:50:54,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:50:54,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:50:54,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:50:54,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:50:54,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:50:54,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:50:54,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:50:54,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:50:54,919 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:50:54,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:50:54,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:50:54,919 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:50:54,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:50:54,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:50:54,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:50:54,996 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:50:54,997 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:50:54,998 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-10-04 12:50:54,998 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-10-04 12:50:55,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:50:55,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:50:55,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:50:55,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:50:55,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:50:55,103 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,115 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:50:55,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:50:55,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:50:55,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:50:55,134 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,134 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,136 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,136 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,141 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,144 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,145 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 04.10 12:50:55" (1/1) ... [2018-10-04 12:50:55,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:50:55,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:50:55,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:50:55,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:50:55,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:50:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:50:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:50:55,466 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:50:55,466 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:50:55 BoogieIcfgContainer [2018-10-04 12:50:55,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:50:55,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:50:55,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:50:55,472 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:50:55,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:55" (1/2) ... [2018-10-04 12:50:55,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcfdb92 and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:50:55, skipping insertion in model container [2018-10-04 12:50:55,474 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 04.10 12:50:55" (2/2) ... [2018-10-04 12:50:55,477 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-10-04 12:50:55,488 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:50:55,501 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:50:55,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:50:55,561 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:50:55,561 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:50:55,561 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:50:55,562 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:50:55,563 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:50:55,564 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:50:55,564 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:50:55,564 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:50:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:50:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:50:55,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:55,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:50:55,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:55,606 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 12:50:55,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:55,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:55,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:55,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:55,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:55,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:50:55,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:50:55,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:50:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:50:55,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:55,817 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 12:50:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:55,863 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 12:50:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:50:55,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:50:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:55,877 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:50:55,877 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:50:55,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:50:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:50:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:50:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:50:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:50:55,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 12:50:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:55,911 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:50:55,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:50:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:50:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:50:55,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:55,912 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 12:50:55,912 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:55,912 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 12:50:55,912 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:55,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:55,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:56,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:56,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:56,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:56,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:56,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:50:56,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:50:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:50:56,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:56,389 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-04 12:50:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:56,468 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:50:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:50:56,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 12:50:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:56,473 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:50:56,473 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:50:56,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 2 [2018-10-04 12:50:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:50:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:50:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:50:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:50:56,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 12:50:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:56,478 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:50:56,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:50:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:50:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:50:56,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:56,479 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 12:50:56,479 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:56,479 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:56,480 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 12:50:56,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:56,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:56,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:56,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:56,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:56,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:56,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:56,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:56,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:56,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:50:56,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:50:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:50:56,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:56,759 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-04 12:50:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:56,809 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:50:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:50:56,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-04 12:50:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:56,811 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:50:56,812 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:50:56,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:50:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:50:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:50:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:50:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:50:56,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 12:50:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:56,817 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:50:56,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:50:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:50:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:50:56,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:56,819 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 12:50:56,819 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:56,819 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 12:50:56,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:56,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:56,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:56,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:57,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:57,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:57,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:57,079 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:50:57,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:57,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:57,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:57,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:50:57,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:50:57,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:50:57,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:57,286 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-04 12:50:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:57,339 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:50:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:50:57,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-04 12:50:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:57,342 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:50:57,342 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:50:57,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 4 [2018-10-04 12:50:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:50:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:50:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:50:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:50:57,346 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 12:50:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:57,347 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:50:57,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:50:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:50:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:50:57,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:57,348 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 12:50:57,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:57,348 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 12:50:57,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:57,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:57,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:57,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:57,514 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:57,534 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:57,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:57,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:57,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:50:57,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:50:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:50:57,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:57,744 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-04 12:50:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:57,802 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:50:57,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:50:57,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-04 12:50:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:57,805 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:50:57,805 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:50:57,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 5 [2018-10-04 12:50:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:50:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:50:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:50:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:50:57,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 12:50:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:57,811 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:50:57,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:50:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:50:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:50:57,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:57,812 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 12:50:57,812 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:57,812 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 12:50:57,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:57,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:57,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:57,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:57,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:57,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:57,940 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-10-04 12:50:57,950 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:50:57,977 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:50:57,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:57,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:58,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:58,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:50:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:50:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:50:58,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:58,084 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-04 12:50:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:58,185 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:50:58,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:50:58,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-04 12:50:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:58,187 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:50:58,188 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:50:58,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:50:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:50:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:50:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:50:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:50:58,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 12:50:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:58,193 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:50:58,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:50:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:50:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:50:58,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:58,194 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 12:50:58,195 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:58,195 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 12:50:58,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:58,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:58,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:58,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:58,716 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-10-04 12:50:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:50:58,821 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:50:58,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:58,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:58,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:58,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:50:58,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:50:58,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:50:58,978 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:58,978 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-04 12:50:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:59,052 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:50:59,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:50:59,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:50:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:59,056 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:50:59,056 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:50:59,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 7 [2018-10-04 12:50:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:50:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:50:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:50:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:50:59,061 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 12:50:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:59,061 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:50:59,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:50:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:50:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:50:59,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:59,063 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 12:50:59,063 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:59,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:59,063 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 12:50:59,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:59,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:59,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:59,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:59,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:59,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:59,533 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-10-04 12:50:59,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:59,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:59,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:59,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:50:59,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:50:59,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:50:59,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:59,696 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-04 12:50:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:59,784 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:50:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:50:59,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-04 12:50:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:59,786 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:50:59,786 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:50:59,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 8 [2018-10-04 12:50:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:50:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:50:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:50:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:50:59,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 12:50:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:59,792 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:50:59,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:50:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:50:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:50:59,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:59,793 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 12:50:59,793 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:59,793 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 12:50:59,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:59,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:59,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:59,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:59,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:59,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:59,966 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-10-04 12:50:59,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:59,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:59,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:00,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:00,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:00,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:51:00,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:51:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:51:00,103 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:00,104 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-04 12:51:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:00,281 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:51:00,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:51:00,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 12:51:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:00,283 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:51:00,283 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:51:00,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 12:51:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:51:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:51:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:51:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 12:51:00,289 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-04 12:51:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:00,289 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 12:51:00,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:51:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 12:51:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:51:00,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:00,291 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-04 12:51:00,291 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:00,291 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:00,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-04 12:51:00,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:00,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:00,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:00,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:00,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:00,461 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-10-04 12:51:00,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:51:00,511 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:51:00,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:00,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:00,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:00,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:51:00,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:51:00,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:51:00,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:00,683 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-04 12:51:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:00,839 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:51:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:51:00,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-04 12:51:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:00,841 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:51:00,841 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:51:00,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 12:51:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:51:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:51:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:51:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:51:00,848 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-04 12:51:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:00,848 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:51:00,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:51:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:51:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:51:00,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:00,849 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-04 12:51:00,849 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:00,850 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-04 12:51:00,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:00,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:01,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:01,048 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-10-04 12:51:01,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:51:01,067 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:51:01,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:01,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:01,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:01,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 12:51:01,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:51:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:51:01,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:01,464 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-04 12:51:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:01,669 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 12:51:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:51:01,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-04 12:51:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:01,671 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:51:01,671 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:51:01,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 11 [2018-10-04 12:51:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:51:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:51:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:51:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 12:51:01,677 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-04 12:51:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:01,677 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 12:51:01,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:51:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 12:51:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:51:01,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:01,678 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-04 12:51:01,679 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:01,679 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-04 12:51:01,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:01,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:02,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:02,013 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-10-04 12:51:02,021 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:51:04,905 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:51:04,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:05,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:05,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:05,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:51:05,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:51:05,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:51:05,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:05,317 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-04 12:51:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:05,478 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:51:05,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:51:05,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-04 12:51:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:05,480 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:51:05,480 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:51:05,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 12 [2018-10-04 12:51:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:51:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:51:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:51:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:51:05,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-04 12:51:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:05,486 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:51:05,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:51:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:51:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:51:05,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:05,487 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-04 12:51:05,488 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:05,488 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-04 12:51:05,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:05,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:05,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:05,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:05,719 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-10-04 12:51:05,745 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:51:05,864 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:51:05,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:05,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:06,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:06,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:51:06,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:51:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:51:06,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:06,022 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-04 12:51:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:06,186 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 12:51:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:51:06,187 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-04 12:51:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:06,189 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:51:06,189 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:51:06,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 13 [2018-10-04 12:51:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:51:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:51:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:51:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 12:51:06,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-04 12:51:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:06,196 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 12:51:06,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:51:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 12:51:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:51:06,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:06,197 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-04 12:51:06,197 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:06,198 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-04 12:51:06,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:06,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:06,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:07,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:07,139 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-10-04 12:51:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:07,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:07,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:07,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 12:51:07,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:51:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:51:07,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:07,392 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-04 12:51:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:07,638 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:51:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:51:07,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-04 12:51:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:07,639 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:51:07,639 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:51:07,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 14 [2018-10-04 12:51:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:51:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:51:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:51:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:51:07,647 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-04 12:51:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:07,647 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:51:07,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:51:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:51:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:51:07,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:07,649 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-04 12:51:07,649 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:07,649 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-04 12:51:07,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:07,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:08,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:08,158 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-10-04 12:51:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:51:08,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:51:08,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:08,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:08,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:08,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:51:08,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:51:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:51:08,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:08,842 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-04 12:51:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:09,076 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 12:51:09,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:51:09,078 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-04 12:51:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:09,079 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:51:09,079 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:51:09,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.3s impTime 15 [2018-10-04 12:51:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:51:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:51:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:51:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 12:51:09,085 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-04 12:51:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:09,085 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 12:51:09,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:51:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 12:51:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:51:09,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:09,086 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-04 12:51:09,087 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:09,087 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-04 12:51:09,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:09,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:09,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:09,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:09,358 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-10-04 12:51:09,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:51:09,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:51:09,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:09,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:09,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:09,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:51:09,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:51:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:51:09,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:09,759 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-04 12:51:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:09,982 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 12:51:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:51:09,985 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-04 12:51:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:09,985 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:51:09,986 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:51:09,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 12:51:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:51:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 12:51:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:51:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:51:09,991 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-04 12:51:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:09,991 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:51:09,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:51:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:51:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:51:09,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:09,992 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-04 12:51:09,992 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:09,992 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-04 12:51:09,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:09,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:09,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:51:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:51:10,028 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 12:51:10,055 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:51:10 BoogieIcfgContainer [2018-10-04 12:51:10,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:51:10,056 INFO L168 Benchmark]: Toolchain (without parser) took 14976.16 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 19.9 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 236.9 MB). Peak memory consumption was 256.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:51:10,058 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:51:10,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:51:10,060 INFO L168 Benchmark]: Boogie Preprocessor took 30.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:51:10,060 INFO L168 Benchmark]: RCFGBuilder took 313.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:51:10,061 INFO L168 Benchmark]: TraceAbstraction took 14587.76 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 19.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 215.7 MB). Peak memory consumption was 235.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:51:10,066 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.22 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 40.27 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 30.65 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 313.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14587.76 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 19.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 215.7 MB). Peak memory consumption was 235.6 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, 14.5s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 0 SDslu, 1497 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 285 SyntacticMatches, 16 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s 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, 7.6s 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-10-04_12-51-10-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-10-04_12-51-10-078.csv Received shutdown request...