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/xor2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:00:47,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:00:47,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:00:47,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:00:47,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:00:47,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:00:47,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:00:47,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:00:47,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:00:47,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:00:47,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:00:47,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:00:47,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:00:47,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:00:47,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:00:47,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:00:47,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:00:47,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:00:47,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:00:47,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:00:47,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:00:47,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:00:47,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:00:47,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:00:47,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:00:47,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:00:47,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:00:47,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:00:47,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:00:47,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:00:47,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:00:47,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:00:47,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:00:47,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:00:47,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:00:47,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:00:47,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:00:47,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:00:47,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:00:47,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:00:47,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:00:47,254 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 22:00:47,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:00:47,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:00:47,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:00:47,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:00:47,270 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:00:47,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:00:47,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:00:47,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:00:47,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:00:47,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:00:47,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:00:47,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:00:47,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:00:47,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:00:47,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:00:47,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:00:47,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:00:47,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:00:47,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:00:47,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:00:47,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:00:47,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:47,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:00:47,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:00:47,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:00:47,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:00:47,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:00:47,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:00:47,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:00:47,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:00:47,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:00:47,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:00:47,319 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:00:47,320 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:00:47,320 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor2.i [2019-10-01 22:00:47,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42f79348/13338e53aad34dfca35cd74bb1950a2f/FLAGda07e81cb [2019-10-01 22:00:47,844 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:00:47,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor2.i [2019-10-01 22:00:47,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42f79348/13338e53aad34dfca35cd74bb1950a2f/FLAGda07e81cb [2019-10-01 22:00:48,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42f79348/13338e53aad34dfca35cd74bb1950a2f [2019-10-01 22:00:48,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:00:48,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:00:48,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:48,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:00:48,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:00:48,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3a515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48, skipping insertion in model container [2019-10-01 22:00:48,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,242 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:00:48,261 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:00:48,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:48,480 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:00:48,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:48,616 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:00:48,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48 WrapperNode [2019-10-01 22:00:48,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:48,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:00:48,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:00:48,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:00:48,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (1/1) ... [2019-10-01 22:00:48,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:00:48,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:00:48,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:00:48,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:00:48,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (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 22:00:48,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:00:48,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:00:48,726 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2019-10-01 22:00:48,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:00:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:00:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:00:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2019-10-01 22:00:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:00:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:00:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:00:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:00:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:00:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:00:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:00:49,031 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:00:49,032 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:00:49,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:49 BoogieIcfgContainer [2019-10-01 22:00:49,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:00:49,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:00:49,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:00:49,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:00:49,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:00:48" (1/3) ... [2019-10-01 22:00:49,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35eda00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:49, skipping insertion in model container [2019-10-01 22:00:49,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:48" (2/3) ... [2019-10-01 22:00:49,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35eda00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:49, skipping insertion in model container [2019-10-01 22:00:49,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:49" (3/3) ... [2019-10-01 22:00:49,058 INFO L109 eAbstractionObserver]: Analyzing ICFG xor2.i [2019-10-01 22:00:49,070 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:00:49,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:00:49,095 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:00:49,129 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:00:49,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:00:49,130 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:00:49,130 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:00:49,130 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:00:49,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:00:49,130 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:00:49,130 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:00:49,130 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:00:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:00:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:49,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,151 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 22:00:49,153 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2019-10-01 22:00:49,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,305 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 22:00:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:00:49,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:00:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:00:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:49,331 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:00:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,368 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 22:00:49,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:00:49,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 22:00:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,382 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:49,382 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:00:49,394 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 22:00:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:00:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:00:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:00:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 22:00:49,456 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 22:00:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,458 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 22:00:49,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:00:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 22:00:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:49,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,464 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 22:00:49,465 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2019-10-01 22:00:49,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,594 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 22:00:49,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:49,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:49,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:49,599 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 22:00:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,639 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:00:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:49,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 22:00:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,641 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:49,641 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:00:49,644 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 22:00:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:00:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:00:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:00:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 22:00:49,653 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 22:00:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,653 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 22:00:49,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 22:00:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:00:49,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,655 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 22:00:49,655 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2019-10-01 22:00:49,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,721 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 22:00:49,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,721 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream Closed [2019-10-01 22:00:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:00:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 22:00:49,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:00:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:00:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:49,885 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 22:00:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,917 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:00:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:49,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 22:00:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,920 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:49,920 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:00:49,921 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 22:00:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:00:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 22:00:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:00:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:00:49,931 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 22:00:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,931 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:00:49,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:00:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:00:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 22:00:49,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,936 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 22:00:49,936 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2019-10-01 22:00:49,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,022 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 22:00:50,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:50,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:50,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:50,024 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 22:00:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,040 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 22:00:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:50,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 22:00:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,045 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:00:50,046 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:00:50,046 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 22:00:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:00:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 22:00:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:00:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 22:00:50,053 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 22:00:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,055 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 22:00:50,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 22:00:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:00:50,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,057 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 22:00:50,057 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2019-10-01 22:00:50,058 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:50,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,155 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 22:00:50,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,156 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,267 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 22:00:50,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:00:50,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:00:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:00:50,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:50,272 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 22:00:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,306 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 22:00:50,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:00:50,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 22:00:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,310 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:00:50,310 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 22:00:50,311 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 22:00:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 22:00:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 22:00:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:00:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 22:00:50,317 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 22:00:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,317 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 22:00:50,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:00:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 22:00:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:00:50,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,319 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 22:00:50,319 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2019-10-01 22:00:50,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,424 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 22:00:50,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,425 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 22:00:50,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:50,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:50,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,506 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 22:00:50,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:00:50,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:00:50,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:00:50,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:50,512 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 22:00:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,544 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 22:00:50,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:00:50,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 22:00:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,546 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:50,546 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:00:50,547 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 22:00:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:00:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 22:00:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 22:00:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 22:00:50,553 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 22:00:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,553 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 22:00:50,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:00:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 22:00:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:00:50,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,554 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 22:00:50,555 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2019-10-01 22:00:50,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,642 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 22:00:50,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,643 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 22:00:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:50,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 22:00:50,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,721 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 22:00:50,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:00:50,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:50,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:50,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:50,729 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 22:00:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,781 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 22:00:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:00:50,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 22:00:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,783 INFO L225 Difference]: With dead ends: 59 [2019-10-01 22:00:50,784 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:00:50,784 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 22:00:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:00:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:00:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:00:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 22:00:50,790 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 22:00:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,790 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 22:00:50,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 22:00:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:00:50,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,792 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 22:00:50,792 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2019-10-01 22:00:50,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,883 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 22:00:50,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,884 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:50,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:50,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,992 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 22:00:51,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:00:51,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:51,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:51,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:51,007 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 22:00:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,045 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:00:51,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:00:51,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 22:00:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,048 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:00:51,048 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:00:51,049 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 22:00:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:00:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 22:00:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 22:00:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 22:00:51,055 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 22:00:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,055 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 22:00:51,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 22:00:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 22:00:51,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,057 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 22:00:51,057 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash -170213137, now seen corresponding path program 5 times [2019-10-01 22:00:51,058 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,151 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 22:00:51,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,151 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,177 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:51,224 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:00:51,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:51,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 22:00:51,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:00:51,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:51,280 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 22:00:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,353 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 22:00:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:51,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 22:00:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,358 INFO L225 Difference]: With dead ends: 67 [2019-10-01 22:00:51,358 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:00:51,359 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 22:00:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:00:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 22:00:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:00:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 22:00:51,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 22:00:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,365 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 22:00:51,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 22:00:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 22:00:51,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,366 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 22:00:51,367 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,367 INFO L82 PathProgramCache]: Analyzing trace with hash 778875311, now seen corresponding path program 6 times [2019-10-01 22:00:51,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,488 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 22:00:51,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,489 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:51,519 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,565 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 22:00:51,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:51,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream Closed [2019-10-01 22:00:51,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 22:00:51,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:51,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:51,611 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 22:00:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,671 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 22:00:51,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:51,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 22:00:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,673 INFO L225 Difference]: With dead ends: 73 [2019-10-01 22:00:51,673 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:00:51,674 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 22:00:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:00:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:00:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:00:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 22:00:51,683 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 22:00:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,685 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 22:00:51,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 22:00:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 22:00:51,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,687 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 22:00:51,690 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash -122717169, now seen corresponding path program 7 times [2019-10-01 22:00:51,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,806 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 22:00:51,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,806 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 22:00:51,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,894 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 22:00:51,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:00:51,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:51,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:51,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:51,909 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 22:00:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,961 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 22:00:51,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:00:51,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 22:00:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,962 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:00:51,962 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:00:51,963 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 22:00:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:00:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 22:00:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 22:00:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 22:00:51,976 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 22:00:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,977 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 22:00:51,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 22:00:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:00:51,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,980 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 22:00:51,980 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1588760433, now seen corresponding path program 8 times [2019-10-01 22:00:51,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,108 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 22:00:52,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,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 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 22:00:52,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:52,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:52,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,193 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 22:00:52,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:00:52,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:00:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:00:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:52,204 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 22:00:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,257 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 22:00:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:52,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 22:00:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,259 INFO L225 Difference]: With dead ends: 78 [2019-10-01 22:00:52,259 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 22:00:52,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 22:00:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 22:00:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:00:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 22:00:52,265 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 22:00:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,266 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 22:00:52,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:00:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 22:00:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:00:52,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,267 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 22:00:52,268 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1346261587, now seen corresponding path program 9 times [2019-10-01 22:00:52,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,406 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 22:00:52,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,407 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:52,443 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 22:00:52,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:00:52,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,531 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 22:00:52,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 22:00:52,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:00:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:00:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:52,537 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 22:00:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,602 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 22:00:52,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:00:52,603 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:00:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,603 INFO L225 Difference]: With dead ends: 83 [2019-10-01 22:00:52,604 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:00:52,604 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 22:00:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:00:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 22:00:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 22:00:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 22:00:52,609 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 22:00:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,610 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 22:00:52,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:00:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 22:00:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 22:00:52,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,611 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 22:00:52,611 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2116910669, now seen corresponding path program 10 times [2019-10-01 22:00:52,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,725 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 22:00:52,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,725 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 22:00:52,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:52,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:52,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,841 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 22:00:52,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 22:00:52,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:52,846 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 22:00:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,919 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 22:00:52,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:52,919 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 22:00:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,920 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:00:52,920 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:00:52,921 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 22:00:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:00:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 22:00:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:00:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 22:00:52,926 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 22:00:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,927 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 22:00:52,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 22:00:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:00:52,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,928 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 22:00:52,928 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 343984243, now seen corresponding path program 11 times [2019-10-01 22:00:52,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,068 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 22:00:53,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,068 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) [2019-10-01 22:00:53,094 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:53,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:00:53,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:53,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 22:00:53,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:53,357 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 22:00:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,429 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 22:00:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:53,429 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 22:00:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,430 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:00:53,431 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 22:00:53,432 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 22:00:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 22:00:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 22:00:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:00:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 22:00:53,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 22:00:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,442 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 22:00:53,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 22:00:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:00:53,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,443 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 22:00:53,443 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1658502451, now seen corresponding path program 12 times [2019-10-01 22:00:53,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,606 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 22:00:53,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,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 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 22:00:53,629 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:53,792 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 22:00:53,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,853 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 22:00:53,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 22:00:53,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:53,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:53,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:53,859 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 22:00:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,956 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 22:00:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:53,958 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:00:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,959 INFO L225 Difference]: With dead ends: 101 [2019-10-01 22:00:53,959 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:00:53,960 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 22:00:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:00:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:00:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:00:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 22:00:53,971 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 22:00:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,972 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 22:00:53,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 22:00:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 22:00:53,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,976 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 22:00:53,977 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368429, now seen corresponding path program 13 times [2019-10-01 22:00:53,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,152 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 22:00:54,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,153 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 22:00:54,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,279 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 22:00:54,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:00:54,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:54,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:54,290 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 22:00:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,370 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 22:00:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:00:54,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 22:00:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,372 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:00:54,372 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 22:00:54,373 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 22:00:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 22:00:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 22:00:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 22:00:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 22:00:54,378 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 22:00:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,379 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 22:00:54,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 22:00:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 22:00:54,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,381 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 22:00:54,382 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1574767605, now seen corresponding path program 14 times [2019-10-01 22:00:54,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,610 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 22:00:54,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:54,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:54,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:54,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,751 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 22:00:54,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:00:54,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:00:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:00:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:54,759 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 22:00:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,813 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 22:00:54,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:54,814 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 22:00:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,815 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:00:54,815 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:00:54,816 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:00:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 22:00:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:00:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 22:00:54,823 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 22:00:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,824 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 22:00:54,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:00:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 22:00:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 22:00:54,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,828 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 22:00:54,828 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -459700265, now seen corresponding path program 15 times [2019-10-01 22:00:54,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,058 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 22:00:55,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,058 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 22:00:55,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:55,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:00:55,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,232 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 22:00:55,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 22:00:55,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:55,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:55,238 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 22:00:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,350 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 22:00:55,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:00:55,350 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 22:00:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,355 INFO L225 Difference]: With dead ends: 111 [2019-10-01 22:00:55,355 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 22:00:55,356 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 22:00:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 22:00:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 22:00:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:00:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 22:00:55,362 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 22:00:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,363 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 22:00:55,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 22:00:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:00:55,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,364 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 22:00:55,365 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash -727614313, now seen corresponding path program 16 times [2019-10-01 22:00:55,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,588 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 22:00:55,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,588 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 22:00:55,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:55,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:55,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:55,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,706 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 22:00:55,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:00:55,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:00:55,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:00:55,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:55,712 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 22:00:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,768 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 22:00:55,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:55,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 22:00:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,770 INFO L225 Difference]: With dead ends: 114 [2019-10-01 22:00:55,770 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:00:55,771 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 22:00:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:00:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 22:00:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:00:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 22:00:55,776 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 22:00:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,776 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 22:00:55,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:00:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 22:00:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 22:00:55,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,778 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 22:00:55,778 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1948648953, now seen corresponding path program 17 times [2019-10-01 22:00:55,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:56,011 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 22:00:56,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:56,011 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 22:00:56,033 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:56,677 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:00:56,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:56,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,808 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 22:00:56,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 22:00:56,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:00:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:00:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:56,819 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 22:00:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:56,913 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 22:00:56,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:00:56,914 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 22:00:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:56,915 INFO L225 Difference]: With dead ends: 119 [2019-10-01 22:00:56,915 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 22:00:56,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 22:00:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 22:00:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 22:00:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 22:00:56,920 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 22:00:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:56,920 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 22:00:56,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:00:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 22:00:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 22:00:56,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:56,921 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 22:00:56,922 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1322362553, now seen corresponding path program 18 times [2019-10-01 22:00:56,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:56,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:56,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,176 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 22:00:57,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,177 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 22:00:57,214 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:57,398 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:00:57,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:57,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:00:57,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 269 proven. 16 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-01 22:00:57,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:57,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2019-10-01 22:00:57,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:00:57,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:00:57,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:00:57,532 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 28 states. [2019-10-01 22:00:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,774 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-10-01 22:00:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:00:57,775 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2019-10-01 22:00:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,777 INFO L225 Difference]: With dead ends: 126 [2019-10-01 22:00:57,777 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:00:57,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:00:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:00:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 22:00:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:00:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 22:00:57,784 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 118 [2019-10-01 22:00:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,785 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 22:00:57,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:00:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 22:00:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 22:00:57,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,786 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 22:00:57,787 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash -415764741, now seen corresponding path program 19 times [2019-10-01 22:00:57,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,064 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 22:00:58,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:58,064 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 22:00:58,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:00:58,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:58,182 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 22:00:58,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:58,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:00:58,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:58,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:58,190 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 22:00:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:58,293 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 22:00:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:00:58,295 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 22:00:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:58,296 INFO L225 Difference]: With dead ends: 130 [2019-10-01 22:00:58,296 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 22:00:58,297 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 22:00:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 22:00:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 22:00:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 22:00:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 22:00:58,300 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 22:00:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:58,301 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 22:00:58,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 22:00:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:00:58,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:58,302 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 22:00:58,303 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash -946768803, now seen corresponding path program 20 times [2019-10-01 22:00:58,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:58,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,610 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 22:00:58,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:58,610 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 22:00:58,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:58,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:58,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:58,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:00:58,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:58,728 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 22:00:58,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:58,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:00:58,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:00:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:00:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:00:58,733 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 25 states. [2019-10-01 22:00:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:58,803 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-10-01 22:00:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:00:58,803 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2019-10-01 22:00:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:58,804 INFO L225 Difference]: With dead ends: 132 [2019-10-01 22:00:58,804 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 22:00:58,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:00:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 22:00:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-10-01 22:00:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 22:00:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-10-01 22:00:58,809 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 126 [2019-10-01 22:00:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:58,809 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-10-01 22:00:58,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:00:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-10-01 22:00:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-01 22:00:58,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:58,811 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 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 22:00:58,811 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash -140564161, now seen corresponding path program 21 times [2019-10-01 22:00:58,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:58,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:59,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:59,117 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 22:00:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:59,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:00:59,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:59,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:59,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2019-10-01 22:00:59,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:59,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2019-10-01 22:00:59,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:00:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:00:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:00:59,351 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 31 states. [2019-10-01 22:00:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:59,532 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-10-01 22:00:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:00:59,532 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2019-10-01 22:00:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:59,534 INFO L225 Difference]: With dead ends: 137 [2019-10-01 22:00:59,534 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 22:00:59,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:00:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 22:00:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-10-01 22:00:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:00:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 22:00:59,540 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 128 [2019-10-01 22:00:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:59,540 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 22:00:59,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:00:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 22:00:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 22:00:59,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:59,542 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 22:00:59,542 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash 145514399, now seen corresponding path program 22 times [2019-10-01 22:00:59,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:59,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:59,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:59,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:59,845 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 22:00:59,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:59,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 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 22:00:59,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:59,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:59,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:59,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:00:59,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:59,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:59,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 22:00:59,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:00:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:00:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:59,977 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 27 states. [2019-10-01 22:01:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:00,061 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2019-10-01 22:01:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:01:00,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-10-01 22:01:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:00,064 INFO L225 Difference]: With dead ends: 140 [2019-10-01 22:01:00,065 INFO L226 Difference]: Without dead ends: 98 [2019-10-01 22:01:00,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:01:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-01 22:01:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-10-01 22:01:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 22:01:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-10-01 22:01:00,070 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 132 [2019-10-01 22:01:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:00,070 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-10-01 22:01:00,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:01:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-10-01 22:01:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-01 22:01:00,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:00,072 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 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 22:01:00,072 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:00,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:00,072 INFO L82 PathProgramCache]: Analyzing trace with hash -807181567, now seen corresponding path program 23 times [2019-10-01 22:01:00,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:00,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:00,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:01:00,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:00,475 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 22:01:00,506 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:01,749 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 22:01:01,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:01,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:01,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2019-10-01 22:01:01,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:01,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2019-10-01 22:01:01,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:01:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:01:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:01,958 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 35 states. [2019-10-01 22:01:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:02,139 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2019-10-01 22:01:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:02,139 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2019-10-01 22:01:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:02,140 INFO L225 Difference]: With dead ends: 145 [2019-10-01 22:01:02,141 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 22:01:02,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 127 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 22:01:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 22:01:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-10-01 22:01:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-01 22:01:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-10-01 22:01:02,149 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 134 [2019-10-01 22:01:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:02,150 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-10-01 22:01:02,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:01:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-10-01 22:01:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 22:01:02,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:02,156 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 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 22:01:02,156 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:02,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:02,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1827973695, now seen corresponding path program 24 times [2019-10-01 22:01:02,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:02,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:01:02,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:02,578 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 22:01:02,611 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:03,259 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 22:01:03,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:03,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:01:03,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-10-01 22:01:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:03,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-10-01 22:01:03,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:01:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:01:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:03,396 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 35 states. [2019-10-01 22:01:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:03,555 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2019-10-01 22:01:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:03,558 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2019-10-01 22:01:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:03,558 INFO L225 Difference]: With dead ends: 151 [2019-10-01 22:01:03,559 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 22:01:03,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 22:01:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-10-01 22:01:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 22:01:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 22:01:03,564 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 142 [2019-10-01 22:01:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:03,564 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 22:01:03,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:01:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 22:01:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 22:01:03,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:03,566 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 22:01:03,566 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1510967329, now seen corresponding path program 25 times [2019-10-01 22:01:03,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:03,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:03,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:03,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:03,953 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 22:01:03,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:03,953 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 22:01:03,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:01:04,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:04,076 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 22:01:04,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:04,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:01:04,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:01:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:01:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:04,080 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 22:01:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:04,189 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 22:01:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:01:04,194 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 22:01:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:04,195 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:01:04,195 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 22:01:04,196 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 22:01:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 22:01:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 22:01:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:01:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 22:01:04,201 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 22:01:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:04,202 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 22:01:04,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:01:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 22:01:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 22:01:04,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:04,203 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 22:01:04,203 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1388054525, now seen corresponding path program 26 times [2019-10-01 22:01:04,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:04,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,679 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 22:01:04,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:04,679 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 22:01:04,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:04,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:04,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:04,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:01:04,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:04,820 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 22:01:04,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:04,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:01:04,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:01:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:01:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:01:04,826 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 31 states. [2019-10-01 22:01:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:04,929 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2019-10-01 22:01:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:01:04,930 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2019-10-01 22:01:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:04,931 INFO L225 Difference]: With dead ends: 156 [2019-10-01 22:01:04,931 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 22:01:04,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:01:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 22:01:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-10-01 22:01:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 22:01:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-10-01 22:01:04,938 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 148 [2019-10-01 22:01:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:04,938 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-10-01 22:01:04,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:01:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-10-01 22:01:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 22:01:04,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:04,940 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 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 22:01:04,940 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 85718885, now seen corresponding path program 27 times [2019-10-01 22:01:04,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:04,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:04,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:05,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:05,439 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 22:01:05,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:05,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:01:05,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:05,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:05,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2019-10-01 22:01:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:05,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2019-10-01 22:01:05,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 22:01:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 22:01:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:01:05,890 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 39 states. [2019-10-01 22:01:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:06,035 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-10-01 22:01:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 22:01:06,036 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2019-10-01 22:01:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:06,036 INFO L225 Difference]: With dead ends: 161 [2019-10-01 22:01:06,037 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 22:01:06,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:01:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 22:01:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-10-01 22:01:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-01 22:01:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-10-01 22:01:06,042 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 150 [2019-10-01 22:01:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:06,043 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-10-01 22:01:06,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 22:01:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-10-01 22:01:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-01 22:01:06,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:06,044 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 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 22:01:06,044 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1448030523, now seen corresponding path program 28 times [2019-10-01 22:01:06,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:06,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 22:01:06,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:06,500 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 22:01:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:06,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:06,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:06,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:06,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2019-10-01 22:01:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:06,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2019-10-01 22:01:06,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:01:06,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:01:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:01:06,951 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2019-10-01 22:01:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:07,112 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2019-10-01 22:01:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:01:07,112 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2019-10-01 22:01:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:07,114 INFO L225 Difference]: With dead ends: 167 [2019-10-01 22:01:07,114 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 22:01:07,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:01:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 22:01:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-10-01 22:01:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 22:01:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-10-01 22:01:07,128 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2019-10-01 22:01:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:07,128 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-10-01 22:01:07,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:01:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-10-01 22:01:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 22:01:07,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:07,129 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 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 22:01:07,130 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:07,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:07,130 INFO L82 PathProgramCache]: Analyzing trace with hash 921802629, now seen corresponding path program 29 times [2019-10-01 22:01:07,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:07,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:07,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:07,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 22:01:07,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:07,770 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 22:01:07,808 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:26,990 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 22:01:26,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:27,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:27,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2019-10-01 22:01:27,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:27,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-10-01 22:01:27,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:01:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:01:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:27,222 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2019-10-01 22:01:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:27,390 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-10-01 22:01:27,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:01:27,391 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2019-10-01 22:01:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:27,392 INFO L225 Difference]: With dead ends: 173 [2019-10-01 22:01:27,392 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 22:01:27,394 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 22:01:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-10-01 22:01:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 22:01:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-01 22:01:27,401 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2019-10-01 22:01:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:27,403 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-01 22:01:27,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:01:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-01 22:01:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-01 22:01:27,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:27,405 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 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 22:01:27,405 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 301043269, now seen corresponding path program 30 times [2019-10-01 22:01:27,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:27,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:27,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 22:01:27,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:27,952 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 22:01:28,039 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:30,956 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:01:30,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:30,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:30,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2019-10-01 22:01:31,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:31,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2019-10-01 22:01:31,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:01:31,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:01:31,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:31,147 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2019-10-01 22:01:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:31,344 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2019-10-01 22:01:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:01:31,344 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2019-10-01 22:01:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:31,346 INFO L225 Difference]: With dead ends: 179 [2019-10-01 22:01:31,346 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 22:01:31,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 22:01:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-10-01 22:01:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:01:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 22:01:31,352 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2019-10-01 22:01:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:31,352 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 22:01:31,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:01:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 22:01:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 22:01:31,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:31,354 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 22:01:31,354 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1172060325, now seen corresponding path program 31 times [2019-10-01 22:01:31,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:31,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:31,986 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 22:01:31,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:31,986 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 22:01:32,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:32,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:01:32,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:32,151 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 22:01:32,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:32,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:01:32,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:01:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:01:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:32,158 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 22:01:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:32,272 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 22:01:32,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:32,272 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 22:01:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:32,273 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:01:32,274 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 22:01:32,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 22:01:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 22:01:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 22:01:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 22:01:32,279 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 22:01:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:32,279 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 22:01:32,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:01:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 22:01:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:01:32,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:32,281 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 22:01:32,281 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1616125561, now seen corresponding path program 32 times [2019-10-01 22:01:32,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:32,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:32,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:32,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:32,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:32,812 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 22:01:32,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:32,812 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 22:01:32,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:32,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:32,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:32,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:01:32,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:32,974 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 22:01:32,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:32,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 22:01:32,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:01:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:01:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:01:32,980 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2019-10-01 22:01:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:33,104 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2019-10-01 22:01:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:01:33,104 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2019-10-01 22:01:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:33,106 INFO L225 Difference]: With dead ends: 184 [2019-10-01 22:01:33,106 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 22:01:33,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:01:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 22:01:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-10-01 22:01:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 22:01:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-10-01 22:01:33,113 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2019-10-01 22:01:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:33,114 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-10-01 22:01:33,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:01:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-10-01 22:01:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 22:01:33,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:33,116 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 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 22:01:33,116 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:33,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1003169303, now seen corresponding path program 33 times [2019-10-01 22:01:33,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:33,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:33,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:33,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:33,695 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 22:01:33,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:34,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 22:01:34,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:34,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:01:34,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 448 proven. 100 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2019-10-01 22:01:34,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:34,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 22:01:34,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:01:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:01:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:34,236 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2019-10-01 22:01:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:34,426 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2019-10-01 22:01:34,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:01:34,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2019-10-01 22:01:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:34,430 INFO L225 Difference]: With dead ends: 189 [2019-10-01 22:01:34,431 INFO L226 Difference]: Without dead ends: 135 [2019-10-01 22:01:34,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-01 22:01:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-10-01 22:01:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 22:01:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-10-01 22:01:34,438 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2019-10-01 22:01:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:34,439 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-10-01 22:01:34,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:01:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-10-01 22:01:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-01 22:01:34,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:34,441 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 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 22:01:34,441 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:34,442 INFO L82 PathProgramCache]: Analyzing trace with hash 457593001, now seen corresponding path program 34 times [2019-10-01 22:01:34,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:34,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:34,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:34,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2019-10-01 22:01:35,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:35,209 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 22:01:35,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:35,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:35,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:35,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:01:35,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 803 proven. 121 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-01 22:01:35,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:35,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2019-10-01 22:01:35,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:01:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:01:35,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:01:35,607 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2019-10-01 22:01:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:35,836 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2019-10-01 22:01:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:01:35,837 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2019-10-01 22:01:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:35,838 INFO L225 Difference]: With dead ends: 195 [2019-10-01 22:01:35,838 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 22:01:35,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:01:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 22:01:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-01 22:01:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 22:01:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-10-01 22:01:35,845 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2019-10-01 22:01:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:35,845 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-10-01 22:01:35,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:01:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-10-01 22:01:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-01 22:01:35,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:35,851 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 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 22:01:35,851 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1118472855, now seen corresponding path program 35 times [2019-10-01 22:01:35,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:35,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2019-10-01 22:01:36,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:36,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 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 22:01:36,515 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:02:08,382 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 22:02:08,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:08,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:02:08,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2019-10-01 22:02:08,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:08,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2019-10-01 22:02:08,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 22:02:08,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 22:02:08,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:02:08,708 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2019-10-01 22:02:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:08,873 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2019-10-01 22:02:08,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 22:02:08,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2019-10-01 22:02:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:08,874 INFO L225 Difference]: With dead ends: 201 [2019-10-01 22:02:08,875 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 22:02:08,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:02:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 22:02:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-10-01 22:02:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-01 22:02:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-10-01 22:02:08,881 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2019-10-01 22:02:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:08,881 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-10-01 22:02:08,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 22:02:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-10-01 22:02:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 22:02:08,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:08,883 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 37, 37, 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 22:02:08,883 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 543770665, now seen corresponding path program 36 times [2019-10-01 22:02:08,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:08,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:08,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:08,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2019-10-01 22:02:09,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:09,487 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 22:02:09,537 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:02:15,771 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 22:02:15,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:15,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:02:15,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 738 proven. 81 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2019-10-01 22:02:16,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:16,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 50 [2019-10-01 22:02:16,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:02:16,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:02:16,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:02:16,021 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 50 states. [2019-10-01 22:02:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:16,203 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2019-10-01 22:02:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:02:16,204 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2019-10-01 22:02:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:16,205 INFO L225 Difference]: With dead ends: 207 [2019-10-01 22:02:16,205 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 22:02:16,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:02:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 22:02:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-01 22:02:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 22:02:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 22:02:16,212 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 202 [2019-10-01 22:02:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:16,212 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 22:02:16,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:02:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 22:02:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 22:02:16,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:16,214 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 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 22:02:16,214 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1731487351, now seen corresponding path program 37 times [2019-10-01 22:02:16,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:16,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:16,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:16,865 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 22:02:16,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:17,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:02:17,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:17,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:17,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:02:17,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:02:17,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:02:17,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:17,063 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 22:02:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:17,178 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 22:02:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:02:17,179 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2019-10-01 22:02:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:17,180 INFO L225 Difference]: With dead ends: 210 [2019-10-01 22:02:17,180 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:02:17,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:02:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 22:02:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 22:02:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 22:02:17,187 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 206 [2019-10-01 22:02:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:17,187 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 22:02:17,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:02:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 22:02:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-01 22:02:17,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:17,189 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 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 22:02:17,190 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1569768853, now seen corresponding path program 38 times [2019-10-01 22:02:17,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:17,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:17,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:17,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:17,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:18,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:18,013 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 22:02:18,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:02:18,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:02:18,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:18,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:02:18,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:18,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:18,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 22:02:18,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:02:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:02:18,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:02:18,216 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 43 states. [2019-10-01 22:02:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:18,331 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2019-10-01 22:02:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:02:18,332 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2019-10-01 22:02:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:18,333 INFO L225 Difference]: With dead ends: 212 [2019-10-01 22:02:18,333 INFO L226 Difference]: Without dead ends: 150 [2019-10-01 22:02:18,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:02:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-01 22:02:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-10-01 22:02:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-01 22:02:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2019-10-01 22:02:18,343 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 208 [2019-10-01 22:02:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:18,344 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2019-10-01 22:02:18,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:02:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2019-10-01 22:02:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-01 22:02:18,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:18,346 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 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 22:02:18,347 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash -777114931, now seen corresponding path program 39 times [2019-10-01 22:02:18,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:18,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:18,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:18,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:19,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:19,427 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 22:02:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:02:19,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:02:19,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:19,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:02:19,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 738 proven. 100 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2019-10-01 22:02:20,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:20,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 13] total 54 [2019-10-01 22:02:20,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:02:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:02:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:02:20,157 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 54 states. [2019-10-01 22:02:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:20,377 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2019-10-01 22:02:20,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:02:20,377 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2019-10-01 22:02:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:20,379 INFO L225 Difference]: With dead ends: 217 [2019-10-01 22:02:20,379 INFO L226 Difference]: Without dead ends: 155 [2019-10-01 22:02:20,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:02:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-01 22:02:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2019-10-01 22:02:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 22:02:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 22:02:20,385 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 210 [2019-10-01 22:02:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:20,385 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 22:02:20,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:02:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 22:02:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 22:02:20,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:20,387 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 22:02:20,387 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -376184531, now seen corresponding path program 40 times [2019-10-01 22:02:20,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:20,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:20,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:20,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:20,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:21,354 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 22:02:21,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:21,354 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 22:02:21,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:02:21,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:02:21,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:21,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 22:02:21,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:21,559 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 22:02:21,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:21,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 22:02:21,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:02:21,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:02:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:02:21,565 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 45 states. [2019-10-01 22:02:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:21,679 INFO L93 Difference]: Finished difference Result 220 states and 228 transitions. [2019-10-01 22:02:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 22:02:21,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2019-10-01 22:02:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:21,681 INFO L225 Difference]: With dead ends: 220 [2019-10-01 22:02:21,681 INFO L226 Difference]: Without dead ends: 156 [2019-10-01 22:02:21,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:02:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-01 22:02:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-10-01 22:02:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-01 22:02:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-10-01 22:02:21,687 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 214 [2019-10-01 22:02:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:21,687 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-10-01 22:02:21,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:02:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-10-01 22:02:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-01 22:02:21,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:21,689 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 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 22:02:21,689 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1241612303, now seen corresponding path program 41 times [2019-10-01 22:02:21,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:21,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:22,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:22,737 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 22:02:22,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:03:44,298 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 22:03:44,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:44,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:03:44,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2598 trivial. 0 not checked. [2019-10-01 22:03:44,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:44,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 16] total 59 [2019-10-01 22:03:44,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:03:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:03:44,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:03:44,683 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 59 states. [2019-10-01 22:03:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:44,914 INFO L93 Difference]: Finished difference Result 225 states and 237 transitions. [2019-10-01 22:03:44,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:03:44,917 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 216 [2019-10-01 22:03:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:44,918 INFO L225 Difference]: With dead ends: 225 [2019-10-01 22:03:44,918 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 22:03:44,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:03:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 22:03:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-10-01 22:03:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-01 22:03:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-10-01 22:03:44,924 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 216 [2019-10-01 22:03:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:44,924 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-10-01 22:03:44,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:03:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-10-01 22:03:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-01 22:03:44,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:44,926 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 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 22:03:44,926 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 65185487, now seen corresponding path program 42 times [2019-10-01 22:03:44,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:44,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:44,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:44,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:44,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 22:03:45,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:45,787 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 22:03:45,851 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:03:49,649 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:03:49,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:49,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:03:49,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2019-10-01 22:03:50,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:50,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 14] total 58 [2019-10-01 22:03:50,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:03:50,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:03:50,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:50,072 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 58 states. [2019-10-01 22:03:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:50,319 INFO L93 Difference]: Finished difference Result 231 states and 240 transitions. [2019-10-01 22:03:50,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:03:50,320 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2019-10-01 22:03:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:50,321 INFO L225 Difference]: With dead ends: 231 [2019-10-01 22:03:50,321 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 22:03:50,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 22:03:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-10-01 22:03:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 22:03:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 22:03:50,328 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 224 [2019-10-01 22:03:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:50,329 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 22:03:50,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:03:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 22:03:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 22:03:50,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:50,330 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 22:03:50,331 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1549752623, now seen corresponding path program 43 times [2019-10-01 22:03:50,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:50,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:51,207 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 22:03:51,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:51,208 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 22:03:51,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:51,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:03:51,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:51,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:51,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:03:51,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:03:51,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:03:51,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:51,440 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 22:03:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:51,580 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 22:03:51,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:03:51,580 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 22:03:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:51,581 INFO L225 Difference]: With dead ends: 234 [2019-10-01 22:03:51,581 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 22:03:51,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 22:03:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 22:03:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 22:03:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 22:03:51,588 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 22:03:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:51,589 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 22:03:51,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:03:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 22:03:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 22:03:51,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:51,591 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 22:03:51,591 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1185659759, now seen corresponding path program 44 times [2019-10-01 22:03:51,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:51,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:51,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:51,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:51,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:52,728 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 22:03:52,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:52,729 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 22:03:52,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:03:52,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:03:52,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:52,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 22:03:52,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:52,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:52,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 22:03:52,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:03:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:03:52,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:03:52,988 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 49 states. [2019-10-01 22:03:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:53,159 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2019-10-01 22:03:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:03:53,159 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 230 [2019-10-01 22:03:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:53,161 INFO L225 Difference]: With dead ends: 236 [2019-10-01 22:03:53,161 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 22:03:53,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:03:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 22:03:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-10-01 22:03:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 22:03:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-01 22:03:53,168 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 230 [2019-10-01 22:03:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:53,168 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-01 22:03:53,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:03:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-01 22:03:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-01 22:03:53,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:53,170 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 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 22:03:53,170 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1396973709, now seen corresponding path program 45 times [2019-10-01 22:03:53,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:53,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:53,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:53,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:54,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:54,073 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 22:03:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:03:54,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:03:54,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:54,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:03:54,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3129 trivial. 0 not checked. [2019-10-01 22:03:54,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:54,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 15] total 62 [2019-10-01 22:03:54,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:03:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:03:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:03:54,870 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 62 states. [2019-10-01 22:03:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:55,169 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2019-10-01 22:03:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:03:55,169 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 232 [2019-10-01 22:03:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:55,170 INFO L225 Difference]: With dead ends: 241 [2019-10-01 22:03:55,171 INFO L226 Difference]: Without dead ends: 173 [2019-10-01 22:03:55,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:03:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-01 22:03:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-01 22:03:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 22:03:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 22:03:55,176 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 232 [2019-10-01 22:03:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:55,177 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 22:03:55,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:03:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 22:03:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 22:03:55,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:55,179 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 22:03:55,179 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 262928083, now seen corresponding path program 46 times [2019-10-01 22:03:55,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:55,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:55,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:56,221 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 22:03:56,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:56,221 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 22:03:56,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:03:56,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:03:56,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:56,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 22:03:56,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:56,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:56,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 22:03:56,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:03:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:03:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:03:56,447 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 51 states. [2019-10-01 22:03:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:56,600 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2019-10-01 22:03:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:03:56,600 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 236 [2019-10-01 22:03:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:56,602 INFO L225 Difference]: With dead ends: 244 [2019-10-01 22:03:56,602 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 22:03:56,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:03:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 22:03:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 22:03:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 22:03:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-10-01 22:03:56,610 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 236 [2019-10-01 22:03:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:56,611 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-10-01 22:03:56,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:03:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-10-01 22:03:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 22:03:56,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:56,613 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 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 22:03:56,613 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash -860331979, now seen corresponding path program 47 times [2019-10-01 22:03:56,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:56,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:56,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:57,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:57,763 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 22:03:57,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:05:40,222 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 22:05:40,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:40,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:05:40,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3296 trivial. 0 not checked. [2019-10-01 22:05:40,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:40,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 17] total 66 [2019-10-01 22:05:40,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:05:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:05:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:05:40,746 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 66 states. [2019-10-01 22:05:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:41,029 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2019-10-01 22:05:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:05:41,030 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 238 [2019-10-01 22:05:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:41,032 INFO L225 Difference]: With dead ends: 249 [2019-10-01 22:05:41,033 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 22:05:41,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:05:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 22:05:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-01 22:05:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 22:05:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-01 22:05:41,045 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 238 [2019-10-01 22:05:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:41,045 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-01 22:05:41,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:05:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-01 22:05:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 22:05:41,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:41,048 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 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 22:05:41,048 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -465413387, now seen corresponding path program 48 times [2019-10-01 22:05:41,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:41,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:41,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:05:41,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 22:05:42,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05: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 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 22:05:42,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:06:16,599 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 22:06:16,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:16,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:06:16,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3561 trivial. 0 not checked. [2019-10-01 22:06:16,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:16,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 16] total 66 [2019-10-01 22:06:16,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:06:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:06:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:06:16,995 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 66 states. [2019-10-01 22:06:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:17,327 INFO L93 Difference]: Finished difference Result 255 states and 264 transitions. [2019-10-01 22:06:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:06:17,337 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 246 [2019-10-01 22:06:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:17,338 INFO L225 Difference]: With dead ends: 255 [2019-10-01 22:06:17,338 INFO L226 Difference]: Without dead ends: 183 [2019-10-01 22:06:17,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:06:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-01 22:06:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-10-01 22:06:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 22:06:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 22:06:17,345 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 246 [2019-10-01 22:06:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:17,345 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 22:06:17,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:06:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 22:06:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 22:06:17,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:17,347 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 22:06:17,347 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash -847696299, now seen corresponding path program 49 times [2019-10-01 22:06:17,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:17,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:17,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:17,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:17,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:18,611 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 22:06:18,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:18,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 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 22:06:18,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:18,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 22:06:18,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:18,844 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 22:06:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:18,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 22:06:18,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:06:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:06:18,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:06:18,853 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 22:06:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:19,007 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 22:06:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:06:19,008 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 22:06:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:19,009 INFO L225 Difference]: With dead ends: 258 [2019-10-01 22:06:19,009 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:06:19,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:06:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:06:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 22:06:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 22:06:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 22:06:19,015 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 22:06:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:19,016 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 22:06:19,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:06:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 22:06:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 22:06:19,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:19,017 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 22:06:19,018 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash 706249783, now seen corresponding path program 50 times [2019-10-01 22:06:19,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:19,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:19,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:19,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:19,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:20,089 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 22:06:20,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:20,090 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 22:06:20,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:06:20,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:06:20,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:20,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:06:20,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:20,314 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 22:06:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 22:06:20,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:06:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:06:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:06:20,319 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 55 states. [2019-10-01 22:06:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:20,515 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 22:06:20,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:06:20,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 252 [2019-10-01 22:06:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:20,517 INFO L225 Difference]: With dead ends: 260 [2019-10-01 22:06:20,517 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 22:06:20,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:06:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 22:06:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-10-01 22:06:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 22:06:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-01 22:06:20,523 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 252 [2019-10-01 22:06:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:20,523 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-01 22:06:20,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:06:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-01 22:06:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 22:06:20,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:20,525 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 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 22:06:20,526 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -600184423, now seen corresponding path program 51 times [2019-10-01 22:06:20,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:20,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:20,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:21,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:21,630 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 22:06:21,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:06:22,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:06:22,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:22,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:06:22,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2019-10-01 22:06:22,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:22,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 17] total 70 [2019-10-01 22:06:22,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:06:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:06:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:06:22,914 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 70 states. [2019-10-01 22:06:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:23,155 INFO L93 Difference]: Finished difference Result 265 states and 274 transitions. [2019-10-01 22:06:23,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 22:06:23,156 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 254 [2019-10-01 22:06:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:23,157 INFO L225 Difference]: With dead ends: 265 [2019-10-01 22:06:23,158 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 22:06:23,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:06:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 22:06:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2019-10-01 22:06:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 22:06:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 22:06:23,164 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 254 [2019-10-01 22:06:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:23,165 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 22:06:23,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:06:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 22:06:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 22:06:23,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:23,167 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 22:06:23,167 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1563697657, now seen corresponding path program 52 times [2019-10-01 22:06:23,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:23,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:23,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:23,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:23,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:24,391 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 22:06:24,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:24,392 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 22:06:24,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:06:24,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:06:24,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:24,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 22:06:24,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (54)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:06:24,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:24,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 22:06:24,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:06:24,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:06:24,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:06:24,644 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 57 states. [2019-10-01 22:06:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:24,886 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2019-10-01 22:06:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 22:06:24,886 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 258 [2019-10-01 22:06:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:24,888 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:06:24,888 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 22:06:24,889 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:06:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 22:06:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-10-01 22:06:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 22:06:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-01 22:06:24,898 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 258 [2019-10-01 22:06:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:24,899 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-01 22:06:24,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:06:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-01 22:06:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 22:06:24,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:24,902 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 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 22:06:24,902 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1209562587, now seen corresponding path program 53 times [2019-10-01 22:06:24,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:24,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:24,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:26,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:26,210 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 22:06:26,296 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:08:48,639 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-01 22:08:48,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:08:48,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:08:48,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:08:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-10-01 22:08:49,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:08:49,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 22:08:49,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:08:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:08:49,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:08:49,171 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 73 states. [2019-10-01 22:08:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:49,491 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-10-01 22:08:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:08:49,492 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 260 [2019-10-01 22:08:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:49,493 INFO L225 Difference]: With dead ends: 273 [2019-10-01 22:08:49,493 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 22:08:49,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:08:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 22:08:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-01 22:08:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 22:08:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-01 22:08:49,499 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 260 [2019-10-01 22:08:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:49,499 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-01 22:08:49,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:08:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-01 22:08:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 22:08:49,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:49,501 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 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 22:08:49,501 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1357300891, now seen corresponding path program 54 times [2019-10-01 22:08:49,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:49,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:08:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 22:08:50,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:08:50,710 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 22:08:50,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:10:33,180 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 22:10:33,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:33,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:10:33,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 1207 proven. 225 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2019-10-01 22:10:33,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:33,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 20] total 76 [2019-10-01 22:10:33,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-01 22:10:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-01 22:10:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=3778, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 22:10:33,796 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 76 states. [2019-10-01 22:10:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:34,826 INFO L93 Difference]: Finished difference Result 280 states and 290 transitions. [2019-10-01 22:10:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-01 22:10:34,827 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 268 [2019-10-01 22:10:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:34,828 INFO L225 Difference]: With dead ends: 280 [2019-10-01 22:10:34,828 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 22:10:34,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2226, Invalid=6146, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 22:10:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 22:10:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 22:10:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 22:10:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 22:10:34,835 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 268 [2019-10-01 22:10:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:34,836 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 22:10:34,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-01 22:10:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 22:10:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 22:10:34,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:34,838 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 22:10:34,838 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:34,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1565677917, now seen corresponding path program 55 times [2019-10-01 22:10:34,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:34,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:34,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:34,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:34,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:36,203 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 22:10:36,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:36,203 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 22:10:36,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:10:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:36,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 22:10:36,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:36,448 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 22:10:36,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:36,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 22:10:36,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:10:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:10:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:10:36,453 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 61 states. [2019-10-01 22:10:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:36,685 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-10-01 22:10:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:10:36,686 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 274 [2019-10-01 22:10:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:36,687 INFO L225 Difference]: With dead ends: 284 [2019-10-01 22:10:36,687 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 22:10:36,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:10:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 22:10:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 22:10:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 22:10:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 22:10:36,694 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 274 [2019-10-01 22:10:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:36,694 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 22:10:36,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:10:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 22:10:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 22:10:36,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:36,696 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 22:10:36,697 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1227270463, now seen corresponding path program 56 times [2019-10-01 22:10:36,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:36,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:10:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:38,126 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 22:10:38,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:38,127 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 22:10:38,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:10:38,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:10:38,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:38,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 22:10:38,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:38,401 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 22:10:38,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:38,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 22:10:38,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:10:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:10:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:10:38,407 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 62 states. [2019-10-01 22:10:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:38,601 INFO L93 Difference]: Finished difference Result 286 states and 294 transitions. [2019-10-01 22:10:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:10:38,602 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 276 [2019-10-01 22:10:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:38,603 INFO L225 Difference]: With dead ends: 286 [2019-10-01 22:10:38,603 INFO L226 Difference]: Without dead ends: 206 [2019-10-01 22:10:38,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:10:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-01 22:10:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-10-01 22:10:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 22:10:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-01 22:10:38,610 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 276 [2019-10-01 22:10:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:38,610 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-01 22:10:38,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:10:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-01 22:10:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 22:10:38,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:38,612 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 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 22:10:38,612 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1859745631, now seen corresponding path program 57 times [2019-10-01 22:10:38,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:38,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:38,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:10:39,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:39,972 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 22:10:40,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:10:41,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 22:10:41,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:41,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:10:41,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked. [2019-10-01 22:10:41,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:41,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 19] total 79 [2019-10-01 22:10:41,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 22:10:41,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 22:10:41,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2061, Invalid=4101, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:10:41,984 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 79 states. [2019-10-01 22:10:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:42,361 INFO L93 Difference]: Finished difference Result 291 states and 303 transitions. [2019-10-01 22:10:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 22:10:42,361 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 278 [2019-10-01 22:10:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:42,362 INFO L225 Difference]: With dead ends: 291 [2019-10-01 22:10:42,362 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 22:10:42,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2061, Invalid=4101, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:10:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 22:10:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-10-01 22:10:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 22:10:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-01 22:10:42,368 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 278 [2019-10-01 22:10:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:42,368 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-01 22:10:42,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 22:10:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-01 22:10:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-01 22:10:42,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:42,370 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 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 22:10:42,370 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1234119327, now seen corresponding path program 58 times [2019-10-01 22:10:42,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:42,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:42,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6574 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 22:10:43,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:43,878 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 22:10:43,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:10:44,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:10:44,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:44,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:10:44,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6574 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 5053 trivial. 0 not checked. [2019-10-01 22:10:44,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:44,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 20] total 81 [2019-10-01 22:10:44,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 22:10:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 22:10:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2142, Invalid=4338, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 22:10:44,666 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 81 states. [2019-10-01 22:10:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:45,072 INFO L93 Difference]: Finished difference Result 297 states and 309 transitions. [2019-10-01 22:10:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 22:10:45,073 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 286 [2019-10-01 22:10:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:45,074 INFO L225 Difference]: With dead ends: 297 [2019-10-01 22:10:45,074 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 22:10:45,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2142, Invalid=4338, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 22:10:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 22:10:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-01 22:10:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-01 22:10:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-10-01 22:10:45,081 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 286 [2019-10-01 22:10:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:45,082 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-10-01 22:10:45,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 22:10:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-10-01 22:10:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-01 22:10:45,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:45,086 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 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 22:10:45,086 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1804447711, now seen corresponding path program 59 times [2019-10-01 22:10:45,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:45,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:45,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7016 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 22:10:46,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:46,980 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 22:10:47,089 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:13:59,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-10-01 22:13:59,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:13:59,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:13:59,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7016 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2019-10-01 22:14:00,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:00,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 21] total 83 [2019-10-01 22:14:00,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 22:14:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 22:14:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=4581, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 22:14:00,330 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 83 states. [2019-10-01 22:14:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:00,769 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2019-10-01 22:14:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 22:14:00,769 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 294 [2019-10-01 22:14:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:00,773 INFO L225 Difference]: With dead ends: 303 [2019-10-01 22:14:00,773 INFO L226 Difference]: Without dead ends: 219 [2019-10-01 22:14:00,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2225, Invalid=4581, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 22:14:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-01 22:14:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-10-01 22:14:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-01 22:14:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2019-10-01 22:14:00,783 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 294 [2019-10-01 22:14:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:00,783 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2019-10-01 22:14:00,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 22:14:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2019-10-01 22:14:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-01 22:14:00,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:00,786 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 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 22:14:00,787 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1724778271, now seen corresponding path program 60 times [2019-10-01 22:14:00,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:00,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:00,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7478 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 22:14:02,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:02,349 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 22:14:02,458 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:14:39,511 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:14:39,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:39,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:14:39,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7478 backedges. 1530 proven. 256 refuted. 0 times theorem prover too weak. 5692 trivial. 0 not checked. [2019-10-01 22:14:40,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:40,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 19] total 82 [2019-10-01 22:14:40,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:14:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:14:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2250, Invalid=4392, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:14:40,062 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand 82 states. [2019-10-01 22:14:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:40,528 INFO L93 Difference]: Finished difference Result 309 states and 318 transitions. [2019-10-01 22:14:40,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:14:40,529 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 302 [2019-10-01 22:14:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:40,531 INFO L225 Difference]: With dead ends: 309 [2019-10-01 22:14:40,531 INFO L226 Difference]: Without dead ends: 223 [2019-10-01 22:14:40,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2250, Invalid=4392, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:14:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-10-01 22:14:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-10-01 22:14:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:14:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 22:14:40,538 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 302 [2019-10-01 22:14:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:40,538 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 22:14:40,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:14:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 22:14:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 22:14:40,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:40,540 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 22:14:40,541 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash -504065215, now seen corresponding path program 61 times [2019-10-01 22:14:40,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:40,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:40,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:42,092 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 22:14:42,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:42,093 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 22:14:42,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:14:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:42,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 22:14:42,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:42,382 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 22:14:42,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:42,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 22:14:42,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 22:14:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 22:14:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:14:42,387 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 22:14:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:42,662 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 22:14:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:14:42,663 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 22:14:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:42,664 INFO L225 Difference]: With dead ends: 312 [2019-10-01 22:14:42,664 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:14:42,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:14:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:14:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 22:14:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 22:14:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 22:14:42,671 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 22:14:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:42,671 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 22:14:42,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 22:14:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 22:14:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 22:14:42,673 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:42,673 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 22:14:42,674 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:42,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash 692116259, now seen corresponding path program 62 times [2019-10-01 22:14:42,674 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:42,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:42,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:14:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:44,332 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 22:14:44,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:44,333 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 22:14:44,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:14:44,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:14:44,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:44,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 22:14:44,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:44,648 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 22:14:44,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:44,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 22:14:44,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:14:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:14:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:14:44,654 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 68 states. [2019-10-01 22:14:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:44,853 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2019-10-01 22:14:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 22:14:44,853 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 308 [2019-10-01 22:14:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:44,854 INFO L225 Difference]: With dead ends: 314 [2019-10-01 22:14:44,854 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 22:14:44,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:14:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 22:14:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-01 22:14:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 22:14:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 22:14:44,861 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 308 [2019-10-01 22:14:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:44,862 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 22:14:44,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:14:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 22:14:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 22:14:44,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:44,864 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 22:14:44,864 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash -828722555, now seen corresponding path program 63 times [2019-10-01 22:14:44,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:44,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:44,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:46,539 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 22:14:46,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:46,540 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 22:14:46,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:14:49,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:14:49,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:49,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:14:49,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:50,169 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 22:14:50,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:50,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 20] total 86 [2019-10-01 22:14:50,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 22:14:50,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 22:14:50,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:14:50,177 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 86 states. [2019-10-01 22:14:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:50,556 INFO L93 Difference]: Finished difference Result 319 states and 328 transitions. [2019-10-01 22:14:50,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-01 22:14:50,556 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 310 [2019-10-01 22:14:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:50,558 INFO L225 Difference]: With dead ends: 319 [2019-10-01 22:14:50,558 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 22:14:50,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:14:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 22:14:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-10-01 22:14:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 22:14:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 22:14:50,566 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 310 [2019-10-01 22:14:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:50,566 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 22:14:50,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 22:14:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 22:14:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-01 22:14:50,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:50,569 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 22:14:50,569 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1074794011, now seen corresponding path program 64 times [2019-10-01 22:14:50,569 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:50,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:50,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:52,296 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 22:14:52,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:52,296 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 22:14:52,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:14:52,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:14:52,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:52,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:14:52,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:53,225 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 22:14:53,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:53,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 22] total 89 [2019-10-01 22:14:53,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 22:14:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 22:14:53,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:14:53,249 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 89 states. [2019-10-01 22:14:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:53,618 INFO L93 Difference]: Finished difference Result 325 states and 337 transitions. [2019-10-01 22:14:53,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-01 22:14:53,620 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 314 [2019-10-01 22:14:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:53,622 INFO L225 Difference]: With dead ends: 325 [2019-10-01 22:14:53,622 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 22:14:53,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:14:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 22:14:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-01 22:14:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 22:14:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2019-10-01 22:14:53,629 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 314 [2019-10-01 22:14:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:53,630 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2019-10-01 22:14:53,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 22:14:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2019-10-01 22:14:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-01 22:14:53,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:53,632 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 22:14:53,632 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1514442587, now seen corresponding path program 65 times [2019-10-01 22:14:53,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:53,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:53,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:53,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:53,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:55,402 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 22:14:55,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:55,402 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 22:14:55,527 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1