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/real-life/RailwayCrossing.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:41:52,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:41:52,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:41:52,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:41:52,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:41:52,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:41:52,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:41:52,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:41:52,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:41:52,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:41:52,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:41:52,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:41:52,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:41:52,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:41:52,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:41:52,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:41:52,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:41:52,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:41:52,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:41:52,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:41:52,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:41:52,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:41:52,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:41:52,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:41:52,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:41:52,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:41:52,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:41:52,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:41:52,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:41:52,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:41:52,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:41:52,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:41:52,104 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:41:52,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:41:52,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:41:52,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:41:52,107 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:41:52,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:41:52,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:41:52,124 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:41:52,124 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:41:52,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:41:52,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:41:52,125 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:41:52,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:41:52,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:41:52,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:41:52,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:41:52,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:41:52,126 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:41:52,126 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:41:52,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:41:52,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:41:52,127 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:41:52,127 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:41:52,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:41:52,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:41:52,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:41:52,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:41:52,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:41:52,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:41:52,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:41:52,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:41:52,129 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:41:52,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:41:52,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:41:52,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:41:52,130 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:41:52,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:41:52,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:41:52,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:41:52,191 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:41:52,192 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:41:52,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl [2018-10-04 12:41:52,193 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl' [2018-10-04 12:41:52,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:41:52,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:41:52,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:52,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:41:52,243 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:41:52,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,282 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:41:52,282 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:41:52,282 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:41:52,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:52,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:41:52,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:41:52,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:41:52,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:41:52,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:41:52,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:41:52,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:41:52,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (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:41:52,379 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-04 12:41:52,379 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-04 12:41:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-04 12:41:52,675 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:41:52,675 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:41:52 BoogieIcfgContainer [2018-10-04 12:41:52,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:41:52,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:41:52,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:41:52,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:41:52,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/2) ... [2018-10-04 12:41:52,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b90ce85 and model type RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:41:52, skipping insertion in model container [2018-10-04 12:41:52,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:41:52" (2/2) ... [2018-10-04 12:41:52,684 INFO L112 eAbstractionObserver]: Analyzing ICFG RailwayCrossing.bpl [2018-10-04 12:41:52,694 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:41:52,702 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:41:52,752 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:41:52,753 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:41:52,753 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:41:52,753 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:41:52,753 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:41:52,754 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:41:52,754 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:41:52,754 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:41:52,754 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:41:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-04 12:41:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:41:52,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:52,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:41:52,778 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:52,784 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2018-10-04 12:41:52,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:52,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:52,934 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:41:52,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:52,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:41:52,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:52,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:52,967 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-04 12:41:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:53,067 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 12:41:53,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:53,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:41:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:53,080 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:41:53,081 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:41:53,084 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:41:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:41:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-04 12:41:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:41:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-10-04 12:41:53,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 3 [2018-10-04 12:41:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:53,120 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-10-04 12:41:53,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-04 12:41:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:41:53,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:53,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:53,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:53,121 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1863215691, now seen corresponding path program 1 times [2018-10-04 12:41:53,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:53,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:53,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:53,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:41:53,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:53,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:53,154 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:53,154 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2018-10-04 12:41:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:53,164 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-10-04 12:41:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:53,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-04 12:41:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:53,168 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:41:53,168 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:41:53,169 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:41:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:41:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:41:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:41:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-04 12:41:53,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-10-04 12:41:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:53,172 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-04 12:41:53,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-04 12:41:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:41:53,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:53,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:53,173 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:53,174 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1926837521, now seen corresponding path program 1 times [2018-10-04 12:41:53,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:53,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:53,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:53,298 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:41:53,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:53,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:53,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 12:41:53,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:41:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:41:53,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:53,545 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-10-04 12:41:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:53,603 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-04 12:41:53,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:41:53,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-04 12:41:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:53,605 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:41:53,605 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:41:53,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 12:41:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:41:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-04 12:41:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:41:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-04 12:41:53,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-04 12:41:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:53,611 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-04 12:41:53,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:41:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-04 12:41:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:41:53,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:53,612 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-04 12:41:53,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:53,613 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash 640583104, now seen corresponding path program 2 times [2018-10-04 12:41:53,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:53,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:53,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:53,715 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:41:53,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:41:53,758 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:41:53,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:53,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:54,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:54,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:41:54,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:41:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:41:54,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:54,299 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 8 states. [2018-10-04 12:41:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:54,359 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-10-04 12:41:54,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:41:54,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:41:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:54,360 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:41:54,360 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:41:54,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 5 [2018-10-04 12:41:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:41:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-10-04 12:41:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:41:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 12:41:54,366 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 13 [2018-10-04 12:41:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,368 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 12:41:54,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:41:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 12:41:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:41:54,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,370 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1] [2018-10-04 12:41:54,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:54,370 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,370 INFO L82 PathProgramCache]: Analyzing trace with hash -297055631, now seen corresponding path program 3 times [2018-10-04 12:41:54,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:54,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:54,446 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:41:54,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:41:54,477 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:41:54,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:54,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:54,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:54,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 12:41:54,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:41:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:41:54,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:54,884 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 10 states. [2018-10-04 12:41:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:54,966 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2018-10-04 12:41:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:41:54,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-04 12:41:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:54,967 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:41:54,968 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:41:54,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 6 [2018-10-04 12:41:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:41:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-10-04 12:41:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:41:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-10-04 12:41:54,973 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 18 [2018-10-04 12:41:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,974 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-10-04 12:41:54,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:41:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2018-10-04 12:41:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:41:54,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,975 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1] [2018-10-04 12:41:54,975 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:54,976 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2073218144, now seen corresponding path program 4 times [2018-10-04 12:41:54,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:55,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:55,125 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:41:55,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:41:55,162 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:41:55,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:55,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:55,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:55,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 12:41:55,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:41:55,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:41:55,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:55,537 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 12 states. [2018-10-04 12:41:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:55,840 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2018-10-04 12:41:55,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:41:55,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-10-04 12:41:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:55,842 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:41:55,842 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:41:55,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 7 [2018-10-04 12:41:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:41:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-10-04 12:41:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:41:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-10-04 12:41:55,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 23 [2018-10-04 12:41:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:55,848 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-10-04 12:41:55,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:41:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-10-04 12:41:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:41:55,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:55,850 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1] [2018-10-04 12:41:55,850 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:55,851 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash -609605679, now seen corresponding path program 5 times [2018-10-04 12:41:55,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:55,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:56,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:56,015 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:41:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:41:56,042 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:41:56,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:56,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:56,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:56,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:41:56,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:41:56,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:41:56,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:56,843 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 14 states. [2018-10-04 12:41:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:57,034 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2018-10-04 12:41:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:41:57,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-10-04 12:41:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:57,036 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:41:57,036 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:41:57,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 8 [2018-10-04 12:41:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:41:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-10-04 12:41:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:41:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-10-04 12:41:57,046 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 28 [2018-10-04 12:41:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:57,046 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2018-10-04 12:41:57,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:41:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2018-10-04 12:41:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:41:57,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:57,048 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1] [2018-10-04 12:41:57,048 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:57,048 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash -70825216, now seen corresponding path program 6 times [2018-10-04 12:41:57,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:57,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:57,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:57,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:57,211 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:41:57,221 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:41:57,241 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:41:57,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:57,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:57,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:57,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 12:41:57,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:41:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:41:57,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:57,685 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 16 states. [2018-10-04 12:41:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:57,789 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2018-10-04 12:41:57,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:41:57,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-04 12:41:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:57,790 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:41:57,791 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:41:57,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 9 [2018-10-04 12:41:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:41:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-10-04 12:41:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:41:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2018-10-04 12:41:57,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 33 [2018-10-04 12:41:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:57,798 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-10-04 12:41:57,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:41:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2018-10-04 12:41:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:41:57,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:57,799 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1] [2018-10-04 12:41:57,800 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:57,800 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1872481585, now seen corresponding path program 7 times [2018-10-04 12:41:57,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:57,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:57,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:57,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:57,967 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:41:57,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:57,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:58,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:58,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 12:41:58,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:41:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:41:58,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:58,499 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 18 states. [2018-10-04 12:41:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:58,587 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2018-10-04 12:41:58,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:41:58,587 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-10-04 12:41:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:58,589 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:41:58,589 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 12:41:58,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 10 [2018-10-04 12:41:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 12:41:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-04 12:41:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:41:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-10-04 12:41:58,597 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 38 [2018-10-04 12:41:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:58,597 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-10-04 12:41:58,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:41:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-10-04 12:41:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:41:58,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:58,599 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1] [2018-10-04 12:41:58,599 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:58,599 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1776681376, now seen corresponding path program 8 times [2018-10-04 12:41:58,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:58,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:58,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:58,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:58,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:58,866 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:41:58,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:41:58,893 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:41:58,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:58,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:41:59,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:41:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:41:59,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:59,481 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 20 states. [2018-10-04 12:41:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:59,588 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2018-10-04 12:41:59,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:41:59,588 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-10-04 12:41:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:59,589 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:41:59,590 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:41:59,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 11 [2018-10-04 12:41:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:41:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-10-04 12:41:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 12:41:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2018-10-04 12:41:59,598 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 43 [2018-10-04 12:41:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:59,598 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2018-10-04 12:41:59,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:41:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2018-10-04 12:41:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:41:59,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:59,600 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1] [2018-10-04 12:41:59,601 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:59,601 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash -951698799, now seen corresponding path program 9 times [2018-10-04 12:41:59,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:59,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:59,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:59,814 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:41:59,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:41:59,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:41:59,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:59,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:01,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:01,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 12:42:01,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:42:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:42:01,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:01,462 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand 22 states. [2018-10-04 12:42:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:01,599 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2018-10-04 12:42:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:01,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-10-04 12:42:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:01,601 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:42:01,601 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 12:42:01,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.7s impTime 12 [2018-10-04 12:42:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 12:42:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-10-04 12:42:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 12:42:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2018-10-04 12:42:01,609 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 48 [2018-10-04 12:42:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:01,609 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-10-04 12:42:01,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:42:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2018-10-04 12:42:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 12:42:01,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:01,610 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1] [2018-10-04 12:42:01,610 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:01,610 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:01,611 INFO L82 PathProgramCache]: Analyzing trace with hash -259461056, now seen corresponding path program 10 times [2018-10-04 12:42:01,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:01,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:01,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:01,824 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:42:01,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:42:01,868 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:42:01,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:01,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:03,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:03,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 12:42:03,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:42:03,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:42:03,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:03,022 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand 24 states. [2018-10-04 12:42:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:03,182 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2018-10-04 12:42:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:03,183 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-10-04 12:42:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:03,184 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:42:03,185 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:42:03,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.5s impTime 13 [2018-10-04 12:42:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:42:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-10-04 12:42:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:42:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2018-10-04 12:42:03,192 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 53 [2018-10-04 12:42:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:03,192 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2018-10-04 12:42:03,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:42:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2018-10-04 12:42:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:42:03,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:03,194 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1] [2018-10-04 12:42:03,194 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:03,194 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1213165553, now seen corresponding path program 11 times [2018-10-04 12:42:03,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:03,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:03,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:03,565 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:42:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:42:03,596 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:42:03,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:03,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:04,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:04,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 12:42:04,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:42:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:42:04,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:04,505 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 26 states. [2018-10-04 12:42:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:04,620 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2018-10-04 12:42:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:42:04,621 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2018-10-04 12:42:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:04,622 INFO L225 Difference]: With dead ends: 70 [2018-10-04 12:42:04,622 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 12:42:04,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 14 [2018-10-04 12:42:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 12:42:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-10-04 12:42:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:42:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2018-10-04 12:42:04,629 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 58 [2018-10-04 12:42:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:04,629 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2018-10-04 12:42:04,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:42:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2018-10-04 12:42:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 12:42:04,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,630 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1] [2018-10-04 12:42:04,630 INFO L423 AbstractCegarLoop]: === Iteration 14 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:04,631 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1043720480, now seen corresponding path program 12 times [2018-10-04 12:42:04,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:04,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:04,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:04,988 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:42:04,996 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:42:05,064 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:42:05,064 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:05,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:05,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:05,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 12:42:05,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:42:05,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:42:05,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,484 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 28 states. [2018-10-04 12:42:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:05,580 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-10-04 12:42:05,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:05,581 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-10-04 12:42:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:05,582 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:42:05,582 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:42:05,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 15 [2018-10-04 12:42:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:42:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-10-04 12:42:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:42:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2018-10-04 12:42:05,588 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 63 [2018-10-04 12:42:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:05,589 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-10-04 12:42:05,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:42:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2018-10-04 12:42:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:42:05,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:05,590 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1] [2018-10-04 12:42:05,590 INFO L423 AbstractCegarLoop]: === Iteration 15 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:05,591 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash 14511441, now seen corresponding path program 13 times [2018-10-04 12:42:05,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:05,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:05,794 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:42:05,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:06,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:06,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 12:42:06,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:42:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:42:06,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:06,311 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand 30 states. [2018-10-04 12:42:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:06,422 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2018-10-04 12:42:06,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:42:06,422 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-10-04 12:42:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:06,423 INFO L225 Difference]: With dead ends: 80 [2018-10-04 12:42:06,423 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 12:42:06,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 16 [2018-10-04 12:42:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 12:42:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-10-04 12:42:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:42:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2018-10-04 12:42:06,432 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 68 [2018-10-04 12:42:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:06,433 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2018-10-04 12:42:06,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:42:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2018-10-04 12:42:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:42:06,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:06,434 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1] [2018-10-04 12:42:06,434 INFO L423 AbstractCegarLoop]: === Iteration 16 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:06,435 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1220315776, now seen corresponding path program 14 times [2018-10-04 12:42:06,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:06,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:06,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:06,700 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:42:06,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:06,753 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:06,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:06,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:07,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:07,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 12:42:07,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:42:07,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:42:07,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,322 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand 32 states. [2018-10-04 12:42:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,471 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2018-10-04 12:42:07,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:07,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 73 [2018-10-04 12:42:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,472 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:42:07,473 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 12:42:07,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 17 [2018-10-04 12:42:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 12:42:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-10-04 12:42:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 12:42:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2018-10-04 12:42:07,480 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 73 [2018-10-04 12:42:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,480 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2018-10-04 12:42:07,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:42:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2018-10-04 12:42:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 12:42:07,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,482 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1] [2018-10-04 12:42:07,482 INFO L423 AbstractCegarLoop]: === Iteration 17 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:07,482 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash 127283889, now seen corresponding path program 15 times [2018-10-04 12:42:07,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:08,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:08,677 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:42:08,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:42:08,720 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:42:08,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:08,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:09,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:09,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 12:42:09,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:42:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:42:09,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:09,195 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand 34 states. [2018-10-04 12:42:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:09,281 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2018-10-04 12:42:09,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:09,282 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 78 [2018-10-04 12:42:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:09,283 INFO L225 Difference]: With dead ends: 90 [2018-10-04 12:42:09,283 INFO L226 Difference]: Without dead ends: 88 [2018-10-04 12:42:09,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 18 [2018-10-04 12:42:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-04 12:42:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-10-04 12:42:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-04 12:42:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2018-10-04 12:42:09,289 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 78 [2018-10-04 12:42:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:09,289 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2018-10-04 12:42:09,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:42:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2018-10-04 12:42:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 12:42:09,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:09,290 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1] [2018-10-04 12:42:09,290 INFO L423 AbstractCegarLoop]: === Iteration 18 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:09,291 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:09,291 INFO L82 PathProgramCache]: Analyzing trace with hash -233894880, now seen corresponding path program 16 times [2018-10-04 12:42:09,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:09,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:09,732 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:09,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:42:09,761 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:42:09,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:09,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:10,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:10,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 12:42:10,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:42:10,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:42:10,361 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,361 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 36 states. [2018-10-04 12:42:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,589 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2018-10-04 12:42:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:42:10,591 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 83 [2018-10-04 12:42:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,592 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:42:10,593 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 12:42:10,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 19 [2018-10-04 12:42:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 12:42:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-10-04 12:42:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:42:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2018-10-04 12:42:10,607 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 83 [2018-10-04 12:42:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,607 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2018-10-04 12:42:10,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:42:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2018-10-04 12:42:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 12:42:10,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,613 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1] [2018-10-04 12:42:10,613 INFO L423 AbstractCegarLoop]: === Iteration 19 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,614 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash -610287599, now seen corresponding path program 17 times [2018-10-04 12:42:10,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:10,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:10,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:10,848 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:10,856 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:42:10,890 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:42:10,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:10,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:11,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:11,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 12:42:11,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:42:11,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:42:11,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:11,674 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand 38 states. [2018-10-04 12:42:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:11,797 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2018-10-04 12:42:11,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:42:11,798 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2018-10-04 12:42:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:11,799 INFO L225 Difference]: With dead ends: 100 [2018-10-04 12:42:11,799 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 12:42:11,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.3s impTime 20 [2018-10-04 12:42:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 12:42:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-10-04 12:42:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-04 12:42:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2018-10-04 12:42:11,804 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 88 [2018-10-04 12:42:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:11,804 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2018-10-04 12:42:11,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:42:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2018-10-04 12:42:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-04 12:42:11,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:11,805 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1] [2018-10-04 12:42:11,806 INFO L423 AbstractCegarLoop]: === Iteration 20 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:11,806 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2059852480, now seen corresponding path program 18 times [2018-10-04 12:42:11,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:11,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:11,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:11,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,130 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:12,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:12,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:12,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:42:12,188 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:42:12,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:12,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:12,784 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:12,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:12,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2018-10-04 12:42:12,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:42:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:42:12,943 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:12,943 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand 41 states. [2018-10-04 12:42:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:13,079 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2018-10-04 12:42:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:13,079 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 93 [2018-10-04 12:42:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:13,080 INFO L225 Difference]: With dead ends: 105 [2018-10-04 12:42:13,080 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 12:42:13,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 9 [2018-10-04 12:42:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 12:42:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-10-04 12:42:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 12:42:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2018-10-04 12:42:13,086 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 93 [2018-10-04 12:42:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:13,086 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2018-10-04 12:42:13,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:42:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2018-10-04 12:42:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 12:42:13,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:13,087 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1] [2018-10-04 12:42:13,088 INFO L423 AbstractCegarLoop]: === Iteration 21 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:13,088 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash -996141711, now seen corresponding path program 19 times [2018-10-04 12:42:13,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:13,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:13,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:13,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:13,386 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:13,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:13,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:13,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:13,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:14,069 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:14,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:14,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2018-10-04 12:42:14,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:42:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:42:14,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:14,207 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand 43 states. [2018-10-04 12:42:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:14,382 INFO L93 Difference]: Finished difference Result 110 states and 152 transitions. [2018-10-04 12:42:14,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:42:14,382 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 98 [2018-10-04 12:42:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:14,383 INFO L225 Difference]: With dead ends: 110 [2018-10-04 12:42:14,383 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 12:42:14,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 10 [2018-10-04 12:42:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 12:42:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2018-10-04 12:42:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-04 12:42:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2018-10-04 12:42:14,389 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 98 [2018-10-04 12:42:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:14,390 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2018-10-04 12:42:14,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:42:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2018-10-04 12:42:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 12:42:14,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:14,391 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1] [2018-10-04 12:42:14,391 INFO L423 AbstractCegarLoop]: === Iteration 22 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:14,391 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:14,391 INFO L82 PathProgramCache]: Analyzing trace with hash -511385248, now seen corresponding path program 20 times [2018-10-04 12:42:14,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:14,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,888 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:14,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:14,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:14,975 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:14,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:14,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:16,730 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:16,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:16,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2018-10-04 12:42:16,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:42:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:42:16,989 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:16,990 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand 45 states. [2018-10-04 12:42:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:17,363 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2018-10-04 12:42:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:42:17,365 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 103 [2018-10-04 12:42:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:17,366 INFO L225 Difference]: With dead ends: 115 [2018-10-04 12:42:17,366 INFO L226 Difference]: Without dead ends: 113 [2018-10-04 12:42:17,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.1s impTime 11 [2018-10-04 12:42:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-04 12:42:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-10-04 12:42:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:42:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2018-10-04 12:42:17,371 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 103 [2018-10-04 12:42:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:17,371 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2018-10-04 12:42:17,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:42:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2018-10-04 12:42:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 12:42:17,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:17,372 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1] [2018-10-04 12:42:17,372 INFO L423 AbstractCegarLoop]: === Iteration 23 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:17,372 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash 851260113, now seen corresponding path program 21 times [2018-10-04 12:42:17,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:17,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:17,785 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:17,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:17,824 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:42:17,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:42:17,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:17,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:19,201 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:19,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:19,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-10-04 12:42:19,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:42:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:42:19,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:19,383 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand 47 states. [2018-10-04 12:42:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:19,570 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2018-10-04 12:42:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:42:19,571 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 108 [2018-10-04 12:42:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:19,572 INFO L225 Difference]: With dead ends: 120 [2018-10-04 12:42:19,572 INFO L226 Difference]: Without dead ends: 118 [2018-10-04 12:42:19,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.9s impTime 12 [2018-10-04 12:42:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-04 12:42:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-10-04 12:42:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-04 12:42:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2018-10-04 12:42:19,578 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 108 [2018-10-04 12:42:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:19,579 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2018-10-04 12:42:19,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:42:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2018-10-04 12:42:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-04 12:42:19,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:19,580 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1] [2018-10-04 12:42:19,580 INFO L423 AbstractCegarLoop]: === Iteration 24 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:19,580 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash -572317696, now seen corresponding path program 22 times [2018-10-04 12:42:19,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:19,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:19,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,111 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:20,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:20,222 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:20,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:42:20,260 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:42:20,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:20,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:21,269 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:21,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:21,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2018-10-04 12:42:21,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:42:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:42:21,737 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:21,737 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand 49 states. [2018-10-04 12:42:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:21,923 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2018-10-04 12:42:21,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:42:21,923 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 113 [2018-10-04 12:42:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:21,924 INFO L225 Difference]: With dead ends: 125 [2018-10-04 12:42:21,924 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 12:42:21,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.9s impTime 13 [2018-10-04 12:42:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 12:42:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-10-04 12:42:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 12:42:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2018-10-04 12:42:21,930 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 113 [2018-10-04 12:42:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:21,930 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2018-10-04 12:42:21,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:42:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2018-10-04 12:42:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 12:42:21,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:21,931 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1] [2018-10-04 12:42:21,931 INFO L423 AbstractCegarLoop]: === Iteration 25 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:21,931 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 513611825, now seen corresponding path program 23 times [2018-10-04 12:42:21,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:21,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:21,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,335 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:22,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:22,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:22,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:42:22,519 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:42:22,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:22,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:22,949 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:23,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2018-10-04 12:42:23,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:42:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:42:23,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:23,310 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand 51 states. [2018-10-04 12:42:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:23,462 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2018-10-04 12:42:23,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:42:23,462 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 118 [2018-10-04 12:42:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:23,463 INFO L225 Difference]: With dead ends: 130 [2018-10-04 12:42:23,463 INFO L226 Difference]: Without dead ends: 128 [2018-10-04 12:42:23,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime 14 [2018-10-04 12:42:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-04 12:42:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-10-04 12:42:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-04 12:42:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2018-10-04 12:42:23,469 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 118 [2018-10-04 12:42:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:23,470 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2018-10-04 12:42:23,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:42:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2018-10-04 12:42:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 12:42:23,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:23,471 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1] [2018-10-04 12:42:23,471 INFO L423 AbstractCegarLoop]: === Iteration 26 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:23,471 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:23,471 INFO L82 PathProgramCache]: Analyzing trace with hash -285501792, now seen corresponding path program 24 times [2018-10-04 12:42:23,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:23,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:23,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:23,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,800 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:23,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:23,880 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:23,886 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:42:23,937 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:42:23,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:23,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:24,519 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:25,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:25,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 52 [2018-10-04 12:42:25,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:42:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:42:25,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:25,031 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 53 states. [2018-10-04 12:42:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:25,256 INFO L93 Difference]: Finished difference Result 135 states and 187 transitions. [2018-10-04 12:42:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:42:25,256 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 123 [2018-10-04 12:42:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:25,258 INFO L225 Difference]: With dead ends: 135 [2018-10-04 12:42:25,258 INFO L226 Difference]: Without dead ends: 133 [2018-10-04 12:42:25,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.5s impTime 15 [2018-10-04 12:42:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-04 12:42:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-10-04 12:42:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-04 12:42:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2018-10-04 12:42:25,264 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 123 [2018-10-04 12:42:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:25,265 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2018-10-04 12:42:25,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:42:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2018-10-04 12:42:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-04 12:42:25,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:25,266 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1] [2018-10-04 12:42:25,266 INFO L423 AbstractCegarLoop]: === Iteration 27 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:25,266 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1768277393, now seen corresponding path program 25 times [2018-10-04 12:42:25,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,635 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:25,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:25,775 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:25,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:26,334 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:26,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 54 [2018-10-04 12:42:26,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 12:42:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 12:42:26,737 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:26,737 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 55 states. [2018-10-04 12:42:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:26,998 INFO L93 Difference]: Finished difference Result 140 states and 194 transitions. [2018-10-04 12:42:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:42:26,998 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 128 [2018-10-04 12:42:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:26,999 INFO L225 Difference]: With dead ends: 140 [2018-10-04 12:42:27,000 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 12:42:27,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 17 [2018-10-04 12:42:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 12:42:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2018-10-04 12:42:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-04 12:42:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2018-10-04 12:42:27,005 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 128 [2018-10-04 12:42:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:27,005 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2018-10-04 12:42:27,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 12:42:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2018-10-04 12:42:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-04 12:42:27,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:27,006 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1] [2018-10-04 12:42:27,007 INFO L423 AbstractCegarLoop]: === Iteration 28 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:27,007 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash -77052608, now seen corresponding path program 26 times [2018-10-04 12:42:27,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:27,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:27,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:27,388 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:27,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:27,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:27,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:27,653 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:27,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:27,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:28,397 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:28,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 56 [2018-10-04 12:42:28,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:42:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:42:28,835 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:28,835 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand 57 states. [2018-10-04 12:42:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:29,038 INFO L93 Difference]: Finished difference Result 145 states and 201 transitions. [2018-10-04 12:42:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:42:29,038 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 133 [2018-10-04 12:42:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:29,039 INFO L225 Difference]: With dead ends: 145 [2018-10-04 12:42:29,039 INFO L226 Difference]: Without dead ends: 143 [2018-10-04 12:42:29,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.9s impTime 18 [2018-10-04 12:42:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-04 12:42:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-10-04 12:42:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-04 12:42:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2018-10-04 12:42:29,045 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 133 [2018-10-04 12:42:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:29,045 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2018-10-04 12:42:29,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:42:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2018-10-04 12:42:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-04 12:42:29,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:29,046 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1] [2018-10-04 12:42:29,046 INFO L423 AbstractCegarLoop]: === Iteration 29 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:29,047 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1019034353, now seen corresponding path program 27 times [2018-10-04 12:42:29,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:29,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:29,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:29,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:29,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:29,452 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:29,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:29,657 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:29,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:42:29,724 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:42:29,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:29,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:30,387 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:31,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:31,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 58 [2018-10-04 12:42:31,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 12:42:31,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 12:42:31,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:31,078 INFO L87 Difference]: Start difference. First operand 139 states and 193 transitions. Second operand 59 states. [2018-10-04 12:42:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:31,338 INFO L93 Difference]: Finished difference Result 150 states and 208 transitions. [2018-10-04 12:42:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:42:31,338 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 138 [2018-10-04 12:42:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:31,339 INFO L225 Difference]: With dead ends: 150 [2018-10-04 12:42:31,339 INFO L226 Difference]: Without dead ends: 148 [2018-10-04 12:42:31,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.0s impTime 18 [2018-10-04 12:42:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-04 12:42:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-10-04 12:42:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-04 12:42:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 200 transitions. [2018-10-04 12:42:31,345 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 200 transitions. Word has length 138 [2018-10-04 12:42:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:31,346 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 200 transitions. [2018-10-04 12:42:31,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 12:42:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2018-10-04 12:42:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-04 12:42:31,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:31,347 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1] [2018-10-04 12:42:31,347 INFO L423 AbstractCegarLoop]: === Iteration 30 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:31,347 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash -247256096, now seen corresponding path program 28 times [2018-10-04 12:42:31,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:31,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:31,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:31,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:32,099 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:32,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:32,312 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:32,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:42:32,360 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:42:32,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:32,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:32,834 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:33,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:33,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2018-10-04 12:42:33,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:42:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:42:33,710 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:33,710 INFO L87 Difference]: Start difference. First operand 144 states and 200 transitions. Second operand 61 states. [2018-10-04 12:42:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:33,942 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions. [2018-10-04 12:42:33,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:42:33,943 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 143 [2018-10-04 12:42:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:33,944 INFO L225 Difference]: With dead ends: 155 [2018-10-04 12:42:33,944 INFO L226 Difference]: Without dead ends: 153 [2018-10-04 12:42:33,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.4s impTime 20 [2018-10-04 12:42:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-04 12:42:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-10-04 12:42:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-04 12:42:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 207 transitions. [2018-10-04 12:42:33,950 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 207 transitions. Word has length 143 [2018-10-04 12:42:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:33,951 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 207 transitions. [2018-10-04 12:42:33,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:42:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2018-10-04 12:42:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 12:42:33,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:33,952 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1] [2018-10-04 12:42:33,952 INFO L423 AbstractCegarLoop]: === Iteration 31 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:33,953 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:33,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1791588433, now seen corresponding path program 29 times [2018-10-04 12:42:33,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:33,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:33,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:33,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:33,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:34,724 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:35,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:35,228 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:35,235 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:42:35,309 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 12:42:35,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:35,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:35,757 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:36,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 62 [2018-10-04 12:42:36,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 12:42:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 12:42:36,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:36,355 INFO L87 Difference]: Start difference. First operand 149 states and 207 transitions. Second operand 63 states. [2018-10-04 12:42:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:36,662 INFO L93 Difference]: Finished difference Result 160 states and 222 transitions. [2018-10-04 12:42:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:42:36,664 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 148 [2018-10-04 12:42:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:36,665 INFO L225 Difference]: With dead ends: 160 [2018-10-04 12:42:36,665 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 12:42:36,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.4s impTime 21 [2018-10-04 12:42:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 12:42:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2018-10-04 12:42:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-04 12:42:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2018-10-04 12:42:36,671 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 148 [2018-10-04 12:42:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:36,671 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2018-10-04 12:42:36,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 12:42:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2018-10-04 12:42:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-04 12:42:36,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:36,672 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1] [2018-10-04 12:42:36,672 INFO L423 AbstractCegarLoop]: === Iteration 32 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:36,672 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1713785472, now seen corresponding path program 30 times [2018-10-04 12:42:36,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:36,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:37,037 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:37,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:37,339 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:37,346 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:42:37,411 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:42:37,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:37,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:37,896 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:38,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:38,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 64 [2018-10-04 12:42:38,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:42:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:42:38,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:38,522 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand 65 states. [2018-10-04 12:42:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:38,782 INFO L93 Difference]: Finished difference Result 165 states and 229 transitions. [2018-10-04 12:42:38,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:42:38,782 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 153 [2018-10-04 12:42:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:38,783 INFO L225 Difference]: With dead ends: 165 [2018-10-04 12:42:38,783 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 12:42:38,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.9s impTime 21 [2018-10-04 12:42:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 12:42:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-10-04 12:42:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-04 12:42:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2018-10-04 12:42:38,789 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 153 [2018-10-04 12:42:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:38,789 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2018-10-04 12:42:38,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:42:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2018-10-04 12:42:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-04 12:42:38,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:38,790 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1] [2018-10-04 12:42:38,791 INFO L423 AbstractCegarLoop]: === Iteration 33 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:38,791 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:38,791 INFO L82 PathProgramCache]: Analyzing trace with hash -835682895, now seen corresponding path program 31 times [2018-10-04 12:42:38,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:38,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:38,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:39,132 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:39,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:39,345 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:39,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:39,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:39,861 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:40,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:40,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 66 [2018-10-04 12:42:40,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 12:42:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 12:42:40,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:40,513 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand 67 states. [2018-10-04 12:42:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:41,298 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2018-10-04 12:42:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:42:41,298 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 158 [2018-10-04 12:42:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:41,299 INFO L225 Difference]: With dead ends: 170 [2018-10-04 12:42:41,299 INFO L226 Difference]: Without dead ends: 168 [2018-10-04 12:42:41,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.7s impTime 22 [2018-10-04 12:42:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-04 12:42:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-10-04 12:42:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-04 12:42:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2018-10-04 12:42:41,306 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 158 [2018-10-04 12:42:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:41,307 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2018-10-04 12:42:41,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 12:42:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2018-10-04 12:42:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-04 12:42:41,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:41,308 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1] [2018-10-04 12:42:41,308 INFO L423 AbstractCegarLoop]: === Iteration 34 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:41,308 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash 925606176, now seen corresponding path program 32 times [2018-10-04 12:42:41,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:41,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:41,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:41,665 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:42,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:42,082 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:42,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:42,153 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:42,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:42,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:42,595 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:43,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:43,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 68 [2018-10-04 12:42:43,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:42:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:42:43,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:43,326 INFO L87 Difference]: Start difference. First operand 164 states and 228 transitions. Second operand 69 states. [2018-10-04 12:42:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:43,615 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2018-10-04 12:42:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:42:43,615 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 163 [2018-10-04 12:42:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:43,616 INFO L225 Difference]: With dead ends: 175 [2018-10-04 12:42:43,616 INFO L226 Difference]: Without dead ends: 173 [2018-10-04 12:42:43,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.0s impTime 23 [2018-10-04 12:42:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-04 12:42:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2018-10-04 12:42:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-04 12:42:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 235 transitions. [2018-10-04 12:42:43,623 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 235 transitions. Word has length 163 [2018-10-04 12:42:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:43,623 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 235 transitions. [2018-10-04 12:42:43,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:42:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 235 transitions. [2018-10-04 12:42:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-04 12:42:43,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:43,624 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1] [2018-10-04 12:42:43,625 INFO L423 AbstractCegarLoop]: === Iteration 35 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:43,625 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1441248495, now seen corresponding path program 33 times [2018-10-04 12:42:43,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:43,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:43,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:43,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:43,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:44,391 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:44,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:44,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:44,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:42:44,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 12:42:44,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:44,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:45,360 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:46,746 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:46,747 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (and (<= GateController_time 144) (exists ((GateController_one Int)) (and (<= (* 1000 GateController_one) GateController_thousand) (<= 1 GateController_one)))))) (and .cse0 (not .cse0))) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.restructurePredicateTrie(BPredicateUnifier.java:371) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:249) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-04 12:42:46,752 INFO L168 Benchmark]: Toolchain (without parser) took 54510.95 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 474.5 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 220.9 MB). Peak memory consumption was 695.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:46,755 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:42:46,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.32 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:42:46,756 INFO L168 Benchmark]: Boogie Preprocessor took 27.57 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:42:46,756 INFO L168 Benchmark]: RCFGBuilder took 362.34 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:42:46,757 INFO L168 Benchmark]: TraceAbstraction took 54074.09 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 474.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Peak memory consumption was 674.2 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:46,762 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.21 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 42.32 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 27.57 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 362.34 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 54074.09 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 474.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Peak memory consumption was 674.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (and (<= GateController_time 144) (exists ((GateController_one Int)) (and (<= (* 1000 GateController_one) GateController_thousand) (<= 1 GateController_one)))))) (and .cse0 (not .cse0))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (and (<= GateController_time 144) (exists ((GateController_one Int)) (and (<= (* 1000 GateController_one) GateController_thousand) (<= 1 GateController_one)))))) (and .cse0 (not .cse0))): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/RailwayCrossing.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-42-46-782.csv Received shutdown request...