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-crafted/bAnd1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 21:46:30,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 21:46:30,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 21:46:30,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 21:46:30,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 21:46:30,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 21:46:30,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 21:46:30,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 21:46:30,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 21:46:30,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 21:46:30,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 21:46:30,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 21:46:30,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 21:46:30,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 21:46:30,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 21:46:30,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 21:46:30,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 21:46:30,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 21:46:30,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 21:46:30,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 21:46:30,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 21:46:30,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 21:46:30,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 21:46:30,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 21:46:30,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 21:46:30,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 21:46:30,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 21:46:30,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 21:46:30,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 21:46:30,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 21:46:30,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 21:46:30,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 21:46:30,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 21:46:30,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 21:46:30,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 21:46:30,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 21:46:30,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 21:46:30,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 21:46:30,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 21:46:30,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 21:46:30,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 21:46:30,290 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 21:46:30,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 21:46:30,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 21:46:30,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 21:46:30,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 21:46:30,307 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 21:46:30,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 21:46:30,307 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 21:46:30,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 21:46:30,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 21:46:30,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 21:46:30,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 21:46:30,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 21:46:30,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 21:46:30,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 21:46:30,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 21:46:30,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 21:46:30,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 21:46:30,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 21:46:30,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 21:46:30,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 21:46:30,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 21:46:30,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 21:46:30,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 21:46:30,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 21:46:30,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 21:46:30,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 21:46:30,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 21:46:30,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 21:46:30,365 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 21:46:30,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd1.i [2019-10-01 21:46:30,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605ecd2a/1f347ac573fd4dc4becbffd988f5fe3c/FLAG85c7d23f0 [2019-10-01 21:46:30,953 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 21:46:30,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd1.i [2019-10-01 21:46:30,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605ecd2a/1f347ac573fd4dc4becbffd988f5fe3c/FLAG85c7d23f0 [2019-10-01 21:46:31,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605ecd2a/1f347ac573fd4dc4becbffd988f5fe3c [2019-10-01 21:46:31,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 21:46:31,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 21:46:31,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 21:46:31,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 21:46:31,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cca5a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31, skipping insertion in model container [2019-10-01 21:46:31,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,340 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 21:46:31,355 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 21:46:31,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,569 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 21:46:31,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,698 INFO L192 MainTranslator]: Completed translation [2019-10-01 21:46:31,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31 WrapperNode [2019-10-01 21:46:31,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 21:46:31,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 21:46:31,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 21:46:31,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 21:46:31,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 21:46:31,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (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 21:46:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 21:46:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 21:46:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2019-10-01 21:46:31,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 21:46:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 21:46:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 21:46:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2019-10-01 21:46:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 21:46:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 21:46:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 21:46:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 21:46:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 21:46:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 21:46:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 21:46:32,101 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 21:46:32,102 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 21:46:32,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32 BoogieIcfgContainer [2019-10-01 21:46:32,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 21:46:32,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 21:46:32,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 21:46:32,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 21:46:32,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 09:46:31" (1/3) ... [2019-10-01 21:46:32,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee75b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (2/3) ... [2019-10-01 21:46:32,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee75b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32" (3/3) ... [2019-10-01 21:46:32,132 INFO L109 eAbstractionObserver]: Analyzing ICFG bAnd1.i [2019-10-01 21:46:32,157 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 21:46:32,169 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 21:46:32,188 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 21:46:32,218 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 21:46:32,219 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 21:46:32,219 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 21:46:32,219 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 21:46:32,220 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 21:46:32,220 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 21:46:32,220 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 21:46:32,220 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 21:46:32,220 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 21:46:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 21:46:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,245 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,248 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-10-01 21:46:32,256 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:32,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 21:46:32,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 21:46:32,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 21:46:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:32,453 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 21:46:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,477 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 21:46:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 21:46:32,478 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 21:46:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,487 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:32,487 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 21:46:32,491 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 21:46:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 21:46:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 21:46:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 21:46:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 21:46:32,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 21:46:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,530 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 21:46:32,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 21:46:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 21:46:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,533 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,533 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-10-01 21:46:32,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:32,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:32,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:32,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:32,607 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 21:46:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,628 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 21:46:32,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 21:46:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,630 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,631 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 21:46:32,632 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 21:46:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 21:46:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 21:46:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 21:46:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 21:46:32,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 21:46:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,640 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 21:46:32,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 21:46:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 21:46:32,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,642 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:32,643 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-10-01 21:46:32,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 21:46:32,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:32,705 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:32,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 21:46:32,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 21:46:32,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 21:46:32,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 21:46:32,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 21:46:32,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 21:46:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:32,859 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 21:46:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,897 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 21:46:32,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 21:46:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,901 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,901 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 21:46:32,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 21:46:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 21:46:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 21:46:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 21:46:32,912 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 21:46:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,912 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 21:46:32,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 21:46:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 21:46:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 21:46:32,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,914 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:32,914 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-10-01 21:46:32,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:33,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:33,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:33,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:33,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:33,018 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 21:46:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,034 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 21:46:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:33,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 21:46:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,037 INFO L225 Difference]: With dead ends: 43 [2019-10-01 21:46:33,037 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 21:46:33,037 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 21:46:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 21:46:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 21:46:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 21:46:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 21:46:33,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 21:46:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,047 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 21:46:33,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 21:46:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 21:46:33,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,049 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:33,049 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-10-01 21:46:33,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,175 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) [2019-10-01 21:46:33,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 21:46:33,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 21:46:33,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 21:46:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,313 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 21:46:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,351 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 21:46:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 21:46:33,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 21:46:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,354 INFO L225 Difference]: With dead ends: 52 [2019-10-01 21:46:33,354 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 21:46:33,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 21:46:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 21:46:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 21:46:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 21:46:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 21:46:33,361 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 21:46:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,361 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 21:46:33,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 21:46:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 21:46:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 21:46:33,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,364 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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 21:46:33,365 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-10-01 21:46:33,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,491 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 21:46:33,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:33,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:33,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 21:46:33,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 21:46:33,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 21:46:33,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:33,598 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 21:46:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,635 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 21:46:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 21:46:33,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 21:46:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,636 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:33,637 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 21:46:33,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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 21:46:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 21:46:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 21:46:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 21:46:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 21:46:33,647 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 21:46:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,648 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 21:46:33,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 21:46:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 21:46:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 21:46:33,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,653 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] [2019-10-01 21:46:33,653 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,654 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2019-10-01 21:46:33,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,793 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:33,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 21:46:33,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 21:46:33,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 21:46:33,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:33,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:33,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:33,899 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 21:46:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,958 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 21:46:33,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 21:46:33,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 21:46:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,962 INFO L225 Difference]: With dead ends: 59 [2019-10-01 21:46:33,963 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 21:46:33,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 21:46:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 21:46:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 21:46:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 21:46:33,973 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 21:46:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,974 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 21:46:33,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 21:46:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 21:46:33,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,976 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 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] [2019-10-01 21:46:33,977 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2019-10-01 21:46:33,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,095 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 21:46:34,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:34,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:34,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 21:46:34,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:34,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,208 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 21:46:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,269 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 21:46:34,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 21:46:34,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 21:46:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,271 INFO L225 Difference]: With dead ends: 62 [2019-10-01 21:46:34,272 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 21:46:34,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 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 21:46:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 21:46:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 21:46:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 21:46:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 21:46:34,284 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 21:46:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,286 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 21:46:34,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 21:46:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 21:46:34,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,288 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2019-10-01 21:46:34,289 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2019-10-01 21:46:34,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,436 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) [2019-10-01 21:46:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,517 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 21:46:34,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:34,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 21:46:34,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,591 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 21:46:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,654 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 21:46:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 21:46:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,655 INFO L225 Difference]: With dead ends: 67 [2019-10-01 21:46:34,656 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 21:46:34,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 21:46:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 21:46:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 21:46:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 21:46:34,666 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 21:46:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,666 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 21:46:34,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 21:46:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 21:46:34,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,668 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 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] [2019-10-01 21:46:34,668 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2019-10-01 21:46:34,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 21:46:34,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,786 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 21:46:34,810 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:34,852 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 21:46:34,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 21:46:34,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 21:46:34,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,894 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 21:46:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,952 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 21:46:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 21:46:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,954 INFO L225 Difference]: With dead ends: 73 [2019-10-01 21:46:34,955 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 21:46:34,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 21:46:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 21:46:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 21:46:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 21:46:34,969 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 21:46:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,970 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 21:46:34,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 21:46:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 21:46:34,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,975 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,978 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2019-10-01 21:46:34,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,110 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 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 21:46:35,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 21:46:35,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:35,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,233 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 21:46:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,289 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 21:46:35,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 21:46:35,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 21:46:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,291 INFO L225 Difference]: With dead ends: 76 [2019-10-01 21:46:35,291 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 21:46:35,292 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 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 21:46:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 21:46:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 21:46:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 21:46:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 21:46:35,297 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 21:46:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,298 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 21:46:35,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 21:46:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 21:46:35,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,299 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,300 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2019-10-01 21:46:35,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,450 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:35,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:35,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 21:46:35,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 21:46:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 21:46:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:35,610 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 21:46:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,659 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 21:46:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:35,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 21:46:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,660 INFO L225 Difference]: With dead ends: 78 [2019-10-01 21:46:35,661 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 21:46:35,662 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 21:46:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 21:46:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 21:46:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 21:46:35,669 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 21:46:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,669 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 21:46:35,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 21:46:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 21:46:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 21:46:35,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,673 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,673 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2019-10-01 21:46:35,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,797 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 21:46:35,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 21:46:35,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 21:46:35,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 21:46:35,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 21:46:35,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 21:46:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:35,928 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 21:46:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,010 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 21:46:36,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 21:46:36,010 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 21:46:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,011 INFO L225 Difference]: With dead ends: 83 [2019-10-01 21:46:36,011 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 21:46:36,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 21:46:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 21:46:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 21:46:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 21:46:36,018 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 21:46:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,018 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 21:46:36,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 21:46:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 21:46:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 21:46:36,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,019 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 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] [2019-10-01 21:46:36,020 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2019-10-01 21:46:36,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 21:46:36,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,145 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 21:46:36,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:36,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:36,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 21:46:36,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 21:46:36,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:36,280 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 21:46:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,384 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 21:46:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:36,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 21:46:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,386 INFO L225 Difference]: With dead ends: 89 [2019-10-01 21:46:36,386 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 21:46:36,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 21:46:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 21:46:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 21:46:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 21:46:36,392 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 21:46:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,393 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 21:46:36,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 21:46:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 21:46:36,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,394 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 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] [2019-10-01 21:46:36,394 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2019-10-01 21:46:36,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 21:46:36,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,568 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 21:46:36,593 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:36,742 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 21:46:36,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-01 21:46:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 21:46:36,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,825 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 21:46:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,898 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 21:46:36,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:36,898 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 21:46:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,899 INFO L225 Difference]: With dead ends: 95 [2019-10-01 21:46:36,900 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 21:46:36,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 21:46:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 21:46:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 21:46:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 21:46:36,906 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 21:46:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,906 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 21:46:36,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 21:46:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 21:46:36,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,908 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 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] [2019-10-01 21:46:36,908 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2019-10-01 21:46:36,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 21:46:37,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,066 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 21:46:37,091 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:37,248 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 21:46:37,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:37,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 21:46:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 21:46:37,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,331 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 21:46:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,422 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 21:46:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:37,425 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 21:46:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,426 INFO L225 Difference]: With dead ends: 101 [2019-10-01 21:46:37,426 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 21:46:37,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 21:46:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 21:46:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 21:46:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 21:46:37,432 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 21:46:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,433 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 21:46:37,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 21:46:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 21:46:37,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,435 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:37,435 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2019-10-01 21:46:37,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,647 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 21:46:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 21:46:37,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:37,739 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 21:46:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,835 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 21:46:37,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 21:46:37,838 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 21:46:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,839 INFO L225 Difference]: With dead ends: 104 [2019-10-01 21:46:37,839 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 21:46:37,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 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 21:46:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 21:46:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 21:46:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 21:46:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 21:46:37,844 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 21:46:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,844 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 21:46:37,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 21:46:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 21:46:37,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,846 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:37,846 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2019-10-01 21:46:37,847 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:38,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,104 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:38,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:38,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:38,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 21:46:38,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 21:46:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 21:46:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:38,244 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 21:46:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,309 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 21:46:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:38,310 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 21:46:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,311 INFO L225 Difference]: With dead ends: 106 [2019-10-01 21:46:38,311 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 21:46:38,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 21:46:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 21:46:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 21:46:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 21:46:38,322 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 21:46:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,323 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 21:46:38,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 21:46:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 21:46:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 21:46:38,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,324 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,325 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2019-10-01 21:46:38,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:38,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,575 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 21:46:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:38,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 21:46:38,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 21:46:38,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 21:46:38,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:38,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:38,775 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 21:46:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,900 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 21:46:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 21:46:38,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 21:46:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,901 INFO L225 Difference]: With dead ends: 111 [2019-10-01 21:46:38,901 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 21:46:38,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 21:46:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 21:46:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 21:46:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 21:46:38,907 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 21:46:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,907 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 21:46:38,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:38,907 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 21:46:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 21:46:38,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,909 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,909 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2019-10-01 21:46:38,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:39,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,108 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 21:46:39,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:39,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:39,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:39,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:39,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:39,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 21:46:39,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 21:46:39,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 21:46:39,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:39,244 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 21:46:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,313 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 21:46:39,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:39,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 21:46:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,315 INFO L225 Difference]: With dead ends: 114 [2019-10-01 21:46:39,315 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 21:46:39,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 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 21:46:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 21:46:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 21:46:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 21:46:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 21:46:39,321 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 21:46:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,322 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 21:46:39,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 21:46:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 21:46:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 21:46:39,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,323 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:39,323 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2019-10-01 21:46:39,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:39,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:39,634 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:40,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 21:46:40,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:40,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:40,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-01 21:46:40,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 21:46:40,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 21:46:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 21:46:40,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:40,454 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 21:46:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,572 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 21:46:40,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 21:46:40,572 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 21:46:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,573 INFO L225 Difference]: With dead ends: 119 [2019-10-01 21:46:40,573 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 21:46:40,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 21:46:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 21:46:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 21:46:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 21:46:40,578 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 21:46:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,579 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 21:46:40,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 21:46:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 21:46:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 21:46:40,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,580 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:40,580 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2019-10-01 21:46:40,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 21:46:40,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,870 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 21:46:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:41,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 21:46:41,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:41,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 21:46:41,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 21:46:41,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:41,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:41,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:41,340 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 21:46:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,464 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 21:46:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 21:46:41,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 21:46:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,466 INFO L225 Difference]: With dead ends: 125 [2019-10-01 21:46:41,467 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 21:46:41,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 21:46:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 21:46:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 21:46:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 21:46:41,472 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 21:46:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,473 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 21:46:41,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 21:46:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 21:46:41,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,474 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,474 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2019-10-01 21:46:41,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,807 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 21:46:41,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:42,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 21:46:42,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 21:46:42,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 21:46:42,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:42,003 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 21:46:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,082 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 21:46:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 21:46:42,082 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 21:46:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,083 INFO L225 Difference]: With dead ends: 128 [2019-10-01 21:46:42,084 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 21:46:42,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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 21:46:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 21:46:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 21:46:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 21:46:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 21:46:42,091 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 21:46:42,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,092 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 21:46:42,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 21:46:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 21:46:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 21:46:42,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,093 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:42,094 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2019-10-01 21:46:42,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:42,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:42,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,432 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 21:46:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:42,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:42,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:42,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:42,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 21:46:42,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:42,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:42,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:42,567 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 21:46:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,643 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 21:46:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 21:46:42,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 21:46:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,645 INFO L225 Difference]: With dead ends: 130 [2019-10-01 21:46:42,646 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 21:46:42,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 21:46:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 21:46:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 21:46:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 21:46:42,654 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 21:46:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,654 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 21:46:42,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 21:46:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 21:46:42,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,656 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:42,656 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2019-10-01 21:46:42,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:43,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,017 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 21:46:43,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:43,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 21:46:43,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-01 21:46:43,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 21:46:43,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:43,251 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 21:46:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,373 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 21:46:43,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 21:46:43,374 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 21:46:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,375 INFO L225 Difference]: With dead ends: 135 [2019-10-01 21:46:43,375 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 21:46:43,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 21:46:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 21:46:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 21:46:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 21:46:43,380 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 21:46:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:43,380 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 21:46:43,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 21:46:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 21:46:43,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:43,382 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:43,382 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2019-10-01 21:46:43,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:43,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,736 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 21:46:43,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:43,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:43,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 21:46:43,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:43,911 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 21:46:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,995 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 21:46:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 21:46:43,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 21:46:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,997 INFO L225 Difference]: With dead ends: 138 [2019-10-01 21:46:43,997 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 21:46:43,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 21:46:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 21:46:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 21:46:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 21:46:44,003 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 21:46:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:44,003 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 21:46:44,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 21:46:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 21:46:44,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:44,004 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:44,005 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2019-10-01 21:46:44,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:44,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:44,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:44,340 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 21:46:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:46,964 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 21:46:46,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:46,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:46,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2019-10-01 21:46:47,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:47,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 33 [2019-10-01 21:46:47,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 21:46:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 21:46:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 21:46:47,120 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 33 states. [2019-10-01 21:46:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,304 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2019-10-01 21:46:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 21:46:47,305 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 132 [2019-10-01 21:46:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,306 INFO L225 Difference]: With dead ends: 143 [2019-10-01 21:46:47,306 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 21:46:47,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 21:46:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 21:46:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 21:46:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 21:46:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 21:46:47,313 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 21:46:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,313 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 21:46:47,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 21:46:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 21:46:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-01 21:46:47,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,315 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:47,315 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1800218015, now seen corresponding path program 24 times [2019-10-01 21:46:47,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-10-01 21:46:47,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:47,775 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 21:46:47,809 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:48,134 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 21:46:48,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:48,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 232 proven. 49 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2019-10-01 21:46:48,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2019-10-01 21:46:48,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 21:46:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 21:46:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:48,313 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 35 states. [2019-10-01 21:46:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:48,422 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-10-01 21:46:48,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:46:48,422 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2019-10-01 21:46:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:48,423 INFO L225 Difference]: With dead ends: 149 [2019-10-01 21:46:48,423 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 21:46:48,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 21:46:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-01 21:46:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 21:46:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-01 21:46:48,428 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 136 [2019-10-01 21:46:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:48,429 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-01 21:46:48,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 21:46:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-01 21:46:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 21:46:48,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:48,430 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:48,430 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2019-10-01 21:46:48,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:48,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:48,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:48,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:48,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:48,794 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 21:46:48,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:48,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 21:46:48,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 21:46:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 21:46:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 21:46:48,961 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-01 21:46:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:49,050 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 21:46:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 21:46:49,051 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-01 21:46:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:49,052 INFO L225 Difference]: With dead ends: 152 [2019-10-01 21:46:49,052 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 21:46:49,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 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 21:46:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 21:46:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 21:46:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 21:46:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 21:46:49,057 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-01 21:46:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:49,057 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 21:46:49,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 21:46:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 21:46:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 21:46:49,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:49,059 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:49,059 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2019-10-01 21:46:49,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:49,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:49,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:49,467 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 21:46:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:49,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:49,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:49,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:46:49,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:49,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:49,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 21:46:49,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:49,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:49,608 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 21:46:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:49,699 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 21:46:49,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 21:46:49,700 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 21:46:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:49,702 INFO L225 Difference]: With dead ends: 154 [2019-10-01 21:46:49,703 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 21:46:49,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 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 21:46:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 21:46:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 21:46:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 21:46:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 21:46:49,713 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 21:46:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:49,713 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 21:46:49,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 21:46:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 21:46:49,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:49,715 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:49,716 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2019-10-01 21:46:49,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:49,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:50,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:50,138 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 21:46:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:50,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 21:46:50,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:50,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:46:50,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:50,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:50,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-01 21:46:50,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 21:46:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 21:46:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:50,515 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-01 21:46:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:50,648 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-01 21:46:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 21:46:50,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-01 21:46:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:50,650 INFO L225 Difference]: With dead ends: 159 [2019-10-01 21:46:50,650 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 21:46:50,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 21:46:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-01 21:46:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 21:46:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-01 21:46:50,656 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-01 21:46:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:50,656 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-01 21:46:50,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 21:46:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-01 21:46:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 21:46:50,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:50,657 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:50,658 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2019-10-01 21:46:50,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:50,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 21:46:51,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:51,091 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 21:46:51,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:51,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:51,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:51,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:51,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-01 21:46:51,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:51,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-01 21:46:51,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 21:46:51,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 21:46:51,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:51,375 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-01 21:46:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:51,504 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-01 21:46:51,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:46:51,505 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-01 21:46:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:51,506 INFO L225 Difference]: With dead ends: 165 [2019-10-01 21:46:51,506 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 21:46:51,507 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 21:46:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 21:46:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 21:46:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-01 21:46:51,517 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-01 21:46:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:51,517 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-01 21:46:51,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 21:46:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-01 21:46:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 21:46:51,518 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:51,519 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:51,519 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2019-10-01 21:46:51,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:51,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 21:46:51,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:51,985 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:56,141 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 21:46:56,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:56,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:46:56,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-01 21:46:56,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:56,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 21:46:56,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:46:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:46:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:46:56,351 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-01 21:46:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:56,497 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-01 21:46:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:46:56,503 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-01 21:46:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:56,504 INFO L225 Difference]: With dead ends: 171 [2019-10-01 21:46:56,504 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 21:46:56,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:46:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 21:46:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-01 21:46:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 21:46:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-01 21:46:56,517 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-01 21:46:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:56,518 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-01 21:46:56,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:46:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-01 21:46:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 21:46:56,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:56,519 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:56,519 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2019-10-01 21:46:56,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:56,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:56,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 21:46:57,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:57,034 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:57,074 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:57,725 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 21:46:57,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:57,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:57,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-01 21:46:57,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:57,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-01 21:46:57,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:46:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:46:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:46:57,925 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-01 21:46:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:58,067 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-01 21:46:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:46:58,070 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-01 21:46:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:58,070 INFO L225 Difference]: With dead ends: 177 [2019-10-01 21:46:58,070 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 21:46:58,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:46:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 21:46:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-01 21:46:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 21:46:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 21:46:58,076 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-01 21:46:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:58,077 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 21:46:58,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:46:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 21:46:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 21:46:58,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:58,078 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:58,078 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:58,079 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2019-10-01 21:46:58,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:58,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:58,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:58,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:46:58,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:58,883 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:59,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 21:46:59,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:46:59,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:59,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 21:46:59,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 21:46:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 21:46:59,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:59,070 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-01 21:46:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:59,182 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-01 21:46:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:59,182 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-01 21:46:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:59,183 INFO L225 Difference]: With dead ends: 180 [2019-10-01 21:46:59,183 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 21:46:59,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:46:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 21:46:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 21:46:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 21:46:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 21:46:59,190 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-01 21:46:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:59,190 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 21:46:59,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 21:46:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 21:46:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 21:46:59,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:59,192 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:59,192 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2019-10-01 21:46:59,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:59,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:46:59,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:59,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:59,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:59,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:59,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:59,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 21:46:59,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:59,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:59,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 21:46:59,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 21:46:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 21:46:59,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:46:59,882 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 21:46:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:59,980 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 21:46:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:46:59,981 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 21:46:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:59,982 INFO L225 Difference]: With dead ends: 182 [2019-10-01 21:46:59,982 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 21:46:59,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:46:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 21:46:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 21:46:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 21:46:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 21:46:59,988 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 21:46:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:59,988 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 21:46:59,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 21:46:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 21:46:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 21:46:59,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:59,990 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:59,990 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2019-10-01 21:46:59,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:59,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:00,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:00,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:00,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 21:47:00,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:00,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:47:00,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2019-10-01 21:47:01,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-01 21:47:01,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 21:47:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 21:47:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:01,069 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-01 21:47:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:01,240 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-01 21:47:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 21:47:01,241 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-01 21:47:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:01,242 INFO L225 Difference]: With dead ends: 187 [2019-10-01 21:47:01,242 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 21:47:01,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 21:47:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-01 21:47:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 21:47:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-01 21:47:01,248 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-01 21:47:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:01,248 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-01 21:47:01,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 21:47:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-01 21:47:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 21:47:01,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:01,250 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:01,250 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2019-10-01 21:47:01,250 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:01,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:01,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-10-01 21:47:01,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:01,960 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:02,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:02,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:02,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:02,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:02,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:02,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:02,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 21:47:02,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:47:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:47:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:02,388 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-01 21:47:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:02,602 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-01 21:47:02,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:47:02,603 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-01 21:47:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:02,604 INFO L225 Difference]: With dead ends: 193 [2019-10-01 21:47:02,604 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 21:47:02,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 21:47:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 21:47:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 21:47:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-01 21:47:02,611 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-01 21:47:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:02,611 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-01 21:47:02,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:47:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-01 21:47:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 21:47:02,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:02,613 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:02,613 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2019-10-01 21:47:02,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:02,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:02,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-10-01 21:47:03,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:03,307 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:03,355 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:47:16,524 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 21:47:16,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:16,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:16,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-10-01 21:47:16,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-01 21:47:16,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 21:47:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 21:47:16,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:47:16,964 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-01 21:47:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:17,163 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-01 21:47:17,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 21:47:17,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-01 21:47:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:17,165 INFO L225 Difference]: With dead ends: 199 [2019-10-01 21:47:17,165 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 21:47:17,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:47:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 21:47:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-01 21:47:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 21:47:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-01 21:47:17,175 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-01 21:47:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:17,176 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-01 21:47:17,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 21:47:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-01 21:47:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 21:47:17,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:17,178 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:17,179 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2019-10-01 21:47:17,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:17,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:17,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:17,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:17,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-10-01 21:47:17,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:17,845 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:17,895 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:47:26,552 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 21:47:26,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:26,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:47:26,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-10-01 21:47:26,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:26,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 21:47:26,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 21:47:26,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 21:47:26,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:47:26,836 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-01 21:47:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:27,056 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-01 21:47:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 21:47:27,057 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-01 21:47:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:27,058 INFO L225 Difference]: With dead ends: 205 [2019-10-01 21:47:27,059 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 21:47:27,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:47:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 21:47:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-01 21:47:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 21:47:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-01 21:47:27,068 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-01 21:47:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:27,068 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-01 21:47:27,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 21:47:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-01 21:47:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 21:47:27,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:27,072 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:27,072 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2019-10-01 21:47:27,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:27,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:47:27,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:27,992 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:28,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:28,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 21:47:28,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:47:28,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:28,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 21:47:28,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 21:47:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 21:47:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:47:28,188 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-01 21:47:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:28,327 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-01 21:47:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:47:28,327 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-01 21:47:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:28,329 INFO L225 Difference]: With dead ends: 208 [2019-10-01 21:47:28,329 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 21:47:28,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:47:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 21:47:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 21:47:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 21:47:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 21:47:28,340 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-01 21:47:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:28,341 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 21:47:28,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 21:47:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 21:47:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 21:47:28,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:28,343 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:28,344 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2019-10-01 21:47:28,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:28,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:28,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:28,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:47:29,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:29,190 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:29,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:29,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:29,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:29,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 21:47:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:47:29,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:29,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 21:47:29,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:29,380 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 21:47:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:29,501 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 21:47:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:47:29,501 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-01 21:47:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:29,502 INFO L225 Difference]: With dead ends: 210 [2019-10-01 21:47:29,502 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 21:47:29,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 21:47:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 21:47:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 21:47:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 21:47:29,508 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-01 21:47:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:29,508 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 21:47:29,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 21:47:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 21:47:29,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:29,510 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:29,510 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2019-10-01 21:47:29,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:29,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:29,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:29,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:29,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:47:30,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:30,238 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:30,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:30,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 21:47:30,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:30,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:47:30,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2019-10-01 21:47:31,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:31,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 21:47:31,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 21:47:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 21:47:31,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:47:31,043 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-01 21:47:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:31,306 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2019-10-01 21:47:31,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 21:47:31,307 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-01 21:47:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:31,308 INFO L225 Difference]: With dead ends: 215 [2019-10-01 21:47:31,308 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 21:47:31,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:47:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 21:47:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-01 21:47:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 21:47:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-01 21:47:31,316 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-01 21:47:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:31,316 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-01 21:47:31,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 21:47:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-01 21:47:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 21:47:31,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:31,318 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:31,318 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:31,319 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2019-10-01 21:47:31,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:31,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:31,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:31,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:31,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:47:32,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:32,281 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:32,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:32,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:32,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:32,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 21:47:32,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:32,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:32,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 21:47:32,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 21:47:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 21:47:32,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:47:32,491 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2019-10-01 21:47:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:32,640 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2019-10-01 21:47:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:47:32,640 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2019-10-01 21:47:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:32,641 INFO L225 Difference]: With dead ends: 218 [2019-10-01 21:47:32,641 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 21:47:32,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:47:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 21:47:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-01 21:47:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 21:47:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 21:47:32,646 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-01 21:47:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:32,646 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 21:47:32,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 21:47:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 21:47:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 21:47:32,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:32,648 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:32,648 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2019-10-01 21:47:32,649 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:32,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:32,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:47:33,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:33,472 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:33,535 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:48:28,261 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 21:48:28,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:28,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:48:28,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2515 trivial. 0 not checked. [2019-10-01 21:48:28,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:28,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 16] total 58 [2019-10-01 21:48:28,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 21:48:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 21:48:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:48:28,663 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 58 states. [2019-10-01 21:48:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:28,852 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2019-10-01 21:48:28,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:48:28,853 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-10-01 21:48:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:28,854 INFO L225 Difference]: With dead ends: 223 [2019-10-01 21:48:28,854 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 21:48:28,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:48:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 21:48:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 21:48:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 21:48:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-01 21:48:28,862 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 214 [2019-10-01 21:48:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:28,863 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-01 21:48:28,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 21:48:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-01 21:48:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 21:48:28,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:28,864 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:28,865 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:28,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1200258067, now seen corresponding path program 42 times [2019-10-01 21:48:28,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:28,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:28,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:28,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:28,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 21:48:29,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:29,826 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:29,888 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:48:36,277 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 21:48:36,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:36,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:48:36,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2777 trivial. 0 not checked. [2019-10-01 21:48:36,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:36,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 14] total 57 [2019-10-01 21:48:36,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 21:48:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 21:48:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:48:36,623 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 57 states. [2019-10-01 21:48:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:36,901 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2019-10-01 21:48:36,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 21:48:36,901 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2019-10-01 21:48:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:36,903 INFO L225 Difference]: With dead ends: 229 [2019-10-01 21:48:36,903 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 21:48:36,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:48:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 21:48:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-01 21:48:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 21:48:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-01 21:48:36,909 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 222 [2019-10-01 21:48:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:36,909 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-01 21:48:36,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 21:48:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-01 21:48:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-01 21:48:36,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:36,911 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:36,911 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:36,911 INFO L82 PathProgramCache]: Analyzing trace with hash 320829261, now seen corresponding path program 43 times [2019-10-01 21:48:36,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:36,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:36,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:48:37,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:37,851 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:37,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:38,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 21:48:38,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:48:38,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:38,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 21:48:38,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 21:48:38,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 21:48:38,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 21:48:38,058 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 47 states. [2019-10-01 21:48:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:38,227 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2019-10-01 21:48:38,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 21:48:38,231 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 226 [2019-10-01 21:48:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:38,233 INFO L225 Difference]: With dead ends: 232 [2019-10-01 21:48:38,233 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 21:48:38,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 21:48:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 21:48:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-01 21:48:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 21:48:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 21:48:38,239 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 226 [2019-10-01 21:48:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:38,240 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 21:48:38,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 21:48:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 21:48:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 21:48:38,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:38,242 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:38,242 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1514417361, now seen corresponding path program 44 times [2019-10-01 21:48:38,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:38,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:48:39,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:39,321 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:48:39,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:48:39,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:39,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 21:48:39,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:48:39,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:39,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 21:48:39,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:48:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:48:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:48:39,570 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 21:48:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:39,732 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 21:48:39,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 21:48:39,732 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 21:48:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:39,733 INFO L225 Difference]: With dead ends: 234 [2019-10-01 21:48:39,733 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 21:48:39,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:48:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 21:48:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 21:48:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 21:48:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 21:48:39,737 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 21:48:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:39,738 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 21:48:39,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:48:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 21:48:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 21:48:39,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:39,740 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:39,740 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash 45137553, now seen corresponding path program 45 times [2019-10-01 21:48:39,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:39,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:39,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:39,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:39,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:48:40,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:40,852 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:40,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:48:41,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 21:48:41,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:41,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:48:41,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:48:41,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:41,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 15] total 61 [2019-10-01 21:48:41,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 21:48:41,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 21:48:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:48:41,842 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 61 states. [2019-10-01 21:48:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:42,112 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2019-10-01 21:48:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 21:48:42,117 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 230 [2019-10-01 21:48:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:42,119 INFO L225 Difference]: With dead ends: 239 [2019-10-01 21:48:42,119 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 21:48:42,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:48:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 21:48:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-10-01 21:48:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 21:48:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-10-01 21:48:42,125 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 230 [2019-10-01 21:48:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:42,125 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-10-01 21:48:42,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 21:48:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-10-01 21:48:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-01 21:48:42,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:42,127 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:42,127 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1593644785, now seen corresponding path program 46 times [2019-10-01 21:48:42,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:42,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:42,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:42,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:42,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:48:43,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:43,128 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:43,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:48:43,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:48:43,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:43,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 21:48:43,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:48:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 21:48:43,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 21:48:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 21:48:43,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:48:43,371 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 50 states. [2019-10-01 21:48:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:43,567 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 21:48:43,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 21:48:43,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 234 [2019-10-01 21:48:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:43,569 INFO L225 Difference]: With dead ends: 242 [2019-10-01 21:48:43,569 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 21:48:43,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:48:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 21:48:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 21:48:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 21:48:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 21:48:43,578 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 234 [2019-10-01 21:48:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:43,578 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 21:48:43,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 21:48:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 21:48:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 21:48:43,581 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:43,581 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:43,581 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash -847744813, now seen corresponding path program 47 times [2019-10-01 21:48:43,582 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:43,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:43,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:48:44,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:44,565 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:44,640 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:50:49,747 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 21:50:49,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:49,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:50:49,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3201 trivial. 0 not checked. [2019-10-01 21:50:50,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:50,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 17] total 65 [2019-10-01 21:50:50,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 21:50:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 21:50:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:50:50,237 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 65 states. [2019-10-01 21:50:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:50,579 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2019-10-01 21:50:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 21:50:50,580 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 236 [2019-10-01 21:50:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:50,582 INFO L225 Difference]: With dead ends: 247 [2019-10-01 21:50:50,582 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 21:50:50,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:50:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 21:50:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-10-01 21:50:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-01 21:50:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2019-10-01 21:50:50,592 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 236 [2019-10-01 21:50:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:50,593 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2019-10-01 21:50:50,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 21:50:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2019-10-01 21:50:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-01 21:50:50,597 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:50,597 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:50,597 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:50,598 INFO L82 PathProgramCache]: Analyzing trace with hash -96970445, now seen corresponding path program 48 times [2019-10-01 21:50:50,598 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:50,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:50,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:50,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 21:50:51,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:51,767 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:51,843 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:51:03,708 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 21:51:03,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:03,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:51:03,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2019-10-01 21:51:04,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:04,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 16] total 65 [2019-10-01 21:51:04,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 21:51:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 21:51:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:51:04,106 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 65 states. [2019-10-01 21:51:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:04,469 INFO L93 Difference]: Finished difference Result 253 states and 262 transitions. [2019-10-01 21:51:04,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 21:51:04,470 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 244 [2019-10-01 21:51:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:04,471 INFO L225 Difference]: With dead ends: 253 [2019-10-01 21:51:04,471 INFO L226 Difference]: Without dead ends: 181 [2019-10-01 21:51:04,472 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:51:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-01 21:51:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-10-01 21:51:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-01 21:51:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-10-01 21:51:04,478 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 244 [2019-10-01 21:51:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:04,479 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-10-01 21:51:04,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 21:51:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-10-01 21:51:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-01 21:51:04,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:04,480 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:04,481 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:04,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1392071277, now seen corresponding path program 49 times [2019-10-01 21:51:04,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:04,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:04,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:06,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:06,384 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:06,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:51:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:06,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 21:51:06,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:51:06,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:06,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 21:51:06,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 21:51:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 21:51:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 21:51:06,626 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 53 states. [2019-10-01 21:51:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:06,803 INFO L93 Difference]: Finished difference Result 256 states and 264 transitions. [2019-10-01 21:51:06,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 21:51:06,803 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 248 [2019-10-01 21:51:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:06,805 INFO L225 Difference]: With dead ends: 256 [2019-10-01 21:51:06,805 INFO L226 Difference]: Without dead ends: 182 [2019-10-01 21:51:06,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 21:51:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-01 21:51:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-10-01 21:51:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 21:51:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 21:51:06,816 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 248 [2019-10-01 21:51:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:06,816 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 21:51:06,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 21:51:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 21:51:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 21:51:06,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:06,819 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:06,819 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1139151861, now seen corresponding path program 50 times [2019-10-01 21:51:06,819 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:06,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:06,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:51:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:07,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:07,981 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:08,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:51:08,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:51:08,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:08,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 21:51:08,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:08,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:08,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 21:51:08,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:51:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:51:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:51:08,222 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 21:51:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:08,432 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 21:51:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 21:51:08,432 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 21:51:08,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:08,433 INFO L225 Difference]: With dead ends: 258 [2019-10-01 21:51:08,433 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 21:51:08,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:51:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 21:51:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 21:51:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 21:51:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 21:51:08,439 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 21:51:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:08,439 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 21:51:08,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:51:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 21:51:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 21:51:08,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:08,441 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:08,441 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1601869353, now seen corresponding path program 51 times [2019-10-01 21:51:08,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:08,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:08,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:09,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:09,619 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:09,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:51:10,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 21:51:10,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:10,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:51:10,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3761 trivial. 0 not checked. [2019-10-01 21:51:10,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:10,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 17] total 69 [2019-10-01 21:51:10,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 21:51:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 21:51:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 21:51:10,874 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 69 states. [2019-10-01 21:51:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:11,224 INFO L93 Difference]: Finished difference Result 263 states and 272 transitions. [2019-10-01 21:51:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-01 21:51:11,225 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 252 [2019-10-01 21:51:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:11,225 INFO L225 Difference]: With dead ends: 263 [2019-10-01 21:51:11,226 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 21:51:11,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 21:51:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 21:51:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2019-10-01 21:51:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 21:51:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-10-01 21:51:11,232 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 252 [2019-10-01 21:51:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:11,232 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-10-01 21:51:11,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 21:51:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-10-01 21:51:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-01 21:51:11,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:11,234 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:11,234 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -121232585, now seen corresponding path program 52 times [2019-10-01 21:51:11,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:11,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:11,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:11,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:11,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:12,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:12,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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:12,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:51:12,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:51:12,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:12,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 21:51:12,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:12,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:12,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 21:51:12,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 21:51:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 21:51:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 21:51:12,654 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 56 states. [2019-10-01 21:51:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:12,875 INFO L93 Difference]: Finished difference Result 266 states and 274 transitions. [2019-10-01 21:51:12,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 21:51:12,876 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 256 [2019-10-01 21:51:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:12,877 INFO L225 Difference]: With dead ends: 266 [2019-10-01 21:51:12,877 INFO L226 Difference]: Without dead ends: 190 [2019-10-01 21:51:12,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 21:51:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-01 21:51:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-10-01 21:51:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 21:51:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 21:51:12,882 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 256 [2019-10-01 21:51:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:12,883 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 21:51:12,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 21:51:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 21:51:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 21:51:12,884 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:12,885 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:12,885 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1192363929, now seen corresponding path program 53 times [2019-10-01 21:51:12,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:12,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:14,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:14,095 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:14,185 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:53:55,826 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 21:53:55,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:53:55,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:53:55,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:53:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 3975 trivial. 0 not checked. [2019-10-01 21:53:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:53:56,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 18] total 72 [2019-10-01 21:53:56,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-01 21:53:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-01 21:53:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 21:53:56,360 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 72 states. [2019-10-01 21:53:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:53:56,676 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2019-10-01 21:53:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 21:53:56,680 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 258 [2019-10-01 21:53:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:53:56,682 INFO L225 Difference]: With dead ends: 271 [2019-10-01 21:53:56,682 INFO L226 Difference]: Without dead ends: 195 [2019-10-01 21:53:56,683 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 21:53:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-01 21:53:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-10-01 21:53:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-01 21:53:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 197 transitions. [2019-10-01 21:53:56,688 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 197 transitions. Word has length 258 [2019-10-01 21:53:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:53:56,688 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 197 transitions. [2019-10-01 21:53:56,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-01 21:53:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2019-10-01 21:53:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-01 21:53:56,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:53:56,690 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:53:56,690 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:53:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:53:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1802007559, now seen corresponding path program 54 times [2019-10-01 21:53:56,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:53:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:53:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:56,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:53:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:53:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 21:53:58,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:53:58,242 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:53:58,334 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:54:27,469 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 21:54:27,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:27,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:54:27,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 1205 proven. 225 refuted. 0 times theorem prover too weak. 4126 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:54:28,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:28,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 20] total 75 [2019-10-01 21:54:28,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 21:54:28,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 21:54:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1863, Invalid=3687, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 21:54:28,104 INFO L87 Difference]: Start difference. First operand 193 states and 197 transitions. Second operand 75 states. [2019-10-01 21:54:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:29,734 INFO L93 Difference]: Finished difference Result 278 states and 288 transitions. [2019-10-01 21:54:29,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-01 21:54:29,735 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 266 [2019-10-01 21:54:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:29,736 INFO L225 Difference]: With dead ends: 278 [2019-10-01 21:54:29,737 INFO L226 Difference]: Without dead ends: 200 [2019-10-01 21:54:29,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2167, Invalid=6023, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 21:54:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-01 21:54:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-10-01 21:54:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 21:54:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 21:54:29,747 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 266 [2019-10-01 21:54:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:29,748 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 21:54:29,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 21:54:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 21:54:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 21:54:29,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:29,751 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:29,752 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash -513174981, now seen corresponding path program 55 times [2019-10-01 21:54:29,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:29,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:31,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:31,774 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:54:31,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:54:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:31,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 21:54:31,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 21:54:32,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 21:54:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 21:54:32,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:54:32,021 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 60 states. [2019-10-01 21:54:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:32,265 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2019-10-01 21:54:32,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 21:54:32,267 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 272 [2019-10-01 21:54:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:32,269 INFO L225 Difference]: With dead ends: 282 [2019-10-01 21:54:32,269 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 21:54:32,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:54:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 21:54:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 21:54:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 21:54:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 21:54:32,275 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 272 [2019-10-01 21:54:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:32,275 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 21:54:32,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 21:54:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 21:54:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 21:54:32,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:32,277 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:32,277 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:32,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:32,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1685353117, now seen corresponding path program 56 times [2019-10-01 21:54:32,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:32,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:32,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:54:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:33,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:33,857 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:54:33,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:54:34,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:54:34,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:34,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 21:54:34,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:34,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:34,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 21:54:34,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 21:54:34,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 21:54:34,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:54:34,146 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 61 states. [2019-10-01 21:54:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:34,350 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-10-01 21:54:34,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 21:54:34,351 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 274 [2019-10-01 21:54:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:34,352 INFO L225 Difference]: With dead ends: 284 [2019-10-01 21:54:34,352 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 21:54:34,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:54:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 21:54:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 21:54:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 21:54:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 21:54:34,361 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 274 [2019-10-01 21:54:34,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:34,361 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 21:54:34,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 21:54:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 21:54:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 21:54:34,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:34,363 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:34,363 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1346945663, now seen corresponding path program 57 times [2019-10-01 21:54:34,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:34,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:34,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:35,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:35,793 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:54:35,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:54:37,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 21:54:37,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:37,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:54:37,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2019-10-01 21:54:38,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:38,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 19] total 78 [2019-10-01 21:54:38,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-01 21:54:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-01 21:54:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=4006, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 21:54:38,059 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 78 states. [2019-10-01 21:54:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:38,457 INFO L93 Difference]: Finished difference Result 289 states and 301 transitions. [2019-10-01 21:54:38,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-01 21:54:38,457 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 276 [2019-10-01 21:54:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:38,459 INFO L225 Difference]: With dead ends: 289 [2019-10-01 21:54:38,459 INFO L226 Difference]: Without dead ends: 209 [2019-10-01 21:54:38,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2000, Invalid=4006, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 21:54:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-01 21:54:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-10-01 21:54:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-01 21:54:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2019-10-01 21:54:38,465 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 276 [2019-10-01 21:54:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:38,466 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2019-10-01 21:54:38,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-01 21:54:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2019-10-01 21:54:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-01 21:54:38,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:38,468 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:38,469 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1886024481, now seen corresponding path program 58 times [2019-10-01 21:54:38,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:38,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6455 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 21:54:39,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:39,900 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:54:40,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:54:40,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:54:40,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:40,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:54:40,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6455 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 4934 trivial. 0 not checked. [2019-10-01 21:54:40,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:40,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 20] total 80 [2019-10-01 21:54:40,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 21:54:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 21:54:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 21:54:40,732 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand 80 states. [2019-10-01 21:54:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:41,124 INFO L93 Difference]: Finished difference Result 295 states and 307 transitions. [2019-10-01 21:54:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-01 21:54:41,124 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 284 [2019-10-01 21:54:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:41,126 INFO L225 Difference]: With dead ends: 295 [2019-10-01 21:54:41,126 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 21:54:41,127 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 21:54:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 21:54:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-01 21:54:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-01 21:54:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2019-10-01 21:54:41,133 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 284 [2019-10-01 21:54:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:41,133 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2019-10-01 21:54:41,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 21:54:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2019-10-01 21:54:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-01 21:54:41,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:41,136 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:41,136 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:41,136 INFO L82 PathProgramCache]: Analyzing trace with hash -805548737, now seen corresponding path program 59 times [2019-10-01 21:54:41,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:41,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:41,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 21:54:42,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:42,681 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:54:42,795 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:57:46,314 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-10-01 21:57:46,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:57:46,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:57:46,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:57:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5199 trivial. 0 not checked. [2019-10-01 21:57:47,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:57:47,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 21] total 82 [2019-10-01 21:57:47,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 21:57:47,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 21:57:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2162, Invalid=4480, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 21:57:47,028 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 82 states. [2019-10-01 21:57:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:57:47,468 INFO L93 Difference]: Finished difference Result 301 states and 313 transitions. [2019-10-01 21:57:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 21:57:47,469 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 292 [2019-10-01 21:57:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:57:47,470 INFO L225 Difference]: With dead ends: 301 [2019-10-01 21:57:47,471 INFO L226 Difference]: Without dead ends: 217 [2019-10-01 21:57:47,472 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2162, Invalid=4480, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 21:57:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-01 21:57:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-01 21:57:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-01 21:57:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-10-01 21:57:47,478 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 292 [2019-10-01 21:57:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:57:47,478 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-10-01 21:57:47,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 21:57:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-10-01 21:57:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-01 21:57:47,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:57:47,480 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:57:47,480 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:57:47,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:57:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1036647521, now seen corresponding path program 60 times [2019-10-01 21:57:47,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:57:47,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:57:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:57:47,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:57:47,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:57:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:57:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7355 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 21:57:49,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:57:49,027 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:57:49,143 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:59:35,297 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 21:59:35,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:59:35,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 21:59:35,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7355 backedges. 1651 proven. 256 refuted. 0 times theorem prover too weak. 5448 trivial. 0 not checked. [2019-10-01 21:59:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 21] total 83 [2019-10-01 21:59:36,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 21:59:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 21:59:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2315, Invalid=4491, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 21:59:36,024 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 83 states. [2019-10-01 21:59:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:37,203 INFO L93 Difference]: Finished difference Result 308 states and 318 transitions. [2019-10-01 21:59:37,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 21:59:37,204 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 300 [2019-10-01 21:59:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:37,205 INFO L225 Difference]: With dead ends: 308 [2019-10-01 21:59:37,205 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 21:59:37,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2655, Invalid=7245, Unknown=0, NotChecked=0, Total=9900 [2019-10-01 21:59:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 21:59:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-10-01 21:59:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 21:59:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 21:59:37,213 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 300 [2019-10-01 21:59:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:37,213 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 21:59:37,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 21:59:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 21:59:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 21:59:37,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:37,216 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:37,216 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:37,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1467615391, now seen corresponding path program 61 times [2019-10-01 21:59:37,217 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:37,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:37,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:37,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:37,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:59:38,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:38,857 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:38,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:59:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:39,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 21:59:39,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:59:39,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:39,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 21:59:39,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 21:59:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 21:59:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 21:59:39,171 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 21:59:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:39,472 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 21:59:39,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:59:39,473 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 21:59:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:39,474 INFO L225 Difference]: With dead ends: 312 [2019-10-01 21:59:39,474 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 21:59:39,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 21:59:39,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 21:59:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 21:59:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 21:59:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 21:59:39,480 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 21:59:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:39,481 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 21:59:39,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 21:59:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 21:59:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 21:59:39,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:39,483 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:39,483 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:39,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:39,483 INFO L82 PathProgramCache]: Analyzing trace with hash -271433917, now seen corresponding path program 62 times [2019-10-01 21:59:39,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:39,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:39,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:59:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:59:41,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:41,261 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:41,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:59:41,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:59:41,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:59:41,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 21:59:41,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:59:41,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:41,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 21:59:41,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 21:59:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 21:59:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 21:59:41,602 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 68 states. [2019-10-01 21:59:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:41,845 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2019-10-01 21:59:41,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 21:59:41,846 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 308 [2019-10-01 21:59:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:41,847 INFO L225 Difference]: With dead ends: 314 [2019-10-01 21:59:41,847 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 21:59:41,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 21:59:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 21:59:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-01 21:59:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 21:59:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 21:59:41,853 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 308 [2019-10-01 21:59:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:41,853 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 21:59:41,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 21:59:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 21:59:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 21:59:41,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:41,855 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:41,855 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:41,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1792272731, now seen corresponding path program 63 times [2019-10-01 21:59:41,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:41,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:41,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:41,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:59:43,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:43,606 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:43,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:59:45,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 21:59:45,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:59:45,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:59:45,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 6073 trivial. 0 not checked. [2019-10-01 21:59:46,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:46,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 20] total 86 [2019-10-01 21:59:46,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 21:59:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 21:59:46,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 21:59:46,739 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 86 states. [2019-10-01 21:59:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:47,165 INFO L93 Difference]: Finished difference Result 319 states and 328 transitions. [2019-10-01 21:59:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-01 21:59:47,165 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 310 [2019-10-01 21:59:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:47,166 INFO L225 Difference]: With dead ends: 319 [2019-10-01 21:59:47,166 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 21:59:47,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 21:59:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 21:59:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-10-01 21:59:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 21:59:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 21:59:47,173 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 310 [2019-10-01 21:59:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:47,173 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 21:59:47,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 21:59:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 21:59:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-01 21:59:47,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:47,176 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 57, 57, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:47,176 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:47,177 INFO L82 PathProgramCache]: Analyzing trace with hash 809391621, now seen corresponding path program 64 times [2019-10-01 21:59:47,177 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:47,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:47,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:47,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 21:59:48,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:48,981 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:49,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:59:49,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:59:49,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:59:49,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:59:49,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 6169 trivial. 0 not checked. [2019-10-01 21:59:49,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:49,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 22] total 89 [2019-10-01 21:59:49,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 21:59:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 21:59:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 21:59:49,976 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 89 states. [2019-10-01 21:59:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:50,383 INFO L93 Difference]: Finished difference Result 325 states and 337 transitions. [2019-10-01 21:59:50,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-01 21:59:50,383 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 314 [2019-10-01 21:59:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:50,384 INFO L225 Difference]: With dead ends: 325 [2019-10-01 21:59:50,385 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 21:59:50,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 21:59:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 21:59:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-01 21:59:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 21:59:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2019-10-01 21:59:50,391 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 314 [2019-10-01 21:59:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:50,391 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2019-10-01 21:59:50,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 21:59:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2019-10-01 21:59:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-01 21:59:50,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:50,394 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 60, 60, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:50,394 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash -564254619, now seen corresponding path program 65 times [2019-10-01 21:59:50,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:50,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:50,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8548 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 21:59:52,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:52,225 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:52,355 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1