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/array-examples/standard_init8_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:12:22,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:12:22,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:12:22,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:12:22,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:12:22,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:12:22,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:12:22,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:12:22,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:12:22,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:12:22,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:12:22,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:12:22,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:12:22,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:12:22,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:12:22,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:12:22,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:12:22,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:12:22,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:12:22,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:12:22,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:12:22,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:12:22,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:12:22,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:12:22,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:12:22,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:12:22,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:12:22,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:12:22,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:12:22,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:12:22,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:12:22,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:12:22,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:12:22,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:12:22,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:12:22,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:12:22,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:12:22,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:12:22,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:12:22,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:12:22,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:12:22,189 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-01 23:12:22,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:12:22,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:12:22,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:12:22,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:12:22,205 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:12:22,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:12:22,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:12:22,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:12:22,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:12:22,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:12:22,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:12:22,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:12:22,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:12:22,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:12:22,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:12:22,207 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:12:22,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:12:22,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:12:22,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:12:22,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:12:22,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:12:22,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:12:22,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:12:22,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:12:22,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:12:22,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:12:22,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:12:22,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:12:22,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:12:22,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:12:22,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:12:22,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:12:22,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:12:22,256 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:12:22,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init8_ground-1.i [2019-10-01 23:12:22,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3e2b91f/667753e5ed53465cb06da71c35e092e8/FLAG0125416c3 [2019-10-01 23:12:22,761 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:12:22,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init8_ground-1.i [2019-10-01 23:12:22,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3e2b91f/667753e5ed53465cb06da71c35e092e8/FLAG0125416c3 [2019-10-01 23:12:23,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3e2b91f/667753e5ed53465cb06da71c35e092e8 [2019-10-01 23:12:23,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:12:23,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:12:23,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:12:23,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:12:23,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:12:23,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71518f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23, skipping insertion in model container [2019-10-01 23:12:23,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:12:23,164 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:12:23,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:12:23,347 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:12:23,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:12:23,387 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:12:23,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23 WrapperNode [2019-10-01 23:12:23,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:12:23,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:12:23,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:12:23,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:12:23,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (1/1) ... [2019-10-01 23:12:23,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:12:23,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:12:23,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:12:23,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:12:23,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (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-01 23:12:23,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:12:23,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:12:23,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:12:23,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:12:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:12:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:12:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:12:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:12:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:12:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:12:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:12:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:12:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:12:23,891 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:12:23,891 INFO L283 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-01 23:12:23,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:12:23 BoogieIcfgContainer [2019-10-01 23:12:23,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:12:23,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:12:23,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:12:23,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:12:23,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:12:23" (1/3) ... [2019-10-01 23:12:23,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13682942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:12:23, skipping insertion in model container [2019-10-01 23:12:23,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:12:23" (2/3) ... [2019-10-01 23:12:23,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13682942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:12:23, skipping insertion in model container [2019-10-01 23:12:23,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:12:23" (3/3) ... [2019-10-01 23:12:23,917 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init8_ground-1.i [2019-10-01 23:12:23,926 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:12:23,933 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:12:23,950 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:12:23,976 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:12:23,977 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:12:23,977 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:12:23,977 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:12:23,977 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:12:23,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:12:23,978 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:12:23,978 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:12:23,978 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:12:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-01 23:12:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 23:12:24,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:24,001 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-01 23:12:24,003 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1916738342, now seen corresponding path program 1 times [2019-10-01 23:12:24,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:24,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:24,144 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-01 23:12:24,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:12:24,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:12:24,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:12:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:12:24,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:12:24,164 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-10-01 23:12:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:24,187 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2019-10-01 23:12:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:12:24,188 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2019-10-01 23:12:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:24,195 INFO L225 Difference]: With dead ends: 67 [2019-10-01 23:12:24,196 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 23:12:24,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:12:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 23:12:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-01 23:12:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 23:12:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-10-01 23:12:24,239 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2019-10-01 23:12:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:24,240 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-10-01 23:12:24,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:12:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-10-01 23:12:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 23:12:24,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:24,242 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-01 23:12:24,242 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -330794466, now seen corresponding path program 1 times [2019-10-01 23:12:24,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:24,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:24,318 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-01 23:12:24,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:12:24,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:12:24,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:12:24,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:12:24,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:12:24,322 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2019-10-01 23:12:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:24,460 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2019-10-01 23:12:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:12:24,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-01 23:12:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:24,462 INFO L225 Difference]: With dead ends: 65 [2019-10-01 23:12:24,463 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 23:12:24,464 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-01 23:12:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 23:12:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-01 23:12:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 23:12:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-01 23:12:24,474 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2019-10-01 23:12:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:24,474 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-01 23:12:24,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:12:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-01 23:12:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 23:12:24,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:24,476 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, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:24,477 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1167956326, now seen corresponding path program 1 times [2019-10-01 23:12:24,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:24,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:12:24,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:24,611 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:24,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:24,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:12:24,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:12:24,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:24,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:12:24,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:12:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:12:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:12:24,726 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-10-01 23:12:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:24,838 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2019-10-01 23:12:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:12:24,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-01 23:12:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:24,841 INFO L225 Difference]: With dead ends: 80 [2019-10-01 23:12:24,841 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 23:12:24,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:12:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 23:12:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-01 23:12:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 23:12:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-10-01 23:12:24,851 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 35 [2019-10-01 23:12:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:24,852 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-10-01 23:12:24,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:12:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-10-01 23:12:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 23:12:24,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:24,854 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-01 23:12:24,854 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1255820446, now seen corresponding path program 2 times [2019-10-01 23:12:24,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:24,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:24,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:12:24,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:24,998 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-01 23:12:25,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:12:25,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:12:25,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:25,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:12:25,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:12:25,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:25,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:12:25,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:12:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:12:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:12:25,102 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2019-10-01 23:12:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:25,240 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-10-01 23:12:25,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:12:25,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-01 23:12:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:25,243 INFO L225 Difference]: With dead ends: 95 [2019-10-01 23:12:25,243 INFO L226 Difference]: Without dead ends: 56 [2019-10-01 23:12:25,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:12:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-01 23:12:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-01 23:12:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 23:12:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-10-01 23:12:25,253 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 43 [2019-10-01 23:12:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:25,253 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-10-01 23:12:25,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:12:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-10-01 23:12:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 23:12:25,255 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:25,255 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-01 23:12:25,256 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2017193242, now seen corresponding path program 3 times [2019-10-01 23:12:25,256 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:25,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:25,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-01 23:12:25,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:25,417 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:25,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:12:25,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:12:25,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:25,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:12:25,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-01 23:12:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:12:25,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:12:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:12:25,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:12:25,591 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 7 states. [2019-10-01 23:12:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:25,765 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2019-10-01 23:12:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:12:25,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-01 23:12:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:25,767 INFO L225 Difference]: With dead ends: 110 [2019-10-01 23:12:25,769 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 23:12:25,770 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:12:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 23:12:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-01 23:12:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-01 23:12:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2019-10-01 23:12:25,789 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 51 [2019-10-01 23:12:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:25,789 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-10-01 23:12:25,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:12:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2019-10-01 23:12:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 23:12:25,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:25,796 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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-01 23:12:25,796 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash 544374558, now seen corresponding path program 4 times [2019-10-01 23:12:25,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:25,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:25,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:25,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:25,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-01 23:12:25,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:25,977 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) [2019-10-01 23:12:26,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:26,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:12:26,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:26,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:12:26,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-01 23:12:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:26,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:12:26,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:12:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:12:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:12:26,098 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 8 states. [2019-10-01 23:12:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:26,248 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-10-01 23:12:26,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:12:26,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-10-01 23:12:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:26,251 INFO L225 Difference]: With dead ends: 125 [2019-10-01 23:12:26,251 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 23:12:26,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:12:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 23:12:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-01 23:12:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 23:12:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-10-01 23:12:26,272 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 59 [2019-10-01 23:12:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:26,273 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-10-01 23:12:26,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:12:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-10-01 23:12:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 23:12:26,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:26,274 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-10-01 23:12:26,275 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash 325227418, now seen corresponding path program 5 times [2019-10-01 23:12:26,275 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:26,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:26,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:12:26,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:26,407 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) [2019-10-01 23:12:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:39,673 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-01 23:12:39,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:39,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:12:39,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:12:39,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:39,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:12:39,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:12:39,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:12:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:12:39,727 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2019-10-01 23:12:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:39,860 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2019-10-01 23:12:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:12:39,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-10-01 23:12:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:39,862 INFO L225 Difference]: With dead ends: 140 [2019-10-01 23:12:39,862 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:12:39,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:12:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:12:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-01 23:12:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 23:12:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-10-01 23:12:39,872 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 67 [2019-10-01 23:12:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:39,872 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-10-01 23:12:39,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:12:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-10-01 23:12:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:12:39,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:39,874 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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-01 23:12:39,874 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1206981022, now seen corresponding path program 6 times [2019-10-01 23:12:39,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:39,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:39,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:39,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:39,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-01 23:12:39,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:39,988 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-01 23:12:40,017 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:12:41,894 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-01 23:12:41,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:41,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:12:41,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-01 23:12:41,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:41,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:12:41,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:12:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:12:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:12:41,928 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 10 states. [2019-10-01 23:12:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:42,106 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2019-10-01 23:12:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:12:42,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-10-01 23:12:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:42,108 INFO L225 Difference]: With dead ends: 155 [2019-10-01 23:12:42,110 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 23:12:42,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:12:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 23:12:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-10-01 23:12:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:12:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-10-01 23:12:42,120 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 75 [2019-10-01 23:12:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:42,121 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-10-01 23:12:42,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:12:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-10-01 23:12:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 23:12:42,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:42,122 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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-01 23:12:42,123 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 192305690, now seen corresponding path program 7 times [2019-10-01 23:12:42,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:42,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:42,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 23:12:42,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:42,264 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:42,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:42,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:12:42,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:12:42,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:42,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:12:42,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:12:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:12:42,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:12:42,398 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 11 states. [2019-10-01 23:12:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:42,550 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2019-10-01 23:12:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:12:42,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-10-01 23:12:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:42,552 INFO L225 Difference]: With dead ends: 170 [2019-10-01 23:12:42,552 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 23:12:42,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:12:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 23:12:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-10-01 23:12:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-01 23:12:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-10-01 23:12:42,562 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 83 [2019-10-01 23:12:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:42,563 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-10-01 23:12:42,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:12:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-10-01 23:12:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 23:12:42,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:42,564 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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-01 23:12:42,565 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:42,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1640627170, now seen corresponding path program 8 times [2019-10-01 23:12:42,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:42,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:42,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-01 23:12:42,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:42,712 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) [2019-10-01 23:12:42,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:42,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:12:42,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:42,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:12:42,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 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-01 23:12:42,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:42,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:12:42,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:12:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:12:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:12:42,825 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 12 states. [2019-10-01 23:12:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:43,004 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2019-10-01 23:12:43,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:12:43,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-10-01 23:12:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:43,009 INFO L225 Difference]: With dead ends: 185 [2019-10-01 23:12:43,009 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 23:12:43,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:12:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 23:12:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-01 23:12:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 23:12:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-10-01 23:12:43,018 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 91 [2019-10-01 23:12:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:43,019 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-10-01 23:12:43,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:12:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-10-01 23:12:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 23:12:43,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:43,021 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 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-01 23:12:43,021 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash -32030566, now seen corresponding path program 9 times [2019-10-01 23:12:43,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:43,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:43,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-01 23:12:43,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:43,165 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) [2019-10-01 23:12:43,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:04,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:13:04,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:04,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:13:04,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-01 23:13:04,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:04,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:13:04,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:13:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:13:04,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:13:04,091 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 13 states. [2019-10-01 23:13:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:04,275 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2019-10-01 23:13:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:13:04,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-10-01 23:13:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:04,276 INFO L225 Difference]: With dead ends: 200 [2019-10-01 23:13:04,277 INFO L226 Difference]: Without dead ends: 112 [2019-10-01 23:13:04,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:13:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-01 23:13:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-10-01 23:13:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 23:13:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-10-01 23:13:04,297 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 99 [2019-10-01 23:13:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:04,297 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-10-01 23:13:04,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:13:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-10-01 23:13:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 23:13:04,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:04,304 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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-01 23:13:04,305 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash 35739294, now seen corresponding path program 10 times [2019-10-01 23:13:04,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:04,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:04,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-01 23:13:04,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:04,480 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) [2019-10-01 23:13:04,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:04,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:13:04,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:04,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:13:04,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-01 23:13:04,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:04,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:13:04,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:13:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:13:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:13:04,649 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 14 states. [2019-10-01 23:13:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:04,904 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2019-10-01 23:13:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:13:04,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-10-01 23:13:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:04,905 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:13:04,905 INFO L226 Difference]: Without dead ends: 120 [2019-10-01 23:13:04,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:13:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-01 23:13:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-01 23:13:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-01 23:13:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2019-10-01 23:13:04,914 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 107 [2019-10-01 23:13:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:04,914 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2019-10-01 23:13:04,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:13:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2019-10-01 23:13:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-01 23:13:04,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:04,916 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 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-01 23:13:04,916 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1494923494, now seen corresponding path program 11 times [2019-10-01 23:13:04,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:04,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:04,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-01 23:13:05,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:05,084 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-01 23:13:05,105 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:13:54,301 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 23:13:54,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:54,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:13:54,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-01 23:13:54,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:54,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:13:54,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:13:54,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:13:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:13:54,390 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 15 states. [2019-10-01 23:13:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:54,590 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2019-10-01 23:13:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:13:54,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-10-01 23:13:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:54,592 INFO L225 Difference]: With dead ends: 230 [2019-10-01 23:13:54,592 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 23:13:54,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:13:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 23:13:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-10-01 23:13:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 23:13:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2019-10-01 23:13:54,601 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 115 [2019-10-01 23:13:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:54,603 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2019-10-01 23:13:54,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:13:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2019-10-01 23:13:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 23:13:54,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:54,605 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 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-01 23:13:54,605 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1418922270, now seen corresponding path program 12 times [2019-10-01 23:13:54,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:54,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:54,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-10-01 23:13:54,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:54,808 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-01 23:13:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:14:32,780 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:14:32,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:14:32,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:14:32,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-10-01 23:14:32,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:32,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:14:32,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:14:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:14:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:14:32,853 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 16 states. [2019-10-01 23:14:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:33,081 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2019-10-01 23:14:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:14:33,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2019-10-01 23:14:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:33,084 INFO L225 Difference]: With dead ends: 245 [2019-10-01 23:14:33,084 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 23:14:33,085 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:14:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 23:14:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-10-01 23:14:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-01 23:14:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-10-01 23:14:33,094 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 123 [2019-10-01 23:14:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:33,094 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-10-01 23:14:33,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:14:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-10-01 23:14:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 23:14:33,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:33,096 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 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-01 23:14:33,096 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash -545231462, now seen corresponding path program 13 times [2019-10-01 23:14:33,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:33,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:33,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:14:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-10-01 23:14:33,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:33,335 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-01 23:14:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:14:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:33,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:14:33,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-10-01 23:14:33,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:33,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:14:33,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:14:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:14:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:14:33,481 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 17 states. [2019-10-01 23:14:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:33,783 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2019-10-01 23:14:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:14:33,785 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2019-10-01 23:14:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:33,786 INFO L225 Difference]: With dead ends: 260 [2019-10-01 23:14:33,786 INFO L226 Difference]: Without dead ends: 144 [2019-10-01 23:14:33,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:14:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-01 23:14:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-10-01 23:14:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-01 23:14:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-10-01 23:14:33,792 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 131 [2019-10-01 23:14:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:33,792 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-10-01 23:14:33,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:14:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-10-01 23:14:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-01 23:14:33,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:33,796 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 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-01 23:14:33,796 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:33,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:33,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2020285342, now seen corresponding path program 14 times [2019-10-01 23:14:33,797 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:33,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:33,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:33,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:14:33,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-01 23:14:34,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:34,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 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-01 23:14:34,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:14:34,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:14:34,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:14:34,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:14:34,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-01 23:14:34,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:34,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:14:34,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:14:34,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:14:34,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:14:34,194 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 18 states. [2019-10-01 23:14:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:34,511 INFO L93 Difference]: Finished difference Result 275 states and 298 transitions. [2019-10-01 23:14:34,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:14:34,511 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2019-10-01 23:14:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:34,513 INFO L225 Difference]: With dead ends: 275 [2019-10-01 23:14:34,513 INFO L226 Difference]: Without dead ends: 152 [2019-10-01 23:14:34,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:14:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-01 23:14:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-01 23:14:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-01 23:14:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2019-10-01 23:14:34,521 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 139 [2019-10-01 23:14:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:34,522 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2019-10-01 23:14:34,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:14:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2019-10-01 23:14:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 23:14:34,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:34,523 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 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-01 23:14:34,524 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:34,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1618430950, now seen corresponding path program 15 times [2019-10-01 23:14:34,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:34,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:34,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:14:34,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-01 23:14:34,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:34,777 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) [2019-10-01 23:14:34,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:32,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:15:32,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:32,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:15:32,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-01 23:15:32,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:15:32,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:15:32,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:15:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:15:32,897 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand 19 states. [2019-10-01 23:15:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:33,150 INFO L93 Difference]: Finished difference Result 290 states and 313 transitions. [2019-10-01 23:15:33,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:15:33,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-10-01 23:15:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:33,152 INFO L225 Difference]: With dead ends: 290 [2019-10-01 23:15:33,152 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 23:15:33,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:15:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 23:15:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-10-01 23:15:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 23:15:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2019-10-01 23:15:33,160 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 147 [2019-10-01 23:15:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:33,160 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2019-10-01 23:15:33,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:15:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2019-10-01 23:15:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 23:15:33,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:33,162 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 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-01 23:15:33,162 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1384746526, now seen corresponding path program 16 times [2019-10-01 23:15:33,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:33,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-01 23:15:33,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:33,409 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-01 23:15:33,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:15:33,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:15:33,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:33,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:15:33,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-10-01 23:15:33,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:33,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:15:33,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:15:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:15:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:15:33,595 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 20 states. [2019-10-01 23:15:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:33,901 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2019-10-01 23:15:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:15:33,904 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2019-10-01 23:15:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:33,905 INFO L225 Difference]: With dead ends: 305 [2019-10-01 23:15:33,905 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 23:15:33,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:15:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 23:15:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-10-01 23:15:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-01 23:15:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2019-10-01 23:15:33,910 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 155 [2019-10-01 23:15:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:33,911 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2019-10-01 23:15:33,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:15:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2019-10-01 23:15:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-01 23:15:33,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:33,912 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 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-01 23:15:33,912 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -56747366, now seen corresponding path program 17 times [2019-10-01 23:15:33,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:33,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:33,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2019-10-01 23:15:34,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:34,184 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-01 23:15:34,203 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:17:01,954 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 23:17:01,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:17:02,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:17:02,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:17:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2019-10-01 23:17:02,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:17:02,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:17:02,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:17:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:17:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:17:02,087 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand 21 states. [2019-10-01 23:17:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:17:02,484 INFO L93 Difference]: Finished difference Result 320 states and 343 transitions. [2019-10-01 23:17:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:17:02,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 163 [2019-10-01 23:17:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:17:02,486 INFO L225 Difference]: With dead ends: 320 [2019-10-01 23:17:02,486 INFO L226 Difference]: Without dead ends: 176 [2019-10-01 23:17:02,487 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:17:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-01 23:17:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-10-01 23:17:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-01 23:17:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 184 transitions. [2019-10-01 23:17:02,498 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 184 transitions. Word has length 163 [2019-10-01 23:17:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:17:02,498 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 184 transitions. [2019-10-01 23:17:02,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:17:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 184 transitions. [2019-10-01 23:17:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-01 23:17:02,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:17:02,501 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 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-01 23:17:02,502 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:17:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:17:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash -909221730, now seen corresponding path program 18 times [2019-10-01 23:17:02,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:17:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:17:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:02,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:17:02,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:17:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2019-10-01 23:17:02,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:17:02,881 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) [2019-10-01 23:17:02,916 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:18:17,803 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:18:17,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:18:17,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:18:17,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:18:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-10-01 23:18:17,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:18:17,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-10-01 23:18:17,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:18:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:18:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:18:17,939 INFO L87 Difference]: Start difference. First operand 176 states and 184 transitions. Second operand 23 states. [2019-10-01 23:18:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:18:18,486 INFO L93 Difference]: Finished difference Result 335 states and 358 transitions. [2019-10-01 23:18:18,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:18:18,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 171 [2019-10-01 23:18:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:18:18,488 INFO L225 Difference]: With dead ends: 335 [2019-10-01 23:18:18,489 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 23:18:18,492 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:18:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 23:18:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-10-01 23:18:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-01 23:18:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 192 transitions. [2019-10-01 23:18:18,502 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 192 transitions. Word has length 171 [2019-10-01 23:18:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:18:18,502 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 192 transitions. [2019-10-01 23:18:18,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:18:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 192 transitions. [2019-10-01 23:18:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-01 23:18:18,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:18:18,505 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 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-01 23:18:18,505 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:18:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:18:18,506 INFO L82 PathProgramCache]: Analyzing trace with hash 710975770, now seen corresponding path program 19 times [2019-10-01 23:18:18,506 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:18:18,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:18:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:18,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:18:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:18:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-10-01 23:18:18,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:18:18,914 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-01 23:18:18,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:18:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:18:19,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:18:19,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:18:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-10-01 23:18:19,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:18:19,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:18:19,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:18:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:18:19,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:18:19,136 INFO L87 Difference]: Start difference. First operand 184 states and 192 transitions. Second operand 23 states. [2019-10-01 23:18:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:18:19,547 INFO L93 Difference]: Finished difference Result 350 states and 373 transitions. [2019-10-01 23:18:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:18:19,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2019-10-01 23:18:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:18:19,553 INFO L225 Difference]: With dead ends: 350 [2019-10-01 23:18:19,554 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 23:18:19,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:18:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 23:18:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-10-01 23:18:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-01 23:18:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 200 transitions. [2019-10-01 23:18:19,566 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 200 transitions. Word has length 179 [2019-10-01 23:18:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:18:19,567 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 200 transitions. [2019-10-01 23:18:19,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:18:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 200 transitions. [2019-10-01 23:18:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-01 23:18:19,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:18:19,569 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 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-01 23:18:19,570 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:18:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:18:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash -954625250, now seen corresponding path program 20 times [2019-10-01 23:18:19,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:18:19,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:18:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:19,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:18:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:18:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2019-10-01 23:18:20,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:18:20,061 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-01 23:18:20,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:18:20,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:18:20,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:18:20,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:18:20,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:18:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2019-10-01 23:18:20,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:18:20,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:18:20,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:18:20,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:18:20,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:18:20,252 INFO L87 Difference]: Start difference. First operand 192 states and 200 transitions. Second operand 24 states. [2019-10-01 23:18:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:18:20,645 INFO L93 Difference]: Finished difference Result 365 states and 388 transitions. [2019-10-01 23:18:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:18:20,646 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 187 [2019-10-01 23:18:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:18:20,647 INFO L225 Difference]: With dead ends: 365 [2019-10-01 23:18:20,647 INFO L226 Difference]: Without dead ends: 200 [2019-10-01 23:18:20,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:18:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-01 23:18:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-10-01 23:18:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-01 23:18:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 208 transitions. [2019-10-01 23:18:20,656 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 208 transitions. Word has length 187 [2019-10-01 23:18:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:18:20,657 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 208 transitions. [2019-10-01 23:18:20,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:18:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 208 transitions. [2019-10-01 23:18:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-01 23:18:20,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:18:20,658 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 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-01 23:18:20,659 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:18:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:18:20,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2054178714, now seen corresponding path program 21 times [2019-10-01 23:18:20,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:18:20,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:18:20,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:20,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:18:20,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:18:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-10-01 23:18:21,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:18:21,161 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-01 23:18:21,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:19:54,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:19:54,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:19:54,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:19:54,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:19:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-10-01 23:19:54,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:19:54,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:19:54,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:19:54,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:19:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:19:54,904 INFO L87 Difference]: Start difference. First operand 200 states and 208 transitions. Second operand 25 states. [2019-10-01 23:19:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:19:55,330 INFO L93 Difference]: Finished difference Result 380 states and 403 transitions. [2019-10-01 23:19:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:19:55,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 195 [2019-10-01 23:19:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:19:55,332 INFO L225 Difference]: With dead ends: 380 [2019-10-01 23:19:55,332 INFO L226 Difference]: Without dead ends: 208 [2019-10-01 23:19:55,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:19:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-01 23:19:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-01 23:19:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-01 23:19:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 216 transitions. [2019-10-01 23:19:55,342 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 216 transitions. Word has length 195 [2019-10-01 23:19:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:19:55,343 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 216 transitions. [2019-10-01 23:19:55,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:19:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 216 transitions. [2019-10-01 23:19:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-01 23:19:55,344 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:19:55,344 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 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-01 23:19:55,345 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:19:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:19:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 894117278, now seen corresponding path program 22 times [2019-10-01 23:19:55,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:19:55,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:19:55,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:55,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:19:55,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:19:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2024 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-01 23:19:55,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:19:55,776 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-01 23:19:55,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:19:55,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:19:55,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:19:55,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:19:55,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:19:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2024 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:19:55,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:19:55,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:19:55,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:19:55,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:19:55,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:19:55,987 INFO L87 Difference]: Start difference. First operand 208 states and 216 transitions. Second operand 26 states. [2019-10-01 23:19:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:19:56,397 INFO L93 Difference]: Finished difference Result 395 states and 418 transitions. [2019-10-01 23:19:56,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:19:56,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 203 [2019-10-01 23:19:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:19:56,398 INFO L225 Difference]: With dead ends: 395 [2019-10-01 23:19:56,398 INFO L226 Difference]: Without dead ends: 216 [2019-10-01 23:19:56,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:19:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-01 23:19:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-10-01 23:19:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-01 23:19:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 224 transitions. [2019-10-01 23:19:56,405 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 224 transitions. Word has length 203 [2019-10-01 23:19:56,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:19:56,405 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 224 transitions. [2019-10-01 23:19:56,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:19:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 224 transitions. [2019-10-01 23:19:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-01 23:19:56,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:19:56,407 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 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-01 23:19:56,407 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:19:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:19:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1550650906, now seen corresponding path program 23 times [2019-10-01 23:19:56,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:19:56,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:19:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:56,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:19:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:19:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1932 trivial. 0 not checked. [2019-10-01 23:19:56,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:19:56,907 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-01 23:19:56,938 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:21:59,339 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 23:21:59,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:21:59,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:21:59,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1932 trivial. 0 not checked. [2019-10-01 23:21:59,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:59,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:21:59,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:21:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:21:59,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:21:59,502 INFO L87 Difference]: Start difference. First operand 216 states and 224 transitions. Second operand 27 states. [2019-10-01 23:21:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:59,875 INFO L93 Difference]: Finished difference Result 410 states and 433 transitions. [2019-10-01 23:21:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:21:59,875 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 211 [2019-10-01 23:21:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:59,877 INFO L225 Difference]: With dead ends: 410 [2019-10-01 23:21:59,878 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 23:21:59,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:21:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 23:21:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-10-01 23:21:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-01 23:21:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 232 transitions. [2019-10-01 23:21:59,886 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 232 transitions. Word has length 211 [2019-10-01 23:21:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:59,887 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 232 transitions. [2019-10-01 23:21:59,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:21:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 232 transitions. [2019-10-01 23:21:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-01 23:21:59,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:59,889 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 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-01 23:21:59,889 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 21174302, now seen corresponding path program 24 times [2019-10-01 23:21:59,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:59,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:21:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:22:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2100 trivial. 0 not checked. [2019-10-01 23:22:00,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:22:00,343 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-01 23:22:00,373 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:23:51,128 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:23:51,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:23:51,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:23:51,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:23:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 24 proven. 300 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2019-10-01 23:23:51,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:23:51,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 29 [2019-10-01 23:23:51,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:23:51,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:23:51,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:23:51,332 INFO L87 Difference]: Start difference. First operand 224 states and 232 transitions. Second operand 29 states. [2019-10-01 23:23:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:23:51,821 INFO L93 Difference]: Finished difference Result 425 states and 448 transitions. [2019-10-01 23:23:51,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:23:51,821 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 219 [2019-10-01 23:23:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:23:51,823 INFO L225 Difference]: With dead ends: 425 [2019-10-01 23:23:51,824 INFO L226 Difference]: Without dead ends: 232 [2019-10-01 23:23:51,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:23:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-01 23:23:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-01 23:23:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-01 23:23:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 240 transitions. [2019-10-01 23:23:51,833 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 240 transitions. Word has length 219 [2019-10-01 23:23:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:23:51,834 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 240 transitions. [2019-10-01 23:23:51,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:23:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 240 transitions. [2019-10-01 23:23:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 23:23:51,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:23:51,836 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 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-01 23:23:51,836 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:23:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:23:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1576465562, now seen corresponding path program 25 times [2019-10-01 23:23:51,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:23:51,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:23:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:51,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:23:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:23:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2600 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2275 trivial. 0 not checked. [2019-10-01 23:23:52,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:23:52,337 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-01 23:23:52,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:23:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:23:52,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:23:52,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:23:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2600 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2275 trivial. 0 not checked. [2019-10-01 23:23:52,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:23:52,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:23:52,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:23:52,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:23:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:23:52,601 INFO L87 Difference]: Start difference. First operand 232 states and 240 transitions. Second operand 29 states. [2019-10-01 23:23:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:23:53,034 INFO L93 Difference]: Finished difference Result 440 states and 463 transitions. [2019-10-01 23:23:53,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:23:53,035 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 227 [2019-10-01 23:23:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:23:53,037 INFO L225 Difference]: With dead ends: 440 [2019-10-01 23:23:53,037 INFO L226 Difference]: Without dead ends: 240 [2019-10-01 23:23:53,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:23:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-01 23:23:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-10-01 23:23:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-01 23:23:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 248 transitions. [2019-10-01 23:23:53,046 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 248 transitions. Word has length 227 [2019-10-01 23:23:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:23:53,046 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 248 transitions. [2019-10-01 23:23:53,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:23:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 248 transitions. [2019-10-01 23:23:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-01 23:23:53,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:23:53,048 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 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-01 23:23:53,048 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:23:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:23:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash 434203294, now seen corresponding path program 26 times [2019-10-01 23:23:53,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:23:53,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:23:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:53,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:23:53,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:23:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2457 trivial. 0 not checked. [2019-10-01 23:23:53,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:23:53,641 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-01 23:23:53,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:23:53,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:23:53,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:23:53,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:23:53,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:23:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2457 trivial. 0 not checked. [2019-10-01 23:23:53,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:23:53,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:23:53,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:23:53,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:23:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:23:53,896 INFO L87 Difference]: Start difference. First operand 240 states and 248 transitions. Second operand 30 states. [2019-10-01 23:23:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:23:54,364 INFO L93 Difference]: Finished difference Result 455 states and 478 transitions. [2019-10-01 23:23:54,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:23:54,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 235 [2019-10-01 23:23:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:23:54,366 INFO L225 Difference]: With dead ends: 455 [2019-10-01 23:23:54,366 INFO L226 Difference]: Without dead ends: 248 [2019-10-01 23:23:54,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:23:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-01 23:23:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-10-01 23:23:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-01 23:23:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 256 transitions. [2019-10-01 23:23:54,376 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 256 transitions. Word has length 235 [2019-10-01 23:23:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:23:54,376 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 256 transitions. [2019-10-01 23:23:54,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:23:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 256 transitions. [2019-10-01 23:23:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-01 23:23:54,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:23:54,378 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 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-01 23:23:54,378 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:23:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:23:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash 716045082, now seen corresponding path program 27 times [2019-10-01 23:23:54,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:23:54,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:23:54,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:54,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:23:54,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:23:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2019-10-01 23:23:55,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:23:55,089 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-01 23:23:55,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:06,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:26:06,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:06,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:26:06,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2019-10-01 23:26:06,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:06,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:26:06,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:26:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:26:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:26:06,985 INFO L87 Difference]: Start difference. First operand 248 states and 256 transitions. Second operand 31 states. [2019-10-01 23:26:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:07,466 INFO L93 Difference]: Finished difference Result 470 states and 493 transitions. [2019-10-01 23:26:07,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:26:07,467 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 243 [2019-10-01 23:26:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:07,468 INFO L225 Difference]: With dead ends: 470 [2019-10-01 23:26:07,468 INFO L226 Difference]: Without dead ends: 256 [2019-10-01 23:26:07,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:26:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-01 23:26:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-10-01 23:26:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-01 23:26:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 264 transitions. [2019-10-01 23:26:07,477 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 264 transitions. Word has length 243 [2019-10-01 23:26:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:07,477 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 264 transitions. [2019-10-01 23:26:07,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:26:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 264 transitions. [2019-10-01 23:26:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-01 23:26:07,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:07,479 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 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-01 23:26:07,479 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:07,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1879448862, now seen corresponding path program 28 times [2019-10-01 23:26:07,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:07,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:07,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:07,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3248 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2842 trivial. 0 not checked. [2019-10-01 23:26:08,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:08,106 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-01 23:26:08,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:08,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:08,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:08,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:26:08,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3248 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2842 trivial. 0 not checked. [2019-10-01 23:26:08,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:08,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:26:08,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:26:08,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:26:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:26:08,450 INFO L87 Difference]: Start difference. First operand 256 states and 264 transitions. Second operand 32 states. [2019-10-01 23:26:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:08,978 INFO L93 Difference]: Finished difference Result 485 states and 508 transitions. [2019-10-01 23:26:08,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:26:08,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 251 [2019-10-01 23:26:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:08,980 INFO L225 Difference]: With dead ends: 485 [2019-10-01 23:26:08,980 INFO L226 Difference]: Without dead ends: 264 [2019-10-01 23:26:08,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:26:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-01 23:26:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-10-01 23:26:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-01 23:26:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 272 transitions. [2019-10-01 23:26:08,990 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 272 transitions. Word has length 251 [2019-10-01 23:26:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:08,991 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 272 transitions. [2019-10-01 23:26:08,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:26:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 272 transitions. [2019-10-01 23:26:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-01 23:26:08,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:08,993 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 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-01 23:26:08,993 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:08,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1942871654, now seen corresponding path program 29 times [2019-10-01 23:26:08,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:08,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:08,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:08,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2019-10-01 23:26:09,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:09,728 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:09,763 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1