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/GateController.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:41:52,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:41:52,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:41:52,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:41:52,208 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:41:52,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:41:52,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:41:52,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:41:52,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:41:52,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:41:52,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:41:52,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:41:52,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:41:52,218 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:41:52,219 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:41:52,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:41:52,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:41:52,223 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:41:52,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:41:52,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:41:52,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:41:52,229 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:41:52,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:41:52,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:41:52,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:41:52,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:41:52,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:41:52,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:41:52,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:41:52,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:41:52,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:41:52,238 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:41:52,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:41:52,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:41:52,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:41:52,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:41:52,241 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,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:41:52,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:41:52,258 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:41:52,259 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:41:52,259 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:41:52,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:41:52,260 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:41:52,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:41:52,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:41:52,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:41:52,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:41:52,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:41:52,262 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:41:52,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:41:52,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:41:52,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:41:52,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:41:52,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:41:52,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:41:52,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:41:52,264 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:41:52,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:41:52,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:41:52,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:41:52,265 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:41:52,265 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:41:52,265 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:41:52,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:41:52,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:41:52,266 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:41:52,268 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:41:52,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:41:52,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:41:52,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:41:52,354 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:41:52,354 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:41:52,355 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateController.bpl [2018-10-04 12:41:52,355 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateController.bpl' [2018-10-04 12:41:52,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:41:52,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:41:52,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:52,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:41:52,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:41:52,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,450 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:41:52,450 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:41:52,451 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:41:52,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:52,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:41:52,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:41:52,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:41:52,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/1) ... [2018-10-04 12:41:52,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:41:52,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:41:52,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:41:52,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:41:52,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateController.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,558 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-04 12:41:52,559 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-04 12:41:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-04 12:41:52,776 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:41:52,777 INFO L202 PluginConnector]: Adding new model GateController.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:41:52 BoogieIcfgContainer [2018-10-04 12:41:52,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:41:52,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:41:52,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:41:52,782 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:41:52,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/2) ... [2018-10-04 12:41:52,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fea6650 and model type GateController.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,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateController.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:41:52" (2/2) ... [2018-10-04 12:41:52,790 INFO L112 eAbstractionObserver]: Analyzing ICFG GateController.bpl [2018-10-04 12:41:52,799 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:41:52,808 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:41:52,855 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:41:52,856 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:41:52,856 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:41:52,856 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:41:52,856 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:41:52,856 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:41:52,856 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:41:52,857 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:41:52,857 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:41:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-04 12:41:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:41:52,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:52,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:41:52,881 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:52,888 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-10-04 12:41:52,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:52,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,049 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:53,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:53,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:41:53,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:53,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:53,075 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-04 12:41:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:53,167 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-10-04 12:41:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:53,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:41:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:53,185 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:41:53,185 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:41:53,189 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,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:41:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-04 12:41:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:41:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-04 12:41:53,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 3 [2018-10-04 12:41:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:53,230 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-04 12:41:53,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-04 12:41:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:41:53,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:53,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:53,231 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:53,231 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:53,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1953617644, now seen corresponding path program 1 times [2018-10-04 12:41:53,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:53,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,361 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,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:53,362 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,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:53,829 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,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:53,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:41:53,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:41:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:41:53,864 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:53,864 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2018-10-04 12:41:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:53,996 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-10-04 12:41:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:41:53,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:41:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:53,999 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:41:54,000 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:41:54,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 6 [2018-10-04 12:41:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:41:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-10-04 12:41:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:41:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-04 12:41:54,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-04 12:41:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,010 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-04 12:41:54,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:41:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-04 12:41:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:41:54,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,012 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:54,013 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:54,013 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1953558062, now seen corresponding path program 1 times [2018-10-04 12:41:54,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:54,070 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:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:54,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:41:54,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:54,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:54,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:54,072 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 3 states. [2018-10-04 12:41:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:54,099 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-10-04 12:41:54,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:54,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-04 12:41:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:54,102 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:41:54,102 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:41:54,102 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:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:41:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 12:41:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:41:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-04 12:41:54,107 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2018-10-04 12:41:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,107 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-04 12:41:54,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-04 12:41:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:41:54,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,109 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-04 12:41:54,109 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:54,109 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash 72785504, now seen corresponding path program 2 times [2018-10-04 12:41:54,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:54,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:54,326 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,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:54,327 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:54,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:41:54,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:41:54,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:54,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:54,750 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,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:54,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 12:41:54,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:41:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:41:54,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:54,773 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 12 states. [2018-10-04 12:41:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:54,899 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-10-04 12:41:54,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:41:54,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-10-04 12:41:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:54,901 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:41:54,901 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:41:54,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 8 [2018-10-04 12:41:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:41:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-10-04 12:41:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:41:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-10-04 12:41:54,907 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2018-10-04 12:41:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,907 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-04 12:41:54,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:41:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-10-04 12:41:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:41:54,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,909 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1] [2018-10-04 12:41:54,909 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:54,909 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,909 INFO L82 PathProgramCache]: Analyzing trace with hash 491282284, now seen corresponding path program 3 times [2018-10-04 12:41:54,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:55,181 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:55,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:55,182 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:55,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:41:55,204 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:41:55,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:55,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:55,581 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:55,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:55,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 12:41:55,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:41:55,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:41:55,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:55,614 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 16 states. [2018-10-04 12:41:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:56,091 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-04 12:41:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:41:56,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 12:41:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:56,095 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:41:56,095 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:41:56,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 10 [2018-10-04 12:41:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:41:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-10-04 12:41:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:41:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-04 12:41:56,104 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-10-04 12:41:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:56,104 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-04 12:41:56,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:41:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-10-04 12:41:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:41:56,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:56,105 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1] [2018-10-04 12:41:56,106 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:56,106 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1589732832, now seen corresponding path program 4 times [2018-10-04 12:41:56,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:56,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:56,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:56,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:56,401 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:56,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:56,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 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:56,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:41:56,421 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:41:56,422 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:56,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:56,846 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:56,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:56,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:41:56,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:41:56,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:41:56,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:56,869 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 20 states. [2018-10-04 12:41:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:57,127 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-04 12:41:57,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:41:57,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-04 12:41:57,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:57,128 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:41:57,128 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:41:57,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 12 [2018-10-04 12:41:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:41:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-10-04 12:41:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:41:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-10-04 12:41:57,135 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2018-10-04 12:41:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:57,135 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-10-04 12:41:57,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:41:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-10-04 12:41:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:41:57,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:57,136 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1] [2018-10-04 12:41:57,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:57,137 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash 602818540, now seen corresponding path program 5 times [2018-10-04 12:41:57,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:57,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:57,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:57,314 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:57,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:57,314 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:57,326 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:41:57,357 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:41:57,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:57,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:58,283 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:58,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:58,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 12:41:58,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:41:58,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:41:58,306 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:58,307 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2018-10-04 12:41:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:58,517 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-10-04 12:41:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:41:58,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-10-04 12:41:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:58,518 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:41:58,518 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:41:58,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime 14 [2018-10-04 12:41:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:41:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-10-04 12:41:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:41:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-10-04 12:41:58,525 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 28 [2018-10-04 12:41:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:58,526 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-10-04 12:41:58,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:41:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-10-04 12:41:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:41:58,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:58,527 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1] [2018-10-04 12:41:58,527 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:58,527 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1979239776, now seen corresponding path program 6 times [2018-10-04 12:41:58,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:58,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:58,770 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:58,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:58,771 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:58,780 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:41:58,797 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:41:58,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:41:58,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:59,456 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:59,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:59,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 12:41:59,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:41:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:41:59,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:59,491 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 28 states. [2018-10-04 12:41:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:59,652 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-10-04 12:41:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:41:59,654 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-10-04 12:41:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:59,655 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:41:59,656 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:41:59,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 16 [2018-10-04 12:41:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:41:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-10-04 12:41:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:41:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-10-04 12:41:59,662 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 33 [2018-10-04 12:41:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:59,663 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-04 12:41:59,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:41:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-10-04 12:41:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:41:59,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:59,665 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1] [2018-10-04 12:41:59,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:59,665 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1800695700, now seen corresponding path program 7 times [2018-10-04 12:41:59,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:59,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:59,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:59,902 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:59,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:59,903 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) [2018-10-04 12:41:59,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:41:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:59,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:00,538 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:42:00,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:00,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 12:42:00,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:42:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:42:00,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:00,561 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 32 states. [2018-10-04 12:42:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:00,787 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-10-04 12:42:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:00,788 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-10-04 12:42:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:00,789 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:42:00,789 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 12:42:00,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 18 [2018-10-04 12:42:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 12:42:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-04 12:42:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:42:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-10-04 12:42:00,799 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 38 [2018-10-04 12:42:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:00,799 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-10-04 12:42:00,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:42:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-10-04 12:42:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:42:00,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:00,806 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1] [2018-10-04 12:42:00,807 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:00,807 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:00,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1430989600, now seen corresponding path program 8 times [2018-10-04 12:42:00,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:00,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:00,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:01,152 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:42:01,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:01,153 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:42:01,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:01,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:01,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:01,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:01,813 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:42:01,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:01,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 12:42:01,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:42:01,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:42:01,834 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:01,835 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 36 states. [2018-10-04 12:42:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:02,053 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-10-04 12:42:02,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:42:02,054 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-10-04 12:42:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:02,055 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:42:02,055 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:42:02,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.3s impTime 20 [2018-10-04 12:42:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:42:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-10-04 12:42:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 12:42:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-10-04 12:42:02,063 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 43 [2018-10-04 12:42:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:02,064 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-10-04 12:42:02,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:42:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-10-04 12:42:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:42:02,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:02,067 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1] [2018-10-04 12:42:02,068 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:02,068 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1043842836, now seen corresponding path program 9 times [2018-10-04 12:42:02,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:02,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:02,511 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:02,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:02,512 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:42:02,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:42:02,553 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:42:02,553 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:02,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:03,600 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:03,612 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:03,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:03,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 12:42:03,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:42:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:42:03,634 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:03,635 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 40 states. [2018-10-04 12:42:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:03,809 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-10-04 12:42:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:03,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2018-10-04 12:42:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:03,811 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:42:03,811 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 12:42:03,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.7s impTime 7 [2018-10-04 12:42:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 12:42:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-10-04 12:42:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 12:42:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-10-04 12:42:03,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 48 [2018-10-04 12:42:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:03,817 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-10-04 12:42:03,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:42:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-10-04 12:42:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 12:42:03,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:03,818 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1] [2018-10-04 12:42:03,818 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:03,819 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -676496288, now seen corresponding path program 10 times [2018-10-04 12:42:03,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:03,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:03,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:03,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:04,722 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:04,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:04,723 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:04,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:42:04,772 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:42:04,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:04,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:05,768 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:05,881 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:05,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:05,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2018-10-04 12:42:05,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:42:05,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:42:05,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,902 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 45 states. [2018-10-04 12:42:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:06,108 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-10-04 12:42:06,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:42:06,108 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 53 [2018-10-04 12:42:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:06,109 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:42:06,109 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:42:06,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime 9 [2018-10-04 12:42:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:42:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-10-04 12:42:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:42:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-10-04 12:42:06,117 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 53 [2018-10-04 12:42:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:06,118 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-10-04 12:42:06,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:42:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-10-04 12:42:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:42:06,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:06,119 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1] [2018-10-04 12:42:06,119 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:06,119 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:06,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1014218388, now seen corresponding path program 11 times [2018-10-04 12:42:06,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:06,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:06,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:06,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:06,517 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:06,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:06,518 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:06,526 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:42:06,577 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:42:06,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:06,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:07,102 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:07,301 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:07,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:07,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2018-10-04 12:42:07,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:42:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:42:07,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,325 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 49 states. [2018-10-04 12:42:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,568 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-10-04 12:42:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:42:07,568 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 58 [2018-10-04 12:42:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,569 INFO L225 Difference]: With dead ends: 70 [2018-10-04 12:42:07,569 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 12:42:07,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime 11 [2018-10-04 12:42:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 12:42:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-10-04 12:42:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:42:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-10-04 12:42:07,578 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 58 [2018-10-04 12:42:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,578 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-10-04 12:42:07,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:42:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-10-04 12:42:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 12:42:07,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,580 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1] [2018-10-04 12:42:07,580 INFO L423 AbstractCegarLoop]: === Iteration 14 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:07,580 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash -778386464, now seen corresponding path program 12 times [2018-10-04 12:42:07,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:07,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,171 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:08,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:08,172 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:08,180 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:42:08,207 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:42:08,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:08,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:08,698 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:08,820 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:08,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:08,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 52 [2018-10-04 12:42:08,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:42:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:42:08,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:08,844 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 53 states. [2018-10-04 12:42:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:09,039 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2018-10-04 12:42:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:42:09,040 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 63 [2018-10-04 12:42:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:09,041 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:42:09,041 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:42:09,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 13 [2018-10-04 12:42:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:42:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-10-04 12:42:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:42:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-10-04 12:42:09,048 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 63 [2018-10-04 12:42:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:09,048 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-10-04 12:42:09,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:42:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2018-10-04 12:42:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:42:09,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:09,050 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1] [2018-10-04 12:42:09,050 INFO L423 AbstractCegarLoop]: === Iteration 15 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:09,050 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:09,050 INFO L82 PathProgramCache]: Analyzing trace with hash -130045460, now seen corresponding path program 13 times [2018-10-04 12:42:09,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:09,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:09,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:09,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,792 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:09,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:09,793 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:09,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:10,449 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:10,731 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:10,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:10,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 56 [2018-10-04 12:42:10,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:42:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:42:10,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,752 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 57 states. [2018-10-04 12:42:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,971 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-10-04 12:42:10,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:42:10,972 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 68 [2018-10-04 12:42:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,972 INFO L225 Difference]: With dead ends: 80 [2018-10-04 12:42:10,972 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 12:42:10,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 16 [2018-10-04 12:42:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 12:42:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-10-04 12:42:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:42:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2018-10-04 12:42:10,980 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 68 [2018-10-04 12:42:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,980 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2018-10-04 12:42:10,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:42:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2018-10-04 12:42:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:42:10,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,982 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1] [2018-10-04 12:42:10,982 INFO L423 AbstractCegarLoop]: === Iteration 16 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,982 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,982 INFO L82 PathProgramCache]: Analyzing trace with hash -415978656, now seen corresponding path program 14 times [2018-10-04 12:42:10,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,416 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:12,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:12,416 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:12,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:12,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:12,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:12,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:12,920 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:13,296 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:13,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:13,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2018-10-04 12:42:13,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:42:13,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:42:13,319 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:13,319 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 61 states. [2018-10-04 12:42:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:13,621 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2018-10-04 12:42:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:42:13,622 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 73 [2018-10-04 12:42:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:13,623 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:42:13,623 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 12:42:13,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.5s impTime 18 [2018-10-04 12:42:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 12:42:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-10-04 12:42:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 12:42:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2018-10-04 12:42:13,629 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 73 [2018-10-04 12:42:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:13,630 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2018-10-04 12:42:13,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:42:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-10-04 12:42:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 12:42:13,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:13,631 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1] [2018-10-04 12:42:13,632 INFO L423 AbstractCegarLoop]: === Iteration 17 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:13,632 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2077592980, now seen corresponding path program 15 times [2018-10-04 12:42:13,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:13,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:13,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,169 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:14,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:14,170 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:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:42:14,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:42:14,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:14,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:14,713 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:16,094 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:16,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:16,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 64 [2018-10-04 12:42:16,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:42:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:42:16,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:16,115 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 65 states. [2018-10-04 12:42:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:16,532 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-10-04 12:42:16,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:42:16,533 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 78 [2018-10-04 12:42:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:16,533 INFO L225 Difference]: With dead ends: 90 [2018-10-04 12:42:16,533 INFO L226 Difference]: Without dead ends: 88 [2018-10-04 12:42:16,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.4s impTime 19 [2018-10-04 12:42:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-04 12:42:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-10-04 12:42:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-04 12:42:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2018-10-04 12:42:16,539 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 78 [2018-10-04 12:42:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:16,539 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2018-10-04 12:42:16,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:42:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2018-10-04 12:42:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 12:42:16,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:16,540 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1] [2018-10-04 12:42:16,540 INFO L423 AbstractCegarLoop]: === Iteration 18 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:16,541 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:16,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1630745312, now seen corresponding path program 16 times [2018-10-04 12:42:16,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:16,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:16,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:16,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:17,082 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:17,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:17,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 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:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:42:17,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:42:17,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:17,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:17,582 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:19,111 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:19,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:19,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 68 [2018-10-04 12:42:19,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:42:19,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:42:19,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:19,134 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand 69 states. [2018-10-04 12:42:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:19,497 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-10-04 12:42:19,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:42:19,498 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 83 [2018-10-04 12:42:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:19,498 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:42:19,499 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 12:42:19,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.7s impTime 21 [2018-10-04 12:42:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 12:42:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-10-04 12:42:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:42:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2018-10-04 12:42:19,504 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 83 [2018-10-04 12:42:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:19,505 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2018-10-04 12:42:19,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:42:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2018-10-04 12:42:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 12:42:19,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:19,506 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1] [2018-10-04 12:42:19,506 INFO L423 AbstractCegarLoop]: === Iteration 19 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:19,506 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash -778790164, now seen corresponding path program 17 times [2018-10-04 12:42:19,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:19,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:19,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,401 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:20,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:20,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 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:20,413 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:42:20,481 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:42:20,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:20,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:21,178 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:21,796 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:21,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:21,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 72 [2018-10-04 12:42:21,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 12:42:21,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 12:42:21,818 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:21,819 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 73 states. [2018-10-04 12:42:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:22,129 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-10-04 12:42:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:42:22,129 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 88 [2018-10-04 12:42:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:22,130 INFO L225 Difference]: With dead ends: 100 [2018-10-04 12:42:22,130 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 12:42:22,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.4s impTime 23 [2018-10-04 12:42:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 12:42:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-10-04 12:42:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-04 12:42:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-10-04 12:42:22,135 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 88 [2018-10-04 12:42:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:22,136 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-10-04 12:42:22,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 12:42:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-10-04 12:42:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-04 12:42:22,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:22,137 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1] [2018-10-04 12:42:22,137 INFO L423 AbstractCegarLoop]: === Iteration 20 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:22,138 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash 38689376, now seen corresponding path program 18 times [2018-10-04 12:42:22,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:22,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:22,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:22,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,696 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:22,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:22,696 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:22,705 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:42:22,734 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:42:22,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:22,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:23,427 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:24,161 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:42:24,272 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:24,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:24,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 76 [2018-10-04 12:42:24,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 12:42:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 12:42:24,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:24,294 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 77 states. [2018-10-04 12:42:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:24,694 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2018-10-04 12:42:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:42:24,694 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 93 [2018-10-04 12:42:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:24,696 INFO L225 Difference]: With dead ends: 105 [2018-10-04 12:42:24,696 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 12:42:24,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.1s impTime 8 [2018-10-04 12:42:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 12:42:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-10-04 12:42:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 12:42:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-10-04 12:42:24,700 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 93 [2018-10-04 12:42:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:24,700 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-10-04 12:42:24,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 12:42:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2018-10-04 12:42:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 12:42:24,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:24,701 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1] [2018-10-04 12:42:24,701 INFO L423 AbstractCegarLoop]: === Iteration 21 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:24,702 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash 281420652, now seen corresponding path program 19 times [2018-10-04 12:42:24,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:24,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:24,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,711 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:25,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:25,712 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:25,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:26,239 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:27,469 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:42:27,630 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:27,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:27,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42] total 81 [2018-10-04 12:42:27,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:42:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:42:27,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:27,652 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 82 states. [2018-10-04 12:42:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:28,056 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2018-10-04 12:42:28,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:42:28,056 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 98 [2018-10-04 12:42:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:28,057 INFO L225 Difference]: With dead ends: 110 [2018-10-04 12:42:28,057 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 12:42:28,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.0s impTime 10 [2018-10-04 12:42:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 12:42:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2018-10-04 12:42:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-04 12:42:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2018-10-04 12:42:28,063 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 98 [2018-10-04 12:42:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:28,063 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2018-10-04 12:42:28,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:42:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-10-04 12:42:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 12:42:28,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:28,065 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1] [2018-10-04 12:42:28,065 INFO L423 AbstractCegarLoop]: === Iteration 22 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:28,065 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2025971232, now seen corresponding path program 20 times [2018-10-04 12:42:28,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:28,750 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:28,763 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:28,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:28,764 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:28,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:28,794 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:28,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:28,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:30,021 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:31,661 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:42:32,008 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:32,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:32,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43] total 84 [2018-10-04 12:42:32,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 12:42:32,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 12:42:32,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:32,030 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand 85 states. [2018-10-04 12:42:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:32,424 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-10-04 12:42:32,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:42:32,427 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 103 [2018-10-04 12:42:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:32,429 INFO L225 Difference]: With dead ends: 115 [2018-10-04 12:42:32,429 INFO L226 Difference]: Without dead ends: 113 [2018-10-04 12:42:32,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time 2.7s impTime 14 [2018-10-04 12:42:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-04 12:42:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-10-04 12:42:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:42:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2018-10-04 12:42:32,434 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 103 [2018-10-04 12:42:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:32,435 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2018-10-04 12:42:32,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 12:42:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2018-10-04 12:42:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 12:42:32,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:32,436 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1] [2018-10-04 12:42:32,436 INFO L423 AbstractCegarLoop]: === Iteration 23 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:32,436 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1207497748, now seen corresponding path program 21 times [2018-10-04 12:42:32,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:32,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:33,312 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:33,642 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:33,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:33,643 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:33,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:42:33,682 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:42:33,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:33,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:34,393 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:35,534 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:42:36,025 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:36,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:36,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 12:42:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 12:42:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 12:42:36,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:36,047 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand 88 states. [2018-10-04 12:42:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:36,445 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-10-04 12:42:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:42:36,445 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 108 [2018-10-04 12:42:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:36,446 INFO L225 Difference]: With dead ends: 120 [2018-10-04 12:42:36,446 INFO L226 Difference]: Without dead ends: 118 [2018-10-04 12:42:36,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.0s impTime 17 [2018-10-04 12:42:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-04 12:42:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-10-04 12:42:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-04 12:42:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2018-10-04 12:42:36,452 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 108 [2018-10-04 12:42:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:36,453 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2018-10-04 12:42:36,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 12:42:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2018-10-04 12:42:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-04 12:42:36,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:36,454 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1] [2018-10-04 12:42:36,454 INFO L423 AbstractCegarLoop]: === Iteration 24 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:36,455 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 649759072, now seen corresponding path program 22 times [2018-10-04 12:42:36,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:37,532 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:37,698 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:37,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:37,699 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:37,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:42:37,734 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:42:37,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:37,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:38,257 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:38,956 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:42:39,488 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:39,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:39,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-04 12:42:39,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 12:42:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 12:42:39,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:39,509 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand 92 states. [2018-10-04 12:42:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:39,907 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2018-10-04 12:42:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:42:39,908 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 113 [2018-10-04 12:42:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:39,908 INFO L225 Difference]: With dead ends: 125 [2018-10-04 12:42:39,909 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 12:42:39,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.1s impTime 18 [2018-10-04 12:42:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 12:42:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-10-04 12:42:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 12:42:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2018-10-04 12:42:39,914 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 113 [2018-10-04 12:42:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:39,914 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2018-10-04 12:42:39,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 12:42:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2018-10-04 12:42:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 12:42:39,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:39,915 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1] [2018-10-04 12:42:39,916 INFO L423 AbstractCegarLoop]: === Iteration 25 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:39,916 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash 60773484, now seen corresponding path program 23 times [2018-10-04 12:42:39,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:39,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:39,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:39,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:39,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:40,945 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:42:41,188 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:41,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:41,189 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:41,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:42:41,235 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:42:41,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:41,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:41,780 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:42:42,776 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:42,778 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 (exists ((GateController_one Int)) (and (<= (* 1000 GateController_one) GateController_thousand) (<= 1 GateController_one))) (<= GateController_time 90)))) (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:412) 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.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:42,783 INFO L168 Benchmark]: Toolchain (without parser) took 50377.69 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 403.2 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 444.1 MB). Peak memory consumption was 847.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:42,785 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:42:42,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.35 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:42,786 INFO L168 Benchmark]: Boogie Preprocessor took 24.60 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:42,786 INFO L168 Benchmark]: RCFGBuilder took 297.93 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:42,787 INFO L168 Benchmark]: TraceAbstraction took 50004.22 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 403.2 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 423.0 MB). Peak memory consumption was 826.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:42,791 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.35 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 24.60 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 297.93 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 50004.22 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 403.2 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 423.0 MB). Peak memory consumption was 826.1 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 (exists ((GateController_one Int)) (and (<= (* 1000 GateController_one) GateController_thousand) (<= 1 GateController_one))) (<= GateController_time 90)))) (and .cse0 (not .cse0))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (and (exists ((GateController_one Int)) (and (<= (* 1000 GateController_one) GateController_thousand) (<= 1 GateController_one))) (<= GateController_time 90)))) (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/GateController.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-42-42-813.csv Received shutdown request...