java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:18:52,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:18:52,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:18:52,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:18:52,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:18:52,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:18:52,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:18:52,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:18:52,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:18:52,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:18:52,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:18:52,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:18:52,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:18:52,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:18:52,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:18:52,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:18:52,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:18:52,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:18:52,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:18:52,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:18:52,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:18:52,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:18:52,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:18:52,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:18:52,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:18:52,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:18:52,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:18:52,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:18:52,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:18:52,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:18:52,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:18:52,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:18:52,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:18:52,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:18:52,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:18:52,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:18:52,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:18:52,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:18:52,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:18:52,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:18:52,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:18:52,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:18:52,104 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:18:52,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:18:52,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:18:52,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:18:52,106 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:18:52,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:18:52,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:18:52,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:18:52,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:18:52,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:18:52,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:18:52,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:18:52,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:18:52,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:18:52,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:18:52,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:18:52,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:18:52,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:18:52,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:18:52,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:18:52,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:18:52,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:52,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:18:52,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:18:52,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:18:52,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:18:52,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:18:52,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:18:52,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:18:52,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:18:52,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:18:52,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:18:52,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:18:52,179 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:18:52,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-10-02 11:18:52,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5f28e60/eef8fe9b9eef433ca29338bb04882728/FLAG6da055d0c [2019-10-02 11:18:52,758 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:18:52,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-10-02 11:18:52,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5f28e60/eef8fe9b9eef433ca29338bb04882728/FLAG6da055d0c [2019-10-02 11:18:53,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5f28e60/eef8fe9b9eef433ca29338bb04882728 [2019-10-02 11:18:53,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:18:53,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:18:53,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:53,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:18:53,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:18:53,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee255a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53, skipping insertion in model container [2019-10-02 11:18:53,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:18:53,200 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:18:53,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:53,414 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:18:53,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:53,552 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:18:53,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53 WrapperNode [2019-10-02 11:18:53,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:53,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:18:53,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:18:53,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:18:53,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:18:53,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:18:53,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:18:53,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:18:53,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (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 [2019-10-02 11:18:53,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:18:53,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:18:53,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:18:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:18:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:18:53,941 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:18:53,941 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:18:53,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:53 BoogieIcfgContainer [2019-10-02 11:18:53,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:18:53,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:18:53,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:18:53,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:18:53,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:18:53" (1/3) ... [2019-10-02 11:18:53,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca0b2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:53, skipping insertion in model container [2019-10-02 11:18:53,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53" (2/3) ... [2019-10-02 11:18:53,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca0b2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:53, skipping insertion in model container [2019-10-02 11:18:53,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:53" (3/3) ... [2019-10-02 11:18:53,956 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-10-02 11:18:53,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:18:53,990 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:18:54,008 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:18:54,038 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:18:54,039 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:18:54,039 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:18:54,039 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:18:54,040 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:18:54,040 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:18:54,040 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:18:54,040 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:18:54,040 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:18:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-02 11:18:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:18:54,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:54,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:54,064 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:54,069 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-10-02 11:18:54,070 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:54,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:54,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:54,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:54,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:18:54,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:18:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:18:54,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:18:54,260 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-10-02 11:18:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:54,492 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2019-10-02 11:18:54,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:18:54,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 11:18:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:54,506 INFO L225 Difference]: With dead ends: 74 [2019-10-02 11:18:54,506 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 11:18:54,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:18:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 11:18:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-02 11:18:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 11:18:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-10-02 11:18:54,555 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-10-02 11:18:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:54,556 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-10-02 11:18:54,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:18:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-10-02 11:18:54,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:18:54,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:54,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:54,559 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-10-02 11:18:54,560 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:54,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:54,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:54,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:54,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:18:54,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:18:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:18:54,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:18:54,758 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 12 states. [2019-10-02 11:18:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:54,933 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-10-02 11:18:54,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:18:54,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-10-02 11:18:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:54,935 INFO L225 Difference]: With dead ends: 54 [2019-10-02 11:18:54,935 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 11:18:54,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:18:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 11:18:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-02 11:18:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:18:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-02 11:18:54,944 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2019-10-02 11:18:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:54,944 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-02 11:18:54,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:18:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-02 11:18:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:18:54,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:54,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:54,946 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash -880735776, now seen corresponding path program 1 times [2019-10-02 11:18:54,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:54,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:54,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:54,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:54,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:55,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:55,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:18:55,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:18:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:18:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:18:55,006 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2019-10-02 11:18:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:55,063 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-10-02 11:18:55,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:18:55,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 11:18:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:55,064 INFO L225 Difference]: With dead ends: 36 [2019-10-02 11:18:55,065 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 11:18:55,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:18:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 11:18:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-02 11:18:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:18:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-10-02 11:18:55,072 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-10-02 11:18:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:55,072 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-10-02 11:18:55,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:18:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-10-02 11:18:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:18:55,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:55,074 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:55,074 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-10-02 11:18:55,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:55,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:55,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:55,242 INFO L224 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) [2019-10-02 11:18:55,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:18:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:55,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:18:55,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:55,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:55,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2019-10-02 11:18:55,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:18:55,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:18:55,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:18:55,384 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2019-10-02 11:18:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:55,522 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-10-02 11:18:55,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:18:55,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-10-02 11:18:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:55,524 INFO L225 Difference]: With dead ends: 42 [2019-10-02 11:18:55,525 INFO L226 Difference]: Without dead ends: 37 [2019-10-02 11:18:55,526 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:18:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-02 11:18:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-02 11:18:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 11:18:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-02 11:18:55,536 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2019-10-02 11:18:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:55,537 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-02 11:18:55,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:18:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-02 11:18:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:18:55,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:55,540 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:55,540 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash -291122700, now seen corresponding path program 2 times [2019-10-02 11:18:55,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:55,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:55,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:55,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:55,762 INFO L224 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 [2019-10-02 11:18:55,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:18:55,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:18:55,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:55,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:18:55,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:18:55,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:55,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2019-10-02 11:18:55,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:18:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:18:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:18:55,839 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 16 states. [2019-10-02 11:18:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:55,995 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-10-02 11:18:55,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:18:55,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-10-02 11:18:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:55,997 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:18:55,997 INFO L226 Difference]: Without dead ends: 41 [2019-10-02 11:18:55,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:18:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-02 11:18:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-02 11:18:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 11:18:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-10-02 11:18:56,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2019-10-02 11:18:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:56,007 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-10-02 11:18:56,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:18:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-10-02 11:18:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:18:56,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:56,011 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:56,012 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1245533266, now seen corresponding path program 3 times [2019-10-02 11:18:56,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:56,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:56,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:56,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:56,262 INFO L224 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) [2019-10-02 11:18:56,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:18:56,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 11:18:56,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:56,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:18:56,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:18:56,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:56,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-10-02 11:18:56,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:18:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:18:56,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:18:56,368 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2019-10-02 11:18:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:56,505 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-10-02 11:18:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:18:56,506 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-10-02 11:18:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:56,507 INFO L225 Difference]: With dead ends: 52 [2019-10-02 11:18:56,507 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 11:18:56,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:18:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 11:18:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-02 11:18:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 11:18:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-02 11:18:56,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 39 [2019-10-02 11:18:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:56,515 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-02 11:18:56,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:18:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-02 11:18:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:18:56,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:56,516 INFO L411 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:56,516 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash -386885694, now seen corresponding path program 4 times [2019-10-02 11:18:56,517 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:56,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:56,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:56,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:56,783 INFO L224 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 [2019-10-02 11:18:56,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:18:56,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:18:56,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:56,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:18:56,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:18:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 21 [2019-10-02 11:18:56,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:18:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:18:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:18:56,862 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 21 states. [2019-10-02 11:18:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:57,024 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-10-02 11:18:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:18:57,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-10-02 11:18:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:57,027 INFO L225 Difference]: With dead ends: 58 [2019-10-02 11:18:57,027 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 11:18:57,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:18:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 11:18:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-02 11:18:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 11:18:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-10-02 11:18:57,036 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2019-10-02 11:18:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:57,036 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-10-02 11:18:57,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:18:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-10-02 11:18:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:18:57,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:57,038 INFO L411 BasicCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:57,038 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1880804167, now seen corresponding path program 5 times [2019-10-02 11:18:57,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:57,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:57,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:57,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:57,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:57,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:57,381 INFO L224 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 [2019-10-02 11:18:57,410 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:18:57,434 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-02 11:18:57,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:57,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:18:57,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:18:57,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:57,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-02 11:18:57,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 11:18:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 11:18:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:18:57,600 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 30 states. [2019-10-02 11:18:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:57,767 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-10-02 11:18:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 11:18:57,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 51 [2019-10-02 11:18:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:57,769 INFO L225 Difference]: With dead ends: 73 [2019-10-02 11:18:57,769 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:18:57,770 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:18:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:18:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-10-02 11:18:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 11:18:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-10-02 11:18:57,778 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 51 [2019-10-02 11:18:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:57,778 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-10-02 11:18:57,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 11:18:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-10-02 11:18:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 11:18:57,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:57,782 INFO L411 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:57,782 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash -863413544, now seen corresponding path program 6 times [2019-10-02 11:18:57,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:57,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:57,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:58,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:58,280 INFO L224 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 [2019-10-02 11:18:58,298 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:18:58,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-02 11:18:58,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:58,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:18:58,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 81 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 11:18:58,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:58,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 12] total 41 [2019-10-02 11:18:58,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 11:18:58,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 11:18:58,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 11:18:58,629 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 41 states. [2019-10-02 11:18:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:58,859 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-10-02 11:18:58,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 11:18:58,860 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 65 [2019-10-02 11:18:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:58,861 INFO L225 Difference]: With dead ends: 103 [2019-10-02 11:18:58,862 INFO L226 Difference]: Without dead ends: 89 [2019-10-02 11:18:58,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 11:18:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-02 11:18:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-10-02 11:18:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-02 11:18:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-10-02 11:18:58,884 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 65 [2019-10-02 11:18:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:58,890 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-10-02 11:18:58,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 11:18:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-10-02 11:18:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 11:18:58,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:58,892 INFO L411 BasicCegarLoop]: trace histogram [30, 20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:58,892 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2110042581, now seen corresponding path program 7 times [2019-10-02 11:18:58,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:58,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:58,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:58,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:58,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:59,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:59,780 INFO L224 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) [2019-10-02 11:18:59,807 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 [2019-10-02 11:18:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:59,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 11:18:59,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 399 proven. 420 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-02 11:18:59,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:59,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 32] total 42 [2019-10-02 11:18:59,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 11:18:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 11:18:59,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:18:59,918 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 42 states. [2019-10-02 11:19:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:00,128 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2019-10-02 11:19:00,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 11:19:00,129 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 87 [2019-10-02 11:19:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:00,130 INFO L225 Difference]: With dead ends: 132 [2019-10-02 11:19:00,130 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 11:19:00,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:19:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 11:19:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-10-02 11:19:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-02 11:19:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-10-02 11:19:00,140 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 87 [2019-10-02 11:19:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:00,140 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-10-02 11:19:00,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 11:19:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-10-02 11:19:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 11:19:00,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:00,143 INFO L411 BasicCegarLoop]: trace histogram [41, 31, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:00,143 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 124988746, now seen corresponding path program 8 times [2019-10-02 11:19:00,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:00,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:00,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:01,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:01,287 INFO L224 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 [2019-10-02 11:19:01,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:19:01,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:01,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:01,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 11:19:01,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 608 proven. 992 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:19:01,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:01,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 43] total 53 [2019-10-02 11:19:01,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 11:19:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 11:19:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:19:01,443 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 53 states. [2019-10-02 11:19:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:01,748 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-10-02 11:19:01,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 11:19:01,748 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 109 [2019-10-02 11:19:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:01,750 INFO L225 Difference]: With dead ends: 152 [2019-10-02 11:19:01,751 INFO L226 Difference]: Without dead ends: 130 [2019-10-02 11:19:01,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:19:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-02 11:19:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-10-02 11:19:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-02 11:19:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-10-02 11:19:01,761 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 109 [2019-10-02 11:19:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:01,762 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-10-02 11:19:01,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 11:19:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-10-02 11:19:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 11:19:01,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:01,764 INFO L411 BasicCegarLoop]: trace histogram [51, 41, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:01,764 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash -898909844, now seen corresponding path program 9 times [2019-10-02 11:19:01,765 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:01,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:01,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:03,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:03,269 INFO L224 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 [2019-10-02 11:19:03,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:03,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-02 11:19:03,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:03,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:19:03,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 861 proven. 100 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-02 11:19:03,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:03,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 13] total 63 [2019-10-02 11:19:03,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-02 11:19:03,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-02 11:19:03,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 11:19:03,383 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 63 states. [2019-10-02 11:19:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:03,687 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-10-02 11:19:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 11:19:03,687 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 129 [2019-10-02 11:19:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:03,689 INFO L225 Difference]: With dead ends: 136 [2019-10-02 11:19:03,689 INFO L226 Difference]: Without dead ends: 133 [2019-10-02 11:19:03,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 11:19:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-02 11:19:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-10-02 11:19:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-02 11:19:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-10-02 11:19:03,705 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2019-10-02 11:19:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:03,707 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-10-02 11:19:03,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-02 11:19:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-10-02 11:19:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 11:19:03,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:03,713 INFO L411 BasicCegarLoop]: trace histogram [52, 41, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:03,713 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:03,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:03,714 INFO L82 PathProgramCache]: Analyzing trace with hash -571471930, now seen corresponding path program 10 times [2019-10-02 11:19:03,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:03,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:03,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:03,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:03,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:05,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:05,220 INFO L224 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 [2019-10-02 11:19:05,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:19:05,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:19:05,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:05,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-02 11:19:05,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:05,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:05,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-10-02 11:19:05,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-02 11:19:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-02 11:19:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 11:19:05,389 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 64 states. [2019-10-02 11:19:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:05,703 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2019-10-02 11:19:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 11:19:05,704 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 131 [2019-10-02 11:19:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:05,705 INFO L225 Difference]: With dead ends: 138 [2019-10-02 11:19:05,707 INFO L226 Difference]: Without dead ends: 135 [2019-10-02 11:19:05,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 11:19:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-02 11:19:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-10-02 11:19:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-02 11:19:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-10-02 11:19:05,718 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-10-02 11:19:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:05,719 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-10-02 11:19:05,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-02 11:19:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-10-02 11:19:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 11:19:05,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:05,721 INFO L411 BasicCegarLoop]: trace histogram [53, 41, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:05,721 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash 563750816, now seen corresponding path program 11 times [2019-10-02 11:19:05,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:05,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:07,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:07,189 INFO L224 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 [2019-10-02 11:19:07,219 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:19:07,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-02 11:19:07,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:07,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:19:07,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 676 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-10-02 11:19:08,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:08,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 29] total 79 [2019-10-02 11:19:08,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-02 11:19:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-02 11:19:08,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 11:19:08,073 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 79 states. [2019-10-02 11:19:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:08,428 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2019-10-02 11:19:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-02 11:19:08,429 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 133 [2019-10-02 11:19:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:08,431 INFO L225 Difference]: With dead ends: 168 [2019-10-02 11:19:08,431 INFO L226 Difference]: Without dead ends: 165 [2019-10-02 11:19:08,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 11:19:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-02 11:19:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-10-02 11:19:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 11:19:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2019-10-02 11:19:08,440 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 133 [2019-10-02 11:19:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:08,440 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2019-10-02 11:19:08,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-02 11:19:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2019-10-02 11:19:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 11:19:08,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:08,442 INFO L411 BasicCegarLoop]: trace histogram [68, 41, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:08,442 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash 238893414, now seen corresponding path program 12 times [2019-10-02 11:19:08,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:08,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:10,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:10,683 INFO L224 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 [2019-10-02 11:19:10,714 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:19:10,805 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2019-10-02 11:19:10,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:10,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 11:19:10,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2345 proven. 1089 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-10-02 11:19:11,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:11,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 36] total 86 [2019-10-02 11:19:11,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-02 11:19:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-02 11:19:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-10-02 11:19:11,182 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 86 states. [2019-10-02 11:19:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:11,689 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2019-10-02 11:19:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-02 11:19:11,690 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 163 [2019-10-02 11:19:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:11,692 INFO L225 Difference]: With dead ends: 182 [2019-10-02 11:19:11,692 INFO L226 Difference]: Without dead ends: 179 [2019-10-02 11:19:11,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-10-02 11:19:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-02 11:19:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-10-02 11:19:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-02 11:19:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-10-02 11:19:11,709 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 163 [2019-10-02 11:19:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:11,710 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-10-02 11:19:11,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-02 11:19:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-10-02 11:19:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:19:11,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:11,712 INFO L411 BasicCegarLoop]: trace histogram [75, 41, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:11,712 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash 555872220, now seen corresponding path program 13 times [2019-10-02 11:19:11,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:11,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:11,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:14,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:14,388 INFO L224 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 [2019-10-02 11:19:14,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:14,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-10-02 11:19:14,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:14,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:14,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-10-02 11:19:14,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-02 11:19:14,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-02 11:19:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-10-02 11:19:14,543 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 87 states. [2019-10-02 11:19:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:14,964 INFO L93 Difference]: Finished difference Result 184 states and 185 transitions. [2019-10-02 11:19:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-02 11:19:14,965 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-10-02 11:19:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:14,967 INFO L225 Difference]: With dead ends: 184 [2019-10-02 11:19:14,967 INFO L226 Difference]: Without dead ends: 181 [2019-10-02 11:19:14,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-10-02 11:19:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-02 11:19:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-10-02 11:19:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-02 11:19:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-10-02 11:19:14,975 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2019-10-02 11:19:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:14,975 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2019-10-02 11:19:14,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-02 11:19:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2019-10-02 11:19:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 11:19:14,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:14,977 INFO L411 BasicCegarLoop]: trace histogram [76, 41, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:14,977 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1609720374, now seen corresponding path program 14 times [2019-10-02 11:19:14,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:14,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:17,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:17,765 INFO L224 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 [2019-10-02 11:19:17,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:19:17,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:17,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:17,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-02 11:19:17,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:17,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:17,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-10-02 11:19:17,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-02 11:19:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-02 11:19:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 11:19:17,916 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 88 states. [2019-10-02 11:19:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:18,353 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2019-10-02 11:19:18,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-02 11:19:18,358 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-10-02 11:19:18,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:18,360 INFO L225 Difference]: With dead ends: 186 [2019-10-02 11:19:18,360 INFO L226 Difference]: Without dead ends: 183 [2019-10-02 11:19:18,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 11:19:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-02 11:19:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-10-02 11:19:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-02 11:19:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-10-02 11:19:18,369 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 179 [2019-10-02 11:19:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:18,369 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-10-02 11:19:18,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-02 11:19:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-10-02 11:19:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 11:19:18,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:18,371 INFO L411 BasicCegarLoop]: trace histogram [77, 41, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:18,371 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 745514512, now seen corresponding path program 15 times [2019-10-02 11:19:18,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:18,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:18,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:18,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:21,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:21,149 INFO L224 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 [2019-10-02 11:19:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:21,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-10-02 11:19:21,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:21,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 11:19:21,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1296 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-02 11:19:21,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:21,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 39] total 89 [2019-10-02 11:19:21,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-02 11:19:21,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-02 11:19:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-10-02 11:19:21,386 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 89 states. [2019-10-02 11:19:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:21,813 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2019-10-02 11:19:21,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-02 11:19:21,814 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-10-02 11:19:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:21,815 INFO L225 Difference]: With dead ends: 188 [2019-10-02 11:19:21,816 INFO L226 Difference]: Without dead ends: 185 [2019-10-02 11:19:21,817 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-10-02 11:19:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-02 11:19:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-10-02 11:19:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-02 11:19:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-10-02 11:19:21,824 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-10-02 11:19:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:21,825 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-10-02 11:19:21,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-02 11:19:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-10-02 11:19:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 11:19:21,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:21,826 INFO L411 BasicCegarLoop]: trace histogram [78, 41, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:21,826 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:21,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash -827630742, now seen corresponding path program 16 times [2019-10-02 11:19:21,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:21,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:21,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:24,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:24,570 INFO L224 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 [2019-10-02 11:19:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:19:24,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:19:24,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:24,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-10-02 11:19:24,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:24,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:24,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-10-02 11:19:24,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-02 11:19:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-02 11:19:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 11:19:24,746 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 90 states. [2019-10-02 11:19:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:25,268 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2019-10-02 11:19:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-02 11:19:25,269 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-10-02 11:19:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:25,271 INFO L225 Difference]: With dead ends: 190 [2019-10-02 11:19:25,271 INFO L226 Difference]: Without dead ends: 187 [2019-10-02 11:19:25,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 11:19:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-02 11:19:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-10-02 11:19:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-02 11:19:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-10-02 11:19:25,282 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2019-10-02 11:19:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:25,283 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-10-02 11:19:25,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-02 11:19:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-10-02 11:19:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:19:25,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:25,285 INFO L411 BasicCegarLoop]: trace histogram [79, 41, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:25,285 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:25,286 INFO L82 PathProgramCache]: Analyzing trace with hash -791731644, now seen corresponding path program 17 times [2019-10-02 11:19:25,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:25,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:25,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:30,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:30,032 INFO L224 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 [2019-10-02 11:19:30,086 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:19:30,203 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2019-10-02 11:19:30,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:30,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 11:19:30,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 1521 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-10-02 11:19:30,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:30,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 42] total 92 [2019-10-02 11:19:30,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-10-02 11:19:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-10-02 11:19:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-10-02 11:19:30,311 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 92 states. [2019-10-02 11:19:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:30,717 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2019-10-02 11:19:30,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-10-02 11:19:30,718 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 185 [2019-10-02 11:19:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:30,719 INFO L225 Difference]: With dead ends: 194 [2019-10-02 11:19:30,719 INFO L226 Difference]: Without dead ends: 191 [2019-10-02 11:19:30,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-10-02 11:19:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-02 11:19:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-10-02 11:19:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-02 11:19:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-10-02 11:19:30,726 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 185 [2019-10-02 11:19:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:30,726 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-10-02 11:19:30,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-10-02 11:19:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-10-02 11:19:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:19:30,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:30,728 INFO L411 BasicCegarLoop]: trace histogram [81, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:30,728 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash 65889400, now seen corresponding path program 18 times [2019-10-02 11:19:30,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:30,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:33,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:33,752 INFO L224 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 [2019-10-02 11:19:33,810 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:19:33,938 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2019-10-02 11:19:33,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:33,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-10-02 11:19:33,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:34,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-10-02 11:19:34,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-10-02 11:19:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-10-02 11:19:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-10-02 11:19:34,003 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 93 states. [2019-10-02 11:19:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:34,528 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2019-10-02 11:19:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-02 11:19:34,529 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-10-02 11:19:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:34,530 INFO L225 Difference]: With dead ends: 196 [2019-10-02 11:19:34,530 INFO L226 Difference]: Without dead ends: 193 [2019-10-02 11:19:34,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-10-02 11:19:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-02 11:19:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-10-02 11:19:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-02 11:19:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-10-02 11:19:34,538 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2019-10-02 11:19:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:34,538 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-10-02 11:19:34,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-10-02 11:19:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-10-02 11:19:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:19:34,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:34,540 INFO L411 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:34,540 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1112334382, now seen corresponding path program 19 times [2019-10-02 11:19:34,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:34,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:34,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:34,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:34,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:38,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:38,195 INFO L224 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 [2019-10-02 11:19:38,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:38,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-10-02 11:19:38,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:38,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:38,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-10-02 11:19:38,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-10-02 11:19:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-10-02 11:19:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 11:19:38,407 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 94 states. [2019-10-02 11:19:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:38,881 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2019-10-02 11:19:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-02 11:19:38,883 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-10-02 11:19:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:38,885 INFO L225 Difference]: With dead ends: 198 [2019-10-02 11:19:38,885 INFO L226 Difference]: Without dead ends: 195 [2019-10-02 11:19:38,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 11:19:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-02 11:19:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-10-02 11:19:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-02 11:19:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-10-02 11:19:38,892 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 191 [2019-10-02 11:19:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:38,893 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-10-02 11:19:38,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-10-02 11:19:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-10-02 11:19:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 11:19:38,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:38,894 INFO L411 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:38,895 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 20 times [2019-10-02 11:19:38,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:38,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:42,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:42,261 INFO L224 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 [2019-10-02 11:19:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:19:42,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:42,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:42,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-02 11:19:42,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:42,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:42,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-10-02 11:19:42,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-10-02 11:19:42,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-10-02 11:19:42,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 11:19:42,449 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 95 states. [2019-10-02 11:19:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:42,955 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2019-10-02 11:19:42,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-02 11:19:42,955 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-10-02 11:19:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:42,957 INFO L225 Difference]: With dead ends: 200 [2019-10-02 11:19:42,957 INFO L226 Difference]: Without dead ends: 197 [2019-10-02 11:19:42,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 11:19:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-02 11:19:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-10-02 11:19:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-02 11:19:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2019-10-02 11:19:42,966 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 193 [2019-10-02 11:19:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:42,966 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2019-10-02 11:19:42,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-10-02 11:19:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2019-10-02 11:19:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 11:19:42,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:42,968 INFO L411 BasicCegarLoop]: trace histogram [84, 43, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:42,968 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1134826746, now seen corresponding path program 21 times [2019-10-02 11:19:42,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:42,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:42,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:46,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:46,042 INFO L224 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 [2019-10-02 11:19:46,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:46,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 85 check-sat command(s) [2019-10-02 11:19:46,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:46,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-02 11:19:46,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:46,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-10-02 11:19:46,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-10-02 11:19:46,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-10-02 11:19:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-10-02 11:19:46,297 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 96 states. [2019-10-02 11:19:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:46,835 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2019-10-02 11:19:46,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-02 11:19:46,836 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-10-02 11:19:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:46,837 INFO L225 Difference]: With dead ends: 202 [2019-10-02 11:19:46,837 INFO L226 Difference]: Without dead ends: 199 [2019-10-02 11:19:46,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-10-02 11:19:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-02 11:19:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-10-02 11:19:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-02 11:19:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-10-02 11:19:46,845 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2019-10-02 11:19:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:46,845 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-10-02 11:19:46,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-10-02 11:19:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-10-02 11:19:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 11:19:46,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:46,847 INFO L411 BasicCegarLoop]: trace histogram [85, 44, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:46,847 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:46,847 INFO L82 PathProgramCache]: Analyzing trace with hash 345651936, now seen corresponding path program 22 times [2019-10-02 11:19:46,847 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:46,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:46,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:46,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:46,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:50,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:50,629 INFO L224 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 [2019-10-02 11:19:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:19:50,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:19:50,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:50,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-02 11:19:50,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:50,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:50,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-10-02 11:19:50,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-02 11:19:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-02 11:19:50,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-10-02 11:19:50,849 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 97 states. [2019-10-02 11:19:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:51,441 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2019-10-02 11:19:51,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-02 11:19:51,441 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-10-02 11:19:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:51,443 INFO L225 Difference]: With dead ends: 204 [2019-10-02 11:19:51,443 INFO L226 Difference]: Without dead ends: 201 [2019-10-02 11:19:51,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-10-02 11:19:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-02 11:19:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-10-02 11:19:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-02 11:19:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-10-02 11:19:51,450 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 197 [2019-10-02 11:19:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:51,451 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-10-02 11:19:51,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-02 11:19:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-10-02 11:19:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 11:19:51,452 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:51,452 INFO L411 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:51,452 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 23 times [2019-10-02 11:19:51,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:51,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:51,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:54,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:54,835 INFO L224 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 [2019-10-02 11:19:54,910 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:19:55,044 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 87 check-sat command(s) [2019-10-02 11:19:55,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:55,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 11:19:55,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3731 proven. 2025 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-02 11:19:55,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:55,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 48] total 98 [2019-10-02 11:19:55,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-10-02 11:19:55,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-10-02 11:19:55,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-10-02 11:19:55,090 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 98 states. [2019-10-02 11:19:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:55,675 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2019-10-02 11:19:55,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-10-02 11:19:55,675 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-10-02 11:19:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:55,677 INFO L225 Difference]: With dead ends: 206 [2019-10-02 11:19:55,677 INFO L226 Difference]: Without dead ends: 203 [2019-10-02 11:19:55,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-10-02 11:19:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-02 11:19:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-10-02 11:19:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-02 11:19:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-10-02 11:19:55,684 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 199 [2019-10-02 11:19:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:55,685 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-10-02 11:19:55,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-10-02 11:19:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-10-02 11:19:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 11:19:55,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:55,686 INFO L411 BasicCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:55,687 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:55,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:55,687 INFO L82 PathProgramCache]: Analyzing trace with hash -989671660, now seen corresponding path program 24 times [2019-10-02 11:19:55,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:55,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:55,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:55,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:59,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:59,028 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:59,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:19:59,241 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2019-10-02 11:19:59,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:59,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 11:19:59,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-02 11:19:59,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:59,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 49] total 99 [2019-10-02 11:19:59,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-02 11:19:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-02 11:19:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-10-02 11:19:59,290 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 99 states. [2019-10-02 11:19:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:59,936 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2019-10-02 11:19:59,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-02 11:19:59,936 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-10-02 11:19:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:59,937 INFO L225 Difference]: With dead ends: 208 [2019-10-02 11:19:59,937 INFO L226 Difference]: Without dead ends: 205 [2019-10-02 11:19:59,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-10-02 11:19:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-02 11:19:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-10-02 11:19:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-02 11:19:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-10-02 11:19:59,946 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2019-10-02 11:19:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:59,946 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-10-02 11:19:59,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-02 11:19:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-10-02 11:19:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 11:19:59,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:59,948 INFO L411 BasicCegarLoop]: trace histogram [88, 47, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:59,948 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1894231186, now seen corresponding path program 25 times [2019-10-02 11:19:59,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:59,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:59,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:03,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:03,464 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:03,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:03,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-10-02 11:20:03,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:03,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:03,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-10-02 11:20:03,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-10-02 11:20:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-10-02 11:20:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-10-02 11:20:03,692 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 100 states. [2019-10-02 11:20:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:04,199 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-10-02 11:20:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-02 11:20:04,200 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-10-02 11:20:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:04,201 INFO L225 Difference]: With dead ends: 210 [2019-10-02 11:20:04,202 INFO L226 Difference]: Without dead ends: 207 [2019-10-02 11:20:04,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-10-02 11:20:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-02 11:20:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-10-02 11:20:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-02 11:20:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-10-02 11:20:04,208 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-10-02 11:20:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:04,209 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-10-02 11:20:04,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-10-02 11:20:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-10-02 11:20:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 11:20:04,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:04,210 INFO L411 BasicCegarLoop]: trace histogram [89, 48, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:04,210 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 26 times [2019-10-02 11:20:04,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:08,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:08,020 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:08,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:20:08,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:20:08,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:08,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-02 11:20:08,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:08,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:08,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-10-02 11:20:08,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-02 11:20:08,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-02 11:20:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-10-02 11:20:08,261 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2019-10-02 11:20:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:08,814 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-10-02 11:20:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-02 11:20:08,814 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-10-02 11:20:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:08,816 INFO L225 Difference]: With dead ends: 212 [2019-10-02 11:20:08,817 INFO L226 Difference]: Without dead ends: 209 [2019-10-02 11:20:08,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-10-02 11:20:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-02 11:20:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-10-02 11:20:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-02 11:20:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-10-02 11:20:08,824 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-10-02 11:20:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:08,824 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-10-02 11:20:08,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-02 11:20:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-10-02 11:20:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 11:20:08,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:08,826 INFO L411 BasicCegarLoop]: trace histogram [90, 49, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:08,826 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 27 times [2019-10-02 11:20:08,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:08,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:08,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:12,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:12,315 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:12,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:20:12,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 91 check-sat command(s) [2019-10-02 11:20:12,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:12,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-02 11:20:12,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:12,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:12,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-10-02 11:20:12,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-10-02 11:20:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-10-02 11:20:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-02 11:20:12,632 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2019-10-02 11:20:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:13,295 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-10-02 11:20:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-02 11:20:13,295 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-10-02 11:20:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:13,297 INFO L225 Difference]: With dead ends: 213 [2019-10-02 11:20:13,297 INFO L226 Difference]: Without dead ends: 210 [2019-10-02 11:20:13,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-02 11:20:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-02 11:20:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-10-02 11:20:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-02 11:20:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-10-02 11:20:13,305 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2019-10-02 11:20:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:13,306 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-10-02 11:20:13,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-10-02 11:20:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-10-02 11:20:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 11:20:13,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:13,307 INFO L411 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:13,307 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 28 times [2019-10-02 11:20:13,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:13,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:13,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-02 11:20:15,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:15,134 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:15,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:20:15,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:20:15,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:15,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-10-02 11:20:15,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:15,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-02 11:20:15,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:15,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-02 11:20:15,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 11:20:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 11:20:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 11:20:15,526 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-10-02 11:20:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:17,305 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2019-10-02 11:20:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 11:20:17,306 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-10-02 11:20:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:17,307 INFO L225 Difference]: With dead ends: 216 [2019-10-02 11:20:17,307 INFO L226 Difference]: Without dead ends: 213 [2019-10-02 11:20:17,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 11:20:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-02 11:20:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-10-02 11:20:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-02 11:20:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-10-02 11:20:17,317 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-10-02 11:20:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:17,317 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-10-02 11:20:17,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 11:20:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-10-02 11:20:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 11:20:17,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:17,318 INFO L411 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:17,318 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 29 times [2019-10-02 11:20:17,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:17,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:17,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:17,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:17,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-02 11:20:18,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:20:18,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-10-02 11:20:18,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 11:20:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 11:20:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:20:18,575 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-10-02 11:20:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:18,786 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-10-02 11:20:18,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 11:20:18,787 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-10-02 11:20:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:18,787 INFO L225 Difference]: With dead ends: 212 [2019-10-02 11:20:18,787 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:20:18,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:20:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:20:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:20:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:20:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:20:18,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-10-02 11:20:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:18,796 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:20:18,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 11:20:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:20:18,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:20:18,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:20:18,928 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 307 [2019-10-02 11:20:20,223 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-10-02 11:20:20,255 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:20:20,255 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:20:20,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:20:20,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:20:20,256 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:20:20,256 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:20:20,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:20:20,257 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2019-10-02 11:20:20,257 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 209) no Hoare annotation was computed. [2019-10-02 11:20:20,257 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2019-10-02 11:20:20,257 INFO L439 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 50 main_~main__y~0)) [2019-10-02 11:20:20,257 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2019-10-02 11:20:20,259 INFO L439 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2019-10-02 11:20:20,259 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2019-10-02 11:20:20,259 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2019-10-02 11:20:20,259 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2019-10-02 11:20:20,259 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2019-10-02 11:20:20,259 INFO L439 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 1)) [2019-10-02 11:20:20,260 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2019-10-02 11:20:20,260 INFO L439 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2)) [2019-10-02 11:20:20,260 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 11:20:20,260 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2019-10-02 11:20:20,260 INFO L439 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 3)) [2019-10-02 11:20:20,260 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 209) no Hoare annotation was computed. [2019-10-02 11:20:20,260 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2019-10-02 11:20:20,260 INFO L439 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2019-10-02 11:20:20,260 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 209) the Hoare annotation is: true [2019-10-02 11:20:20,261 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2019-10-02 11:20:20,261 INFO L439 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 50 main_~main__y~0)) [2019-10-02 11:20:20,261 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2019-10-02 11:20:20,261 INFO L439 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2019-10-02 11:20:20,261 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-02 11:20:20,261 INFO L439 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 50 main_~main__y~0)) [2019-10-02 11:20:20,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:20:20 BoogieIcfgContainer [2019-10-02 11:20:20,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:20:20,297 INFO L168 Benchmark]: Toolchain (without parser) took 87141.48 ms. Allocated memory was 137.4 MB in the beginning and 790.6 MB in the end (delta: 653.3 MB). Free memory was 88.2 MB in the beginning and 544.1 MB in the end (delta: -455.9 MB). Peak memory consumption was 670.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:20:20,298 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 137.4 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-02 11:20:20,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.15 ms. Allocated memory was 137.4 MB in the beginning and 199.2 MB in the end (delta: 61.9 MB). Free memory was 88.0 MB in the beginning and 176.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:20:20,300 INFO L168 Benchmark]: Boogie Preprocessor took 30.61 ms. Allocated memory is still 199.2 MB. Free memory was 176.4 MB in the beginning and 174.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:20:20,301 INFO L168 Benchmark]: RCFGBuilder took 358.55 ms. Allocated memory is still 199.2 MB. Free memory was 174.7 MB in the beginning and 157.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:20:20,304 INFO L168 Benchmark]: TraceAbstraction took 86348.03 ms. Allocated memory was 199.2 MB in the beginning and 790.6 MB in the end (delta: 591.4 MB). Free memory was 157.8 MB in the beginning and 544.1 MB in the end (delta: -386.4 MB). Peak memory consumption was 678.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:20:20,312 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 137.4 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 399.15 ms. Allocated memory was 137.4 MB in the beginning and 199.2 MB in the end (delta: 61.9 MB). Free memory was 88.0 MB in the beginning and 176.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.61 ms. Allocated memory is still 199.2 MB. Free memory was 176.4 MB in the beginning and 174.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 358.55 ms. Allocated memory is still 199.2 MB. Free memory was 174.7 MB in the beginning and 157.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86348.03 ms. Allocated memory was 199.2 MB in the beginning and 790.6 MB in the end (delta: 591.4 MB). Free memory was 157.8 MB in the beginning and 544.1 MB in the end (delta: -386.4 MB). Peak memory consumption was 678.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 8) && 50 <= main__y - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 7) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 2 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 5) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y)) || ((main__y <= 100 && 100 <= main__x) && 100 <= main__y)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 86.2s OverallTime, 32 OverallIterations, 92 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 2106 SDslu, 12185 SDs, 0 SdLazy, 11775 SolverSat, 1776 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6120 GetRequests, 4107 SyntacticMatches, 1 SemanticMatches, 2012 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 22 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 113 NumberOfFragments, 742 HoareAnnotationTreeSize, 13 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 65.3s InterpolantComputationTime, 8518 NumberOfCodeBlocks, 8438 NumberOfCodeBlocksAsserted, 823 NumberOfCheckSat, 8458 ConstructedInterpolants, 0 QuantifiedInterpolants, 4277984 SizeOfPredicates, 25 NumberOfNonLiveVariables, 10048 ConjunctsInSsa, 1600 ConjunctsInUnsatCore, 60 InterpolantComputations, 4 PerfectInterpolantSequences, 41889/262629 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...