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/systemc/mem_slave_tlm.3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:29:31,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:29:31,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:29:31,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:29:31,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:29:31,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:29:31,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:29:31,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:29:31,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:29:31,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:29:31,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:29:31,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:29:31,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:29:31,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:29:31,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:29:31,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:29:31,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:29:31,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:29:31,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:29:31,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:29:31,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:29:31,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:29:31,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:29:31,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:29:31,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:29:31,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:29:31,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:29:31,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:29:31,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:29:31,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:29:31,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:29:31,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:29:31,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:29:31,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:29:31,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:29:31,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:29:31,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:29:31,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:29:31,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:29:31,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:29:31,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:29:31,320 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-09-08 06:29:31,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:29:31,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:29:31,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:29:31,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:29:31,337 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:29:31,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:29:31,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:29:31,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:29:31,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:29:31,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:29:31,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:29:31,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:29:31,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:29:31,339 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:29:31,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:29:31,339 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:29:31,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:29:31,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:29:31,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:29:31,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:29:31,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:29:31,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:29:31,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:29:31,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:29:31,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:29:31,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:29:31,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:29:31,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:29:31,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:29:31,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:29:31,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:29:31,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:29:31,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:29:31,409 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:29:31,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c [2019-09-08 06:29:31,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ab4761a/8dd61e04e0e948f7a9a05ed3935bcfc8/FLAG07eab4c55 [2019-09-08 06:29:32,072 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:29:32,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c [2019-09-08 06:29:32,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ab4761a/8dd61e04e0e948f7a9a05ed3935bcfc8/FLAG07eab4c55 [2019-09-08 06:29:32,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ab4761a/8dd61e04e0e948f7a9a05ed3935bcfc8 [2019-09-08 06:29:32,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:29:32,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:29:32,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:29:32,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:29:32,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:29:32,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:29:32" (1/1) ... [2019-09-08 06:29:32,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84c5b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:32, skipping insertion in model container [2019-09-08 06:29:32,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:29:32" (1/1) ... [2019-09-08 06:29:32,447 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:29:32,525 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:29:33,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:29:33,018 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:29:33,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:29:33,122 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:29:33,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33 WrapperNode [2019-09-08 06:29:33,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:29:33,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:29:33,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:29:33,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:29:33,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (1/1) ... [2019-09-08 06:29:33,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (1/1) ... [2019-09-08 06:29:33,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (1/1) ... [2019-09-08 06:29:33,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (1/1) ... [2019-09-08 06:29:33,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (1/1) ... [2019-09-08 06:29:33,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (1/1) ... [2019-09-08 06:29:33,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (1/1) ... [2019-09-08 06:29:33,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:29:33,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:29:33,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:29:33,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:29:33,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (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-09-08 06:29:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:29:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:29:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:29:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_read [2019-09-08 06:29:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_write [2019-09-08 06:29:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure m_run [2019-09-08 06:29:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure s_run [2019-09-08 06:29:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:29:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:29:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:29:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:29:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:29:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:29:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_read [2019-09-08 06:29:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_write [2019-09-08 06:29:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure m_run [2019-09-08 06:29:33,304 INFO L130 BoogieDeclarations]: Found specification of procedure s_run [2019-09-08 06:29:33,304 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:29:33,304 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:29:33,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:29:33,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:29:33,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:29:34,654 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:29:34,655 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-08 06:29:34,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:29:34 BoogieIcfgContainer [2019-09-08 06:29:34,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:29:34,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:29:34,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:29:34,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:29:34,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:29:32" (1/3) ... [2019-09-08 06:29:34,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16607773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:29:34, skipping insertion in model container [2019-09-08 06:29:34,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:33" (2/3) ... [2019-09-08 06:29:34,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16607773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:29:34, skipping insertion in model container [2019-09-08 06:29:34,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:29:34" (3/3) ... [2019-09-08 06:29:34,668 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2019-09-08 06:29:34,677 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:29:34,685 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:29:34,703 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:29:34,761 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:29:34,762 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:29:34,762 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:29:34,763 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:29:34,763 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:29:34,763 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:29:34,763 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:29:34,763 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:29:34,763 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:29:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-09-08 06:29:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:29:34,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:34,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:34,816 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1983901195, now seen corresponding path program 1 times [2019-09-08 06:29:34,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:34,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:34,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:34,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:34,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:35,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:35,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:35,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:35,278 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-09-08 06:29:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:35,840 INFO L93 Difference]: Finished difference Result 798 states and 1424 transitions. [2019-09-08 06:29:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:35,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-08 06:29:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:35,863 INFO L225 Difference]: With dead ends: 798 [2019-09-08 06:29:35,863 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 06:29:35,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09-08 06:29:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 06:29:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 480. [2019-09-08 06:29:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-08 06:29:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 795 transitions. [2019-09-08 06:29:35,966 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 795 transitions. Word has length 39 [2019-09-08 06:29:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:35,966 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 795 transitions. [2019-09-08 06:29:35,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 795 transitions. [2019-09-08 06:29:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 06:29:35,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:35,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:35,972 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:35,972 INFO L82 PathProgramCache]: Analyzing trace with hash 963174849, now seen corresponding path program 1 times [2019-09-08 06:29:35,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:35,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:35,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:35,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:35,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:36,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:36,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:36,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:36,095 INFO L87 Difference]: Start difference. First operand 480 states and 795 transitions. Second operand 3 states. [2019-09-08 06:29:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:36,548 INFO L93 Difference]: Finished difference Result 1149 states and 1912 transitions. [2019-09-08 06:29:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:36,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-08 06:29:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:36,559 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 06:29:36,559 INFO L226 Difference]: Without dead ends: 681 [2019-09-08 06:29:36,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-08 06:29:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 668. [2019-09-08 06:29:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 06:29:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1085 transitions. [2019-09-08 06:29:36,641 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1085 transitions. Word has length 42 [2019-09-08 06:29:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:36,641 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 1085 transitions. [2019-09-08 06:29:36,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1085 transitions. [2019-09-08 06:29:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 06:29:36,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:36,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:36,644 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash -184896711, now seen corresponding path program 1 times [2019-09-08 06:29:36,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:36,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:36,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:36,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:36,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:36,772 INFO L87 Difference]: Start difference. First operand 668 states and 1085 transitions. Second operand 3 states. [2019-09-08 06:29:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:37,096 INFO L93 Difference]: Finished difference Result 1525 states and 2500 transitions. [2019-09-08 06:29:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:37,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-08 06:29:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:37,104 INFO L225 Difference]: With dead ends: 1525 [2019-09-08 06:29:37,105 INFO L226 Difference]: Without dead ends: 870 [2019-09-08 06:29:37,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-09-08 06:29:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 857. [2019-09-08 06:29:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-08 06:29:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1362 transitions. [2019-09-08 06:29:37,159 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1362 transitions. Word has length 44 [2019-09-08 06:29:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:37,160 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1362 transitions. [2019-09-08 06:29:37,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1362 transitions. [2019-09-08 06:29:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 06:29:37,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:37,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:37,163 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:37,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1239811520, now seen corresponding path program 1 times [2019-09-08 06:29:37,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:37,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:37,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:37,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:37,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:37,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:37,247 INFO L87 Difference]: Start difference. First operand 857 states and 1362 transitions. Second operand 3 states. [2019-09-08 06:29:37,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:37,593 INFO L93 Difference]: Finished difference Result 1848 states and 2982 transitions. [2019-09-08 06:29:37,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:37,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 06:29:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:37,606 INFO L225 Difference]: With dead ends: 1848 [2019-09-08 06:29:37,606 INFO L226 Difference]: Without dead ends: 1005 [2019-09-08 06:29:37,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-08 06:29:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 996. [2019-09-08 06:29:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-09-08 06:29:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1546 transitions. [2019-09-08 06:29:37,689 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1546 transitions. Word has length 49 [2019-09-08 06:29:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:37,690 INFO L475 AbstractCegarLoop]: Abstraction has 996 states and 1546 transitions. [2019-09-08 06:29:37,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1546 transitions. [2019-09-08 06:29:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 06:29:37,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:37,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:37,693 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash -704464747, now seen corresponding path program 1 times [2019-09-08 06:29:37,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:37,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:37,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:37,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:37,821 INFO L87 Difference]: Start difference. First operand 996 states and 1546 transitions. Second operand 3 states. [2019-09-08 06:29:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:38,121 INFO L93 Difference]: Finished difference Result 2126 states and 3369 transitions. [2019-09-08 06:29:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:38,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 06:29:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:38,133 INFO L225 Difference]: With dead ends: 2126 [2019-09-08 06:29:38,134 INFO L226 Difference]: Without dead ends: 1145 [2019-09-08 06:29:38,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-09-08 06:29:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1136. [2019-09-08 06:29:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2019-09-08 06:29:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1723 transitions. [2019-09-08 06:29:38,257 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1723 transitions. Word has length 51 [2019-09-08 06:29:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:38,258 INFO L475 AbstractCegarLoop]: Abstraction has 1136 states and 1723 transitions. [2019-09-08 06:29:38,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1723 transitions. [2019-09-08 06:29:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 06:29:38,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:38,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:38,263 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:38,264 INFO L82 PathProgramCache]: Analyzing trace with hash 729027308, now seen corresponding path program 1 times [2019-09-08 06:29:38,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:38,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:38,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:38,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:38,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:38,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:38,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:38,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:38,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:38,337 INFO L87 Difference]: Start difference. First operand 1136 states and 1723 transitions. Second operand 3 states. [2019-09-08 06:29:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:38,552 INFO L93 Difference]: Finished difference Result 3254 states and 5029 transitions. [2019-09-08 06:29:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:38,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 06:29:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:38,571 INFO L225 Difference]: With dead ends: 3254 [2019-09-08 06:29:38,572 INFO L226 Difference]: Without dead ends: 2139 [2019-09-08 06:29:38,579 INFO L628 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-09-08 06:29:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-09-08 06:29:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2126. [2019-09-08 06:29:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-09-08 06:29:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3233 transitions. [2019-09-08 06:29:38,756 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3233 transitions. Word has length 51 [2019-09-08 06:29:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:38,757 INFO L475 AbstractCegarLoop]: Abstraction has 2126 states and 3233 transitions. [2019-09-08 06:29:38,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3233 transitions. [2019-09-08 06:29:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 06:29:38,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:38,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:38,762 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1724529657, now seen corresponding path program 1 times [2019-09-08 06:29:38,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:38,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:38,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:38,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:38,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:38,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:38,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:38,861 INFO L87 Difference]: Start difference. First operand 2126 states and 3233 transitions. Second operand 3 states. [2019-09-08 06:29:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:39,250 INFO L93 Difference]: Finished difference Result 4494 states and 6992 transitions. [2019-09-08 06:29:39,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:39,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 06:29:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:39,270 INFO L225 Difference]: With dead ends: 4494 [2019-09-08 06:29:39,270 INFO L226 Difference]: Without dead ends: 2391 [2019-09-08 06:29:39,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-08 06:29:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-09-08 06:29:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2382. [2019-09-08 06:29:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2019-09-08 06:29:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3532 transitions. [2019-09-08 06:29:39,500 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3532 transitions. Word has length 51 [2019-09-08 06:29:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:39,500 INFO L475 AbstractCegarLoop]: Abstraction has 2382 states and 3532 transitions. [2019-09-08 06:29:39,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3532 transitions. [2019-09-08 06:29:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 06:29:39,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:39,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:39,504 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:39,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1129417961, now seen corresponding path program 1 times [2019-09-08 06:29:39,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:39,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:39,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:39,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:39,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:39,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:39,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:39,567 INFO L87 Difference]: Start difference. First operand 2382 states and 3532 transitions. Second operand 3 states. [2019-09-08 06:29:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:39,910 INFO L93 Difference]: Finished difference Result 6846 states and 10791 transitions. [2019-09-08 06:29:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:39,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 06:29:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:39,948 INFO L225 Difference]: With dead ends: 6846 [2019-09-08 06:29:39,948 INFO L226 Difference]: Without dead ends: 4489 [2019-09-08 06:29:39,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-08 06:29:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-09-08 06:29:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4454. [2019-09-08 06:29:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-09-08 06:29:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 6738 transitions. [2019-09-08 06:29:40,345 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 6738 transitions. Word has length 52 [2019-09-08 06:29:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:40,346 INFO L475 AbstractCegarLoop]: Abstraction has 4454 states and 6738 transitions. [2019-09-08 06:29:40,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 6738 transitions. [2019-09-08 06:29:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 06:29:40,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:40,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:40,350 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1665889234, now seen corresponding path program 1 times [2019-09-08 06:29:40,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:40,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:40,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:40,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:40,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:40,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:29:40,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:29:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:29:40,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:29:40,512 INFO L87 Difference]: Start difference. First operand 4454 states and 6738 transitions. Second operand 8 states. [2019-09-08 06:29:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:41,443 INFO L93 Difference]: Finished difference Result 12705 states and 20516 transitions. [2019-09-08 06:29:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:29:41,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-08 06:29:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:41,509 INFO L225 Difference]: With dead ends: 12705 [2019-09-08 06:29:41,509 INFO L226 Difference]: Without dead ends: 8280 [2019-09-08 06:29:41,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:29:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2019-09-08 06:29:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 7171. [2019-09-08 06:29:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7171 states. [2019-09-08 06:29:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 11587 transitions. [2019-09-08 06:29:42,548 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 11587 transitions. Word has length 52 [2019-09-08 06:29:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:42,548 INFO L475 AbstractCegarLoop]: Abstraction has 7171 states and 11587 transitions. [2019-09-08 06:29:42,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:29:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 11587 transitions. [2019-09-08 06:29:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 06:29:42,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:42,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:42,552 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1081550133, now seen corresponding path program 1 times [2019-09-08 06:29:42,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:42,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:42,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:42,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:29:42,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:29:42,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:29:42,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:42,631 INFO L87 Difference]: Start difference. First operand 7171 states and 11587 transitions. Second operand 4 states. [2019-09-08 06:29:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:43,195 INFO L93 Difference]: Finished difference Result 14972 states and 25123 transitions. [2019-09-08 06:29:43,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:29:43,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-09-08 06:29:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:43,273 INFO L225 Difference]: With dead ends: 14972 [2019-09-08 06:29:43,273 INFO L226 Difference]: Without dead ends: 7830 [2019-09-08 06:29:43,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:29:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2019-09-08 06:29:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 6915. [2019-09-08 06:29:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6915 states. [2019-09-08 06:29:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6915 states to 6915 states and 11203 transitions. [2019-09-08 06:29:44,176 INFO L78 Accepts]: Start accepts. Automaton has 6915 states and 11203 transitions. Word has length 53 [2019-09-08 06:29:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:44,176 INFO L475 AbstractCegarLoop]: Abstraction has 6915 states and 11203 transitions. [2019-09-08 06:29:44,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:29:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6915 states and 11203 transitions. [2019-09-08 06:29:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:29:44,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:44,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:44,186 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash 213321994, now seen corresponding path program 1 times [2019-09-08 06:29:44,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:44,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:44,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:44,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:29:44,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:29:44,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:29:44,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:44,295 INFO L87 Difference]: Start difference. First operand 6915 states and 11203 transitions. Second operand 4 states. [2019-09-08 06:29:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:45,645 INFO L93 Difference]: Finished difference Result 9971 states and 17536 transitions. [2019-09-08 06:29:45,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:29:45,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 06:29:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:45,702 INFO L225 Difference]: With dead ends: 9971 [2019-09-08 06:29:45,702 INFO L226 Difference]: Without dead ends: 9967 [2019-09-08 06:29:45,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:29:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9967 states. [2019-09-08 06:29:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9967 to 9857. [2019-09-08 06:29:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9857 states. [2019-09-08 06:29:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9857 states to 9857 states and 17361 transitions. [2019-09-08 06:29:46,629 INFO L78 Accepts]: Start accepts. Automaton has 9857 states and 17361 transitions. Word has length 63 [2019-09-08 06:29:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:46,630 INFO L475 AbstractCegarLoop]: Abstraction has 9857 states and 17361 transitions. [2019-09-08 06:29:46,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:29:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 9857 states and 17361 transitions. [2019-09-08 06:29:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:29:46,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:46,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:46,760 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:46,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1438362420, now seen corresponding path program 1 times [2019-09-08 06:29:46,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:46,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:46,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:46,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:46,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:46,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:46,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:46,812 INFO L87 Difference]: Start difference. First operand 9857 states and 17361 transitions. Second operand 3 states. [2019-09-08 06:29:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:47,347 INFO L93 Difference]: Finished difference Result 19685 states and 34686 transitions. [2019-09-08 06:29:47,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:47,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 06:29:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:47,421 INFO L225 Difference]: With dead ends: 19685 [2019-09-08 06:29:47,422 INFO L226 Difference]: Without dead ends: 9847 [2019-09-08 06:29:47,520 INFO L628 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-09-08 06:29:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9847 states. [2019-09-08 06:29:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9847 to 9847. [2019-09-08 06:29:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9847 states. [2019-09-08 06:29:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9847 states to 9847 states and 17347 transitions. [2019-09-08 06:29:48,507 INFO L78 Accepts]: Start accepts. Automaton has 9847 states and 17347 transitions. Word has length 77 [2019-09-08 06:29:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:48,508 INFO L475 AbstractCegarLoop]: Abstraction has 9847 states and 17347 transitions. [2019-09-08 06:29:48,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 9847 states and 17347 transitions. [2019-09-08 06:29:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:29:48,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:48,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:48,532 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:48,532 INFO L82 PathProgramCache]: Analyzing trace with hash -945736246, now seen corresponding path program 1 times [2019-09-08 06:29:48,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:48,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:48,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:48,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:48,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:48,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:48,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:48,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:48,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:48,605 INFO L87 Difference]: Start difference. First operand 9847 states and 17347 transitions. Second operand 3 states. [2019-09-08 06:29:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:49,227 INFO L93 Difference]: Finished difference Result 16612 states and 31428 transitions. [2019-09-08 06:29:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:49,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 06:29:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:49,288 INFO L225 Difference]: With dead ends: 16612 [2019-09-08 06:29:49,288 INFO L226 Difference]: Without dead ends: 9527 [2019-09-08 06:29:49,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-09-08 06:29:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9527 states. [2019-09-08 06:29:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9527 to 9495. [2019-09-08 06:29:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9495 states. [2019-09-08 06:29:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9495 states to 9495 states and 16786 transitions. [2019-09-08 06:29:50,480 INFO L78 Accepts]: Start accepts. Automaton has 9495 states and 16786 transitions. Word has length 77 [2019-09-08 06:29:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:50,480 INFO L475 AbstractCegarLoop]: Abstraction has 9495 states and 16786 transitions. [2019-09-08 06:29:50,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 9495 states and 16786 transitions. [2019-09-08 06:29:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 06:29:50,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:50,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:50,504 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1333786741, now seen corresponding path program 1 times [2019-09-08 06:29:50,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:50,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:50,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:50,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:50,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:50,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:50,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:50,564 INFO L87 Difference]: Start difference. First operand 9495 states and 16786 transitions. Second operand 3 states. [2019-09-08 06:29:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:51,260 INFO L93 Difference]: Finished difference Result 16248 states and 30682 transitions. [2019-09-08 06:29:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:51,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 06:29:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:51,327 INFO L225 Difference]: With dead ends: 16248 [2019-09-08 06:29:51,328 INFO L226 Difference]: Without dead ends: 9515 [2019-09-08 06:29:51,416 INFO L628 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-09-08 06:29:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9515 states. [2019-09-08 06:29:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9515 to 9495. [2019-09-08 06:29:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9495 states. [2019-09-08 06:29:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9495 states to 9495 states and 16712 transitions. [2019-09-08 06:29:53,088 INFO L78 Accepts]: Start accepts. Automaton has 9495 states and 16712 transitions. Word has length 79 [2019-09-08 06:29:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:53,089 INFO L475 AbstractCegarLoop]: Abstraction has 9495 states and 16712 transitions. [2019-09-08 06:29:53,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9495 states and 16712 transitions. [2019-09-08 06:29:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:29:53,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:53,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:53,108 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2096221435, now seen corresponding path program 1 times [2019-09-08 06:29:53,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:53,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:53,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:53,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:29:53,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:29:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:29:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:53,199 INFO L87 Difference]: Start difference. First operand 9495 states and 16712 transitions. Second operand 4 states. [2019-09-08 06:29:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:54,056 INFO L93 Difference]: Finished difference Result 18799 states and 34961 transitions. [2019-09-08 06:29:54,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:29:54,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-08 06:29:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:54,116 INFO L225 Difference]: With dead ends: 18799 [2019-09-08 06:29:54,116 INFO L226 Difference]: Without dead ends: 9323 [2019-09-08 06:29:54,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:29:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9323 states. [2019-09-08 06:29:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9323 to 8386. [2019-09-08 06:29:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8386 states. [2019-09-08 06:29:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8386 states to 8386 states and 14213 transitions. [2019-09-08 06:29:55,039 INFO L78 Accepts]: Start accepts. Automaton has 8386 states and 14213 transitions. Word has length 77 [2019-09-08 06:29:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:55,039 INFO L475 AbstractCegarLoop]: Abstraction has 8386 states and 14213 transitions. [2019-09-08 06:29:55,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:29:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8386 states and 14213 transitions. [2019-09-08 06:29:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 06:29:55,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:55,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:55,046 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:55,046 INFO L82 PathProgramCache]: Analyzing trace with hash -303937263, now seen corresponding path program 1 times [2019-09-08 06:29:55,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:55,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:55,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:55,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 06:29:55,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:29:55,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:29:55,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:29:55,154 INFO L87 Difference]: Start difference. First operand 8386 states and 14213 transitions. Second operand 9 states. [2019-09-08 06:30:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:00,044 INFO L93 Difference]: Finished difference Result 23319 states and 68852 transitions. [2019-09-08 06:30:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 06:30:00,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 06:30:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:00,214 INFO L225 Difference]: With dead ends: 23319 [2019-09-08 06:30:00,214 INFO L226 Difference]: Without dead ends: 16014 [2019-09-08 06:30:00,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2019-09-08 06:30:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-09-08 06:30:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 13600. [2019-09-08 06:30:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2019-09-08 06:30:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 40150 transitions. [2019-09-08 06:30:03,728 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 40150 transitions. Word has length 80 [2019-09-08 06:30:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:03,729 INFO L475 AbstractCegarLoop]: Abstraction has 13600 states and 40150 transitions. [2019-09-08 06:30:03,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:30:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 40150 transitions. [2019-09-08 06:30:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 06:30:03,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:03,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:03,752 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1810711992, now seen corresponding path program 1 times [2019-09-08 06:30:03,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:03,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:03,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:03,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:30:03,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:30:03,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:30:03,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:30:03,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:30:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:30:03,897 INFO L87 Difference]: Start difference. First operand 13600 states and 40150 transitions. Second operand 8 states. [2019-09-08 06:30:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:07,297 INFO L93 Difference]: Finished difference Result 33683 states and 139614 transitions. [2019-09-08 06:30:07,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:30:07,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-09-08 06:30:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:07,583 INFO L225 Difference]: With dead ends: 33683 [2019-09-08 06:30:07,584 INFO L226 Difference]: Without dead ends: 21562 [2019-09-08 06:30:08,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:30:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21562 states. [2019-09-08 06:30:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21562 to 19514. [2019-09-08 06:30:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19514 states. [2019-09-08 06:30:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19514 states to 19514 states and 74952 transitions. [2019-09-08 06:30:15,041 INFO L78 Accepts]: Start accepts. Automaton has 19514 states and 74952 transitions. Word has length 81 [2019-09-08 06:30:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:15,042 INFO L475 AbstractCegarLoop]: Abstraction has 19514 states and 74952 transitions. [2019-09-08 06:30:15,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:30:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 19514 states and 74952 transitions. [2019-09-08 06:30:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 06:30:15,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:15,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:15,060 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -396744736, now seen corresponding path program 1 times [2019-09-08 06:30:15,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:15,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:15,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:15,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:15,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:30:15,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:30:15,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:30:15,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:30:15,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:30:15,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:30:15,154 INFO L87 Difference]: Start difference. First operand 19514 states and 74952 transitions. Second operand 8 states. [2019-09-08 06:30:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:23,205 INFO L93 Difference]: Finished difference Result 57259 states and 341175 transitions. [2019-09-08 06:30:23,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:30:23,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-09-08 06:30:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:23,780 INFO L225 Difference]: With dead ends: 57259 [2019-09-08 06:30:23,780 INFO L226 Difference]: Without dead ends: 37763 [2019-09-08 06:30:29,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:30:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37763 states. [2019-09-08 06:30:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37763 to 31400. [2019-09-08 06:30:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31400 states. [2019-09-08 06:30:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31400 states to 31400 states and 146820 transitions. [2019-09-08 06:30:44,346 INFO L78 Accepts]: Start accepts. Automaton has 31400 states and 146820 transitions. Word has length 86 [2019-09-08 06:30:44,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:44,347 INFO L475 AbstractCegarLoop]: Abstraction has 31400 states and 146820 transitions. [2019-09-08 06:30:44,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:30:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 31400 states and 146820 transitions. [2019-09-08 06:30:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 06:30:44,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:44,364 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:44,364 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:44,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1124105256, now seen corresponding path program 1 times [2019-09-08 06:30:44,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:44,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:30:44,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:30:44,431 INFO L223 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-09-08 06:30:44,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:44,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:30:44,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:30:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:30:44,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:30:44,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:30:44,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:30:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:30:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:30:44,730 INFO L87 Difference]: Start difference. First operand 31400 states and 146820 transitions. Second operand 6 states. [2019-09-08 06:30:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:56,298 INFO L93 Difference]: Finished difference Result 65665 states and 343883 transitions. [2019-09-08 06:30:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:30:56,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 06:30:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:56,928 INFO L225 Difference]: With dead ends: 65665 [2019-09-08 06:30:56,928 INFO L226 Difference]: Without dead ends: 33570 [2019-09-08 06:30:59,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:30:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33570 states. [2019-09-08 06:31:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33570 to 29358. [2019-09-08 06:31:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29358 states. [2019-09-08 06:31:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29358 states to 29358 states and 97311 transitions. [2019-09-08 06:31:08,085 INFO L78 Accepts]: Start accepts. Automaton has 29358 states and 97311 transitions. Word has length 91 [2019-09-08 06:31:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:31:08,085 INFO L475 AbstractCegarLoop]: Abstraction has 29358 states and 97311 transitions. [2019-09-08 06:31:08,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:31:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29358 states and 97311 transitions. [2019-09-08 06:31:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 06:31:08,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:31:08,104 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:31:08,104 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:31:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:31:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 303456585, now seen corresponding path program 1 times [2019-09-08 06:31:08,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:31:08,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:31:08,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:08,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:31:08,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:31:08,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:31:08,228 INFO L223 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-09-08 06:31:08,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:31:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:08,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:31:08,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:31:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:31:08,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:31:08,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 06:31:08,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:31:08,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:31:08,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:31:08,604 INFO L87 Difference]: Start difference. First operand 29358 states and 97311 transitions. Second operand 8 states. [2019-09-08 06:31:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:31:20,445 INFO L93 Difference]: Finished difference Result 65331 states and 293202 transitions. [2019-09-08 06:31:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:31:20,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-09-08 06:31:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:31:21,043 INFO L225 Difference]: With dead ends: 65331 [2019-09-08 06:31:21,044 INFO L226 Difference]: Without dead ends: 36266 [2019-09-08 06:31:22,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-09-08 06:31:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36266 states. [2019-09-08 06:31:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36266 to 34642. [2019-09-08 06:31:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34642 states. [2019-09-08 06:31:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34642 states to 34642 states and 133638 transitions. [2019-09-08 06:31:31,343 INFO L78 Accepts]: Start accepts. Automaton has 34642 states and 133638 transitions. Word has length 109 [2019-09-08 06:31:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:31:31,343 INFO L475 AbstractCegarLoop]: Abstraction has 34642 states and 133638 transitions. [2019-09-08 06:31:31,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:31:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34642 states and 133638 transitions. [2019-09-08 06:31:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 06:31:31,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:31:31,355 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:31:31,355 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:31:31,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:31:31,356 INFO L82 PathProgramCache]: Analyzing trace with hash -304340132, now seen corresponding path program 1 times [2019-09-08 06:31:31,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:31:31,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:31:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:31,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:31:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:31:31,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:31:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:31:31,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:31:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:31:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:31:31,432 INFO L87 Difference]: Start difference. First operand 34642 states and 133638 transitions. Second operand 3 states. [2019-09-08 06:31:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:31:40,384 INFO L93 Difference]: Finished difference Result 66981 states and 365545 transitions. [2019-09-08 06:31:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:31:40,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 06:31:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:31:40,914 INFO L225 Difference]: With dead ends: 66981 [2019-09-08 06:31:40,914 INFO L226 Difference]: Without dead ends: 32643 [2019-09-08 06:31:43,158 INFO L628 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-09-08 06:31:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32643 states. [2019-09-08 06:31:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32643 to 28755. [2019-09-08 06:31:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28755 states. [2019-09-08 06:31:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28755 states to 28755 states and 89808 transitions. [2019-09-08 06:31:57,089 INFO L78 Accepts]: Start accepts. Automaton has 28755 states and 89808 transitions. Word has length 118 [2019-09-08 06:31:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:31:57,090 INFO L475 AbstractCegarLoop]: Abstraction has 28755 states and 89808 transitions. [2019-09-08 06:31:57,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:31:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28755 states and 89808 transitions. [2019-09-08 06:31:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 06:31:57,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:31:57,101 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:31:57,101 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:31:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:31:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1895238982, now seen corresponding path program 1 times [2019-09-08 06:31:57,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:31:57,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:31:57,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:57,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:31:57,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:31:57,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:31:57,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:31:57,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:31:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:57,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:31:57,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:31:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:31:57,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:31:57,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-08 06:31:57,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:31:57,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:31:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:31:57,525 INFO L87 Difference]: Start difference. First operand 28755 states and 89808 transitions. Second operand 8 states. [2019-09-08 06:32:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:05,554 INFO L93 Difference]: Finished difference Result 61348 states and 225682 transitions. [2019-09-08 06:32:05,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 06:32:05,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-09-08 06:32:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:05,899 INFO L225 Difference]: With dead ends: 61348 [2019-09-08 06:32:05,899 INFO L226 Difference]: Without dead ends: 32682 [2019-09-08 06:32:06,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:32:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32682 states. [2019-09-08 06:32:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32682 to 29518. [2019-09-08 06:32:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29518 states. [2019-09-08 06:32:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29518 states to 29518 states and 84952 transitions. [2019-09-08 06:32:13,023 INFO L78 Accepts]: Start accepts. Automaton has 29518 states and 84952 transitions. Word has length 123 [2019-09-08 06:32:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:13,023 INFO L475 AbstractCegarLoop]: Abstraction has 29518 states and 84952 transitions. [2019-09-08 06:32:13,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:32:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 29518 states and 84952 transitions. [2019-09-08 06:32:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 06:32:13,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:13,036 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:32:13,037 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:13,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1761212704, now seen corresponding path program 1 times [2019-09-08 06:32:13,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:13,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:13,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:13,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:32:13,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:32:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:32:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:32:13,117 INFO L87 Difference]: Start difference. First operand 29518 states and 84952 transitions. Second operand 6 states. [2019-09-08 06:32:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:22,688 INFO L93 Difference]: Finished difference Result 70490 states and 270156 transitions. [2019-09-08 06:32:22,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:32:22,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-08 06:32:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:23,121 INFO L225 Difference]: With dead ends: 70490 [2019-09-08 06:32:23,122 INFO L226 Difference]: Without dead ends: 41187 [2019-09-08 06:32:23,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:32:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41187 states. [2019-09-08 06:32:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41187 to 40438. [2019-09-08 06:32:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40438 states. [2019-09-08 06:32:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40438 states to 40438 states and 129628 transitions. [2019-09-08 06:32:31,985 INFO L78 Accepts]: Start accepts. Automaton has 40438 states and 129628 transitions. Word has length 164 [2019-09-08 06:32:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:31,985 INFO L475 AbstractCegarLoop]: Abstraction has 40438 states and 129628 transitions. [2019-09-08 06:32:31,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:32:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 40438 states and 129628 transitions. [2019-09-08 06:32:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 06:32:32,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:32,002 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:32:32,002 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash 497411734, now seen corresponding path program 1 times [2019-09-08 06:32:32,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:32,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:32,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:32,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 06:32:32,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:32:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:32:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:32:32,158 INFO L87 Difference]: Start difference. First operand 40438 states and 129628 transitions. Second operand 9 states. [2019-09-08 06:32:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:53,322 INFO L93 Difference]: Finished difference Result 106718 states and 663294 transitions. [2019-09-08 06:32:53,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 06:32:53,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-09-08 06:32:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:54,374 INFO L225 Difference]: With dead ends: 106718 [2019-09-08 06:32:54,374 INFO L226 Difference]: Without dead ends: 66333 [2019-09-08 06:32:57,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=1603, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 06:32:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66333 states. [2019-09-08 06:33:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66333 to 58725. [2019-09-08 06:33:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58725 states. [2019-09-08 06:33:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58725 states to 58725 states and 213277 transitions. [2019-09-08 06:33:27,448 INFO L78 Accepts]: Start accepts. Automaton has 58725 states and 213277 transitions. Word has length 170 [2019-09-08 06:33:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:27,449 INFO L475 AbstractCegarLoop]: Abstraction has 58725 states and 213277 transitions. [2019-09-08 06:33:27,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:33:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 58725 states and 213277 transitions. [2019-09-08 06:33:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 06:33:27,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:27,470 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:27,470 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1859751264, now seen corresponding path program 1 times [2019-09-08 06:33:27,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:27,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:33:27,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:27,587 INFO L223 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-09-08 06:33:27,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:27,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:33:27,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:33:27,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:33:27,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:33:27,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:33:27,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:33:27,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:33:27,843 INFO L87 Difference]: Start difference. First operand 58725 states and 213277 transitions. Second operand 7 states. [2019-09-08 06:33:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:39,543 INFO L93 Difference]: Finished difference Result 111527 states and 454168 transitions. [2019-09-08 06:33:39,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:33:39,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2019-09-08 06:33:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:40,312 INFO L225 Difference]: With dead ends: 111527 [2019-09-08 06:33:40,312 INFO L226 Difference]: Without dead ends: 52835 [2019-09-08 06:33:53,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:33:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52835 states. [2019-09-08 06:34:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52835 to 50978. [2019-09-08 06:34:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50978 states. [2019-09-08 06:34:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50978 states to 50978 states and 148548 transitions. [2019-09-08 06:34:01,209 INFO L78 Accepts]: Start accepts. Automaton has 50978 states and 148548 transitions. Word has length 178 [2019-09-08 06:34:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:34:01,210 INFO L475 AbstractCegarLoop]: Abstraction has 50978 states and 148548 transitions. [2019-09-08 06:34:01,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:34:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 50978 states and 148548 transitions. [2019-09-08 06:34:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 06:34:01,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:34:01,220 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:34:01,220 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:34:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:34:01,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1421743448, now seen corresponding path program 1 times [2019-09-08 06:34:01,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:34:01,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:34:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:01,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:34:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:34:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:34:01,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:34:01,350 INFO L223 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-09-08 06:34:01,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:34:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:34:01,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:34:01,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:34:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 06:34:02,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:34:02,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-08 06:34:02,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:34:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:34:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:34:02,029 INFO L87 Difference]: Start difference. First operand 50978 states and 148548 transitions. Second operand 10 states. [2019-09-08 06:34:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:34:19,962 INFO L93 Difference]: Finished difference Result 96314 states and 472082 transitions. [2019-09-08 06:34:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 06:34:19,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 181 [2019-09-08 06:34:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:34:21,232 INFO L225 Difference]: With dead ends: 96314 [2019-09-08 06:34:21,232 INFO L226 Difference]: Without dead ends: 39830 [2019-09-08 06:34:23,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=553, Invalid=2309, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 06:34:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39830 states. [2019-09-08 06:34:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39830 to 31708. [2019-09-08 06:34:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31708 states. [2019-09-08 06:34:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31708 states to 31708 states and 67326 transitions. [2019-09-08 06:34:37,418 INFO L78 Accepts]: Start accepts. Automaton has 31708 states and 67326 transitions. Word has length 181 [2019-09-08 06:34:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:34:37,418 INFO L475 AbstractCegarLoop]: Abstraction has 31708 states and 67326 transitions. [2019-09-08 06:34:37,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:34:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 31708 states and 67326 transitions. [2019-09-08 06:34:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 06:34:37,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:34:37,424 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:34:37,424 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:34:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:34:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1867326358, now seen corresponding path program 1 times [2019-09-08 06:34:37,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:34:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:34:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:34:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:34:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:34:37,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:34:37,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:34:37,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:34:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:34:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:34:37,738 INFO L87 Difference]: Start difference. First operand 31708 states and 67326 transitions. Second operand 3 states. [2019-09-08 06:34:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:34:39,768 INFO L93 Difference]: Finished difference Result 43601 states and 94799 transitions. [2019-09-08 06:34:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:34:39,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 06:34:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:34:40,179 INFO L225 Difference]: With dead ends: 43601 [2019-09-08 06:34:40,180 INFO L226 Difference]: Without dead ends: 28174 [2019-09-08 06:34:40,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-08 06:34:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28174 states. [2019-09-08 06:34:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28174 to 27718. [2019-09-08 06:34:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27718 states. [2019-09-08 06:34:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27718 states to 27718 states and 56045 transitions. [2019-09-08 06:34:43,703 INFO L78 Accepts]: Start accepts. Automaton has 27718 states and 56045 transitions. Word has length 183 [2019-09-08 06:34:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:34:43,703 INFO L475 AbstractCegarLoop]: Abstraction has 27718 states and 56045 transitions. [2019-09-08 06:34:43,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:34:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27718 states and 56045 transitions. [2019-09-08 06:34:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 06:34:43,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:34:43,708 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:34:43,708 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:34:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:34:43,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2051304813, now seen corresponding path program 1 times [2019-09-08 06:34:43,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:34:43,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:34:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:43,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:34:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:34:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:34:43,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:34:43,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:34:43,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:34:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:34:43,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:34:43,785 INFO L87 Difference]: Start difference. First operand 27718 states and 56045 transitions. Second operand 3 states. [2019-09-08 06:34:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:34:45,726 INFO L93 Difference]: Finished difference Result 47717 states and 103670 transitions. [2019-09-08 06:34:45,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:34:45,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 06:34:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:34:45,987 INFO L225 Difference]: With dead ends: 47717 [2019-09-08 06:34:45,987 INFO L226 Difference]: Without dead ends: 20375 [2019-09-08 06:34:46,230 INFO L628 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-09-08 06:34:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20375 states. [2019-09-08 06:34:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20375 to 20027. [2019-09-08 06:34:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20027 states. [2019-09-08 06:34:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20027 states to 20027 states and 36459 transitions. [2019-09-08 06:34:48,181 INFO L78 Accepts]: Start accepts. Automaton has 20027 states and 36459 transitions. Word has length 186 [2019-09-08 06:34:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:34:48,181 INFO L475 AbstractCegarLoop]: Abstraction has 20027 states and 36459 transitions. [2019-09-08 06:34:48,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:34:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20027 states and 36459 transitions. [2019-09-08 06:34:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:34:48,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:34:48,184 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:34:48,185 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:34:48,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:34:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1629100025, now seen corresponding path program 1 times [2019-09-08 06:34:48,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:34:48,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:34:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:48,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:34:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:34:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:34:48,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:34:48,468 INFO L223 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-09-08 06:34:48,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:34:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:34:48,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 06:34:48,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:34:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:34:48,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:34:48,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 18 [2019-09-08 06:34:48,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 06:34:48,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 06:34:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:34:48,787 INFO L87 Difference]: Start difference. First operand 20027 states and 36459 transitions. Second operand 18 states. [2019-09-08 06:34:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:34:56,762 INFO L93 Difference]: Finished difference Result 47718 states and 96432 transitions. [2019-09-08 06:34:56,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 06:34:56,763 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 189 [2019-09-08 06:34:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:34:57,735 INFO L225 Difference]: With dead ends: 47718 [2019-09-08 06:34:57,735 INFO L226 Difference]: Without dead ends: 27741 [2019-09-08 06:34:57,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=445, Invalid=3215, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 06:34:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27741 states. [2019-09-08 06:35:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27741 to 25670. [2019-09-08 06:35:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25670 states. [2019-09-08 06:35:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25670 states to 25670 states and 46850 transitions. [2019-09-08 06:35:00,324 INFO L78 Accepts]: Start accepts. Automaton has 25670 states and 46850 transitions. Word has length 189 [2019-09-08 06:35:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:00,325 INFO L475 AbstractCegarLoop]: Abstraction has 25670 states and 46850 transitions. [2019-09-08 06:35:00,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 06:35:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 25670 states and 46850 transitions. [2019-09-08 06:35:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 06:35:00,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:00,328 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:00,328 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:00,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1634638466, now seen corresponding path program 1 times [2019-09-08 06:35:00,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:00,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:00,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 78 proven. 77 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:35:00,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:00,528 INFO L223 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-09-08 06:35:00,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:00,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:35:00,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 118 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:35:01,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:35:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-09-08 06:35:01,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:35:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:35:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:35:01,659 INFO L87 Difference]: Start difference. First operand 25670 states and 46850 transitions. Second operand 20 states. [2019-09-08 06:35:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:12,482 INFO L93 Difference]: Finished difference Result 41847 states and 88033 transitions. [2019-09-08 06:35:12,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 06:35:12,483 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 259 [2019-09-08 06:35:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:12,814 INFO L225 Difference]: With dead ends: 41847 [2019-09-08 06:35:12,815 INFO L226 Difference]: Without dead ends: 35320 [2019-09-08 06:35:12,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1377, Invalid=6633, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 06:35:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35320 states. [2019-09-08 06:35:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35320 to 29528. [2019-09-08 06:35:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29528 states. [2019-09-08 06:35:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29528 states to 29528 states and 52400 transitions. [2019-09-08 06:35:16,545 INFO L78 Accepts]: Start accepts. Automaton has 29528 states and 52400 transitions. Word has length 259 [2019-09-08 06:35:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:16,546 INFO L475 AbstractCegarLoop]: Abstraction has 29528 states and 52400 transitions. [2019-09-08 06:35:16,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:35:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 29528 states and 52400 transitions. [2019-09-08 06:35:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 06:35:16,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:16,550 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:16,550 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:16,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1844406537, now seen corresponding path program 1 times [2019-09-08 06:35:16,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:16,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:16,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:16,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:16,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 50 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 06:35:16,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:16,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:35:16,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:16,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 06:35:16,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 06:35:17,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:35:17,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-08 06:35:17,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:35:17,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:35:17,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:35:17,033 INFO L87 Difference]: Start difference. First operand 29528 states and 52400 transitions. Second operand 12 states. [2019-09-08 06:35:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:21,133 INFO L93 Difference]: Finished difference Result 41817 states and 78180 transitions. [2019-09-08 06:35:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 06:35:21,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 260 [2019-09-08 06:35:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:21,303 INFO L225 Difference]: With dead ends: 41817 [2019-09-08 06:35:21,303 INFO L226 Difference]: Without dead ends: 8086 [2019-09-08 06:35:21,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 06:35:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8086 states. [2019-09-08 06:35:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8086 to 5238. [2019-09-08 06:35:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5238 states. [2019-09-08 06:35:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 6914 transitions. [2019-09-08 06:35:21,876 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 6914 transitions. Word has length 260 [2019-09-08 06:35:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:21,876 INFO L475 AbstractCegarLoop]: Abstraction has 5238 states and 6914 transitions. [2019-09-08 06:35:21,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:35:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 6914 transitions. [2019-09-08 06:35:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 06:35:21,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:21,878 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:21,879 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1694393701, now seen corresponding path program 1 times [2019-09-08 06:35:21,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:21,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 58 proven. 97 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 06:35:22,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:22,799 INFO L223 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-09-08 06:35:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:23,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 2060 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 06:35:23,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 14 proven. 184 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:35:23,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:35:23,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 27 [2019-09-08 06:35:23,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 06:35:23,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 06:35:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2019-09-08 06:35:23,480 INFO L87 Difference]: Start difference. First operand 5238 states and 6914 transitions. Second operand 27 states. [2019-09-08 06:35:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:35,498 INFO L93 Difference]: Finished difference Result 13615 states and 19391 transitions. [2019-09-08 06:35:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 06:35:35,498 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 299 [2019-09-08 06:35:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:35,636 INFO L225 Difference]: With dead ends: 13615 [2019-09-08 06:35:35,636 INFO L226 Difference]: Without dead ends: 8567 [2019-09-08 06:35:35,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3913 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1385, Invalid=11047, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 06:35:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2019-09-08 06:35:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 7043. [2019-09-08 06:35:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7043 states. [2019-09-08 06:35:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 9328 transitions. [2019-09-08 06:35:36,697 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 9328 transitions. Word has length 299 [2019-09-08 06:35:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:36,698 INFO L475 AbstractCegarLoop]: Abstraction has 7043 states and 9328 transitions. [2019-09-08 06:35:36,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 06:35:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 9328 transitions. [2019-09-08 06:35:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:35:36,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:36,701 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:36,701 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:36,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1058545914, now seen corresponding path program 1 times [2019-09-08 06:35:36,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:36,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:36,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-08 06:35:36,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:36,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:35:36,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:35:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:35:36,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:35:36,880 INFO L87 Difference]: Start difference. First operand 7043 states and 9328 transitions. Second operand 3 states. [2019-09-08 06:35:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:37,138 INFO L93 Difference]: Finished difference Result 8718 states and 11703 transitions. [2019-09-08 06:35:37,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:37,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2019-09-08 06:35:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:37,162 INFO L225 Difference]: With dead ends: 8718 [2019-09-08 06:35:37,162 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 06:35:37,181 INFO L628 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-09-08 06:35:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 06:35:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1434. [2019-09-08 06:35:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-09-08 06:35:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1665 transitions. [2019-09-08 06:35:37,293 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1665 transitions. Word has length 411 [2019-09-08 06:35:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:37,293 INFO L475 AbstractCegarLoop]: Abstraction has 1434 states and 1665 transitions. [2019-09-08 06:35:37,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1665 transitions. [2019-09-08 06:35:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 06:35:37,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:37,296 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:37,296 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -387117494, now seen corresponding path program 1 times [2019-09-08 06:35:37,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:37,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:37,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:37,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:37,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-08 06:35:37,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:37,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:35:37,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:35:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:35:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:35:37,516 INFO L87 Difference]: Start difference. First operand 1434 states and 1665 transitions. Second operand 8 states. [2019-09-08 06:35:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:38,158 INFO L93 Difference]: Finished difference Result 1867 states and 2192 transitions. [2019-09-08 06:35:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:35:38,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 412 [2019-09-08 06:35:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:38,167 INFO L225 Difference]: With dead ends: 1867 [2019-09-08 06:35:38,168 INFO L226 Difference]: Without dead ends: 1439 [2019-09-08 06:35:38,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:35:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-09-08 06:35:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1432. [2019-09-08 06:35:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-09-08 06:35:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1660 transitions. [2019-09-08 06:35:38,291 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1660 transitions. Word has length 412 [2019-09-08 06:35:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:38,292 INFO L475 AbstractCegarLoop]: Abstraction has 1432 states and 1660 transitions. [2019-09-08 06:35:38,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:35:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1660 transitions. [2019-09-08 06:35:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 06:35:38,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:38,295 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:38,295 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash -94331857, now seen corresponding path program 1 times [2019-09-08 06:35:38,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:38,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-08 06:35:38,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:38,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:35:38,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:35:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:35:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:35:38,479 INFO L87 Difference]: Start difference. First operand 1432 states and 1660 transitions. Second operand 5 states. [2019-09-08 06:35:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:38,628 INFO L93 Difference]: Finished difference Result 1844 states and 2171 transitions. [2019-09-08 06:35:38,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:35:38,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 413 [2019-09-08 06:35:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:38,636 INFO L225 Difference]: With dead ends: 1844 [2019-09-08 06:35:38,636 INFO L226 Difference]: Without dead ends: 1413 [2019-09-08 06:35:38,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:35:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-09-08 06:35:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2019-09-08 06:35:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-09-08 06:35:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1631 transitions. [2019-09-08 06:35:38,736 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1631 transitions. Word has length 413 [2019-09-08 06:35:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:38,737 INFO L475 AbstractCegarLoop]: Abstraction has 1413 states and 1631 transitions. [2019-09-08 06:35:38,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:35:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1631 transitions. [2019-09-08 06:35:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 06:35:38,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:38,742 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:38,742 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:38,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1340195737, now seen corresponding path program 1 times [2019-09-08 06:35:38,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:38,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:38,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:38,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:38,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 68 proven. 239 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-09-08 06:35:39,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:39,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:39,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:40,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 06:35:40,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 121 proven. 218 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 06:35:40,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:35:40,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 46 [2019-09-08 06:35:40,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 06:35:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 06:35:40,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 06:35:40,777 INFO L87 Difference]: Start difference. First operand 1413 states and 1631 transitions. Second operand 46 states. [2019-09-08 06:35:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:51,459 INFO L93 Difference]: Finished difference Result 1618 states and 1871 transitions. [2019-09-08 06:35:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 06:35:51,459 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 476 [2019-09-08 06:35:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:51,465 INFO L225 Difference]: With dead ends: 1618 [2019-09-08 06:35:51,465 INFO L226 Difference]: Without dead ends: 1615 [2019-09-08 06:35:51,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2858 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=925, Invalid=9377, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 06:35:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2019-09-08 06:35:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1544. [2019-09-08 06:35:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-08 06:35:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1780 transitions. [2019-09-08 06:35:51,856 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1780 transitions. Word has length 476 [2019-09-08 06:35:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:51,856 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 1780 transitions. [2019-09-08 06:35:51,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 06:35:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1780 transitions. [2019-09-08 06:35:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-09-08 06:35:51,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:51,860 INFO L399 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:51,860 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash -819354520, now seen corresponding path program 1 times [2019-09-08 06:35:51,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:51,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:51,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 140 proven. 114 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-09-08 06:35:52,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:52,298 INFO L223 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-09-08 06:35:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:52,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 2969 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 06:35:52,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 239 proven. 55 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-09-08 06:35:52,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:35:52,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 16 [2019-09-08 06:35:52,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 06:35:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 06:35:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:35:52,872 INFO L87 Difference]: Start difference. First operand 1544 states and 1780 transitions. Second operand 16 states. [2019-09-08 06:35:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:56,329 INFO L93 Difference]: Finished difference Result 2219 states and 2623 transitions. [2019-09-08 06:35:56,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 06:35:56,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 529 [2019-09-08 06:35:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:56,345 INFO L225 Difference]: With dead ends: 2219 [2019-09-08 06:35:56,345 INFO L226 Difference]: Without dead ends: 1827 [2019-09-08 06:35:56,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 551 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=1874, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 06:35:56,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-09-08 06:35:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1657. [2019-09-08 06:35:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2019-09-08 06:35:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1916 transitions. [2019-09-08 06:35:56,474 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 1916 transitions. Word has length 529 [2019-09-08 06:35:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:56,474 INFO L475 AbstractCegarLoop]: Abstraction has 1657 states and 1916 transitions. [2019-09-08 06:35:56,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 06:35:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 1916 transitions. [2019-09-08 06:35:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-09-08 06:35:56,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:56,480 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:56,481 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash -506733779, now seen corresponding path program 1 times [2019-09-08 06:35:56,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:56,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 278 proven. 418 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-08 06:35:57,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:57,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:58,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 3221 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 06:35:58,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:36:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 197 proven. 593 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 06:36:00,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:36:00,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 61 [2019-09-08 06:36:00,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 06:36:00,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 06:36:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3493, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 06:36:00,078 INFO L87 Difference]: Start difference. First operand 1657 states and 1916 transitions. Second operand 61 states. [2019-09-08 06:36:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:23,477 INFO L93 Difference]: Finished difference Result 1967 states and 2324 transitions. [2019-09-08 06:36:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 06:36:23,478 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 594 [2019-09-08 06:36:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:23,490 INFO L225 Difference]: With dead ends: 1967 [2019-09-08 06:36:23,490 INFO L226 Difference]: Without dead ends: 1964 [2019-09-08 06:36:23,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 629 SyntacticMatches, 7 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6518 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1715, Invalid=22465, Unknown=0, NotChecked=0, Total=24180 [2019-09-08 06:36:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-09-08 06:36:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1860. [2019-09-08 06:36:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-09-08 06:36:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2191 transitions. [2019-09-08 06:36:23,652 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2191 transitions. Word has length 594 [2019-09-08 06:36:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:23,653 INFO L475 AbstractCegarLoop]: Abstraction has 1860 states and 2191 transitions. [2019-09-08 06:36:23,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 06:36:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2191 transitions. [2019-09-08 06:36:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-09-08 06:36:23,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:23,658 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:23,658 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash -117000862, now seen corresponding path program 1 times [2019-09-08 06:36:23,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:23,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 391 proven. 43 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-09-08 06:36:24,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:36:24,370 INFO L223 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-09-08 06:36:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:24,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 3429 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 06:36:24,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:36:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 404 proven. 195 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-08 06:36:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:36:25,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 27 [2019-09-08 06:36:25,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 06:36:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 06:36:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2019-09-08 06:36:25,528 INFO L87 Difference]: Start difference. First operand 1860 states and 2191 transitions. Second operand 27 states. [2019-09-08 06:36:28,395 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2019-09-08 06:36:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:31,010 INFO L93 Difference]: Finished difference Result 2314 states and 2779 transitions. [2019-09-08 06:36:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 06:36:31,011 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 647 [2019-09-08 06:36:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:31,025 INFO L225 Difference]: With dead ends: 2314 [2019-09-08 06:36:31,025 INFO L226 Difference]: Without dead ends: 1755 [2019-09-08 06:36:31,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 662 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=575, Invalid=5125, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 06:36:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-08 06:36:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1632. [2019-09-08 06:36:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2019-09-08 06:36:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 1889 transitions. [2019-09-08 06:36:31,162 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 1889 transitions. Word has length 647 [2019-09-08 06:36:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:31,163 INFO L475 AbstractCegarLoop]: Abstraction has 1632 states and 1889 transitions. [2019-09-08 06:36:31,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 06:36:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1889 transitions. [2019-09-08 06:36:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2019-09-08 06:36:31,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:31,170 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:31,170 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash 783308756, now seen corresponding path program 1 times [2019-09-08 06:36:31,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:31,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2019-09-08 06:36:31,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:36:31,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:36:31,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:36:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:36:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:36:31,496 INFO L87 Difference]: Start difference. First operand 1632 states and 1889 transitions. Second operand 3 states. [2019-09-08 06:36:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:31,881 INFO L93 Difference]: Finished difference Result 3924 states and 4653 transitions. [2019-09-08 06:36:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:36:31,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 740 [2019-09-08 06:36:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:31,907 INFO L225 Difference]: With dead ends: 3924 [2019-09-08 06:36:31,907 INFO L226 Difference]: Without dead ends: 2314 [2019-09-08 06:36:31,911 INFO L628 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-09-08 06:36:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-08 06:36:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2225. [2019-09-08 06:36:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2019-09-08 06:36:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2553 transitions. [2019-09-08 06:36:32,098 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2553 transitions. Word has length 740 [2019-09-08 06:36:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:32,098 INFO L475 AbstractCegarLoop]: Abstraction has 2225 states and 2553 transitions. [2019-09-08 06:36:32,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:36:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2553 transitions. [2019-09-08 06:36:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2019-09-08 06:36:32,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:32,107 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:32,107 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:32,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash -587281044, now seen corresponding path program 1 times [2019-09-08 06:36:32,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:32,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:32,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:32,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2019-09-08 06:36:32,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:36:32,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:36:32,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:36:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:36:32,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:36:32,366 INFO L87 Difference]: Start difference. First operand 2225 states and 2553 transitions. Second operand 3 states. [2019-09-08 06:36:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:32,546 INFO L93 Difference]: Finished difference Result 4228 states and 4805 transitions. [2019-09-08 06:36:32,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:36:32,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 753 [2019-09-08 06:36:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:32,566 INFO L225 Difference]: With dead ends: 4228 [2019-09-08 06:36:32,567 INFO L226 Difference]: Without dead ends: 2025 [2019-09-08 06:36:32,571 INFO L628 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-09-08 06:36:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-09-08 06:36:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 2025. [2019-09-08 06:36:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-09-08 06:36:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2280 transitions. [2019-09-08 06:36:32,867 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2280 transitions. Word has length 753 [2019-09-08 06:36:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:32,867 INFO L475 AbstractCegarLoop]: Abstraction has 2025 states and 2280 transitions. [2019-09-08 06:36:32,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:36:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2280 transitions. [2019-09-08 06:36:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-09-08 06:36:32,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:32,873 INFO L399 BasicCegarLoop]: trace histogram [12, 10, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:32,874 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash -210206786, now seen corresponding path program 1 times [2019-09-08 06:36:32,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:32,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 237 proven. 32 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-09-08 06:36:33,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:36:33,176 INFO L223 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-09-08 06:36:33,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:33,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 3896 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:36:33,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:36:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2019-09-08 06:36:34,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:36:34,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 06:36:34,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:36:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:36:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:36:34,054 INFO L87 Difference]: Start difference. First operand 2025 states and 2280 transitions. Second operand 3 states. [2019-09-08 06:36:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:34,191 INFO L93 Difference]: Finished difference Result 3101 states and 3416 transitions. [2019-09-08 06:36:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:36:34,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 747 [2019-09-08 06:36:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:34,195 INFO L225 Difference]: With dead ends: 3101 [2019-09-08 06:36:34,195 INFO L226 Difference]: Without dead ends: 1251 [2019-09-08 06:36:34,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 748 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-09-08 06:36:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-09-08 06:36:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 957. [2019-09-08 06:36:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-09-08 06:36:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 995 transitions. [2019-09-08 06:36:34,283 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 995 transitions. Word has length 747 [2019-09-08 06:36:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:34,284 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 995 transitions. [2019-09-08 06:36:34,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:36:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 995 transitions. [2019-09-08 06:36:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2019-09-08 06:36:34,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:34,289 INFO L399 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:34,289 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:34,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash 18722692, now seen corresponding path program 1 times [2019-09-08 06:36:34,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:34,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:34,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:34,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:34,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 567 proven. 425 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-08 06:36:35,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:36:35,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:36:35,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:36,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 3682 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 06:36:36,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:36:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 180 proven. 993 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-08 06:36:38,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:36:38,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 70 [2019-09-08 06:36:38,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 06:36:38,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 06:36:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=4633, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 06:36:38,641 INFO L87 Difference]: Start difference. First operand 957 states and 995 transitions. Second operand 70 states. [2019-09-08 06:37:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:08,505 INFO L93 Difference]: Finished difference Result 1568 states and 1628 transitions. [2019-09-08 06:37:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-08 06:37:08,506 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 713 [2019-09-08 06:37:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:08,511 INFO L225 Difference]: With dead ends: 1568 [2019-09-08 06:37:08,511 INFO L226 Difference]: Without dead ends: 1145 [2019-09-08 06:37:08,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 929 GetRequests, 728 SyntacticMatches, 6 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11445 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2423, Invalid=36189, Unknown=0, NotChecked=0, Total=38612 [2019-09-08 06:37:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-09-08 06:37:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1112. [2019-09-08 06:37:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-09-08 06:37:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1154 transitions. [2019-09-08 06:37:08,637 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1154 transitions. Word has length 713 [2019-09-08 06:37:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:08,638 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1154 transitions. [2019-09-08 06:37:08,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 06:37:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1154 transitions. [2019-09-08 06:37:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2019-09-08 06:37:08,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:08,643 INFO L399 BasicCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:37:08,643 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -929393516, now seen corresponding path program 2 times [2019-09-08 06:37:08,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:08,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:08,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:08,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 242 proven. 330 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2019-09-08 06:37:09,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:37:09,508 INFO L223 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-09-08 06:37:09,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:37:10,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:37:10,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:37:10,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 4145 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 06:37:10,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:37:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 978 proven. 128 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-08 06:37:10,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:37:10,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 18 [2019-09-08 06:37:10,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 06:37:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 06:37:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:37:10,556 INFO L87 Difference]: Start difference. First operand 1112 states and 1154 transitions. Second operand 18 states. [2019-09-08 06:37:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:12,660 INFO L93 Difference]: Finished difference Result 1112 states and 1154 transitions. [2019-09-08 06:37:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:37:12,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 824 [2019-09-08 06:37:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:12,661 INFO L225 Difference]: With dead ends: 1112 [2019-09-08 06:37:12,661 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 06:37:12,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 06:37:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 06:37:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 06:37:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 06:37:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 06:37:12,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 824 [2019-09-08 06:37:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:12,664 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 06:37:12,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 06:37:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 06:37:12,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 06:37:12,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 06:37:18,681 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:37:23,336 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 748 DAG size of output: 308 [2019-09-08 06:37:26,206 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:37:28,919 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:37:31,452 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 06:37:33,881 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 06:37:36,411 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 06:37:38,972 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 06:37:41,836 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-08 06:37:44,491 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 06:37:47,222 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 06:37:49,849 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 06:37:52,553 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 06:37:55,693 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:37:57,385 WARN L188 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 748 DAG size of output: 308 [2019-09-08 06:37:59,709 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-09-08 06:38:20,547 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:20,682 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:20,883 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:21,178 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:21,325 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:21,553 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 140 [2019-09-08 06:38:21,815 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:22,018 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:22,251 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:22,422 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:22,582 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:22,877 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:23,046 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:23,342 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:23,536 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:23,710 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:23,984 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:24,131 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:24,264 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:24,412 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:24,887 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:25,035 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:25,626 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:25,788 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:26,090 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:26,228 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:26,378 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:26,530 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:26,698 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:26,838 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:27,024 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:27,221 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:27,360 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:27,671 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:27,814 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:28,034 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:28,342 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:28,476 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:28,621 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:28,774 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:28,914 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:29,055 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:29,190 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:29,383 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:29,619 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:29,900 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:30,090 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:30,227 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:30,571 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:30,812 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:30,949 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:31,154 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:31,289 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:31,488 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:31,657 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:31,811 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:32,013 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:32,329 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:32,466 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:32,706 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:32,860 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-09-08 06:38:37,712 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 845 DAG size of output: 368 [2019-09-08 06:38:39,265 WARN L188 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 748 DAG size of output: 308 [2019-09-08 06:38:51,723 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 89 [2019-09-08 06:38:52,033 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:38:52,173 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:38:52,564 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:38:52,895 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:38:53,503 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:38:53,978 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:38:55,071 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 393 DAG size of output: 110 [2019-09-08 06:38:58,460 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:38:59,341 WARN L188 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 716 DAG size of output: 354 [2019-09-08 06:38:59,648 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 106 [2019-09-08 06:39:00,139 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 92 [2019-09-08 06:39:00,278 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 79 [2019-09-08 06:39:00,486 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 106 [2019-09-08 06:39:00,916 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 381 DAG size of output: 125 [2019-09-08 06:39:01,242 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 393 DAG size of output: 131 [2019-09-08 06:39:02,637 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 79 [2019-09-08 06:39:02,925 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 107 [2019-09-08 06:39:03,065 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 79 [2019-09-08 06:39:04,838 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:05,467 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 107 [2019-09-08 06:39:05,633 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 79 [2019-09-08 06:39:06,139 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 79 [2019-09-08 06:39:06,777 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:08,310 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:08,418 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 79 [2019-09-08 06:39:08,875 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 79 [2019-09-08 06:39:10,645 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:11,237 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:11,886 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:12,450 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:12,821 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:13,565 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:13,782 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 92 [2019-09-08 06:39:14,019 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 106 [2019-09-08 06:39:14,174 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:14,362 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 106 [2019-09-08 06:39:14,533 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 107 [2019-09-08 06:39:15,674 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:16,840 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:17,124 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:17,453 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:17,593 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:39:18,234 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:18,617 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:39:18,751 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:20,074 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 111 [2019-09-08 06:39:20,373 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:20,647 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 76 [2019-09-08 06:39:20,976 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:21,144 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:39:21,300 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:21,593 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:22,056 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 81 [2019-09-08 06:39:22,885 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:39:23,029 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 78 [2019-09-08 06:40:00,177 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-09-08 06:40:12,240 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2019-09-08 06:40:15,863 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 287