java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_single_elem_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:55:43,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:55:43,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:55:43,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:55:43,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:55:43,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:55:43,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:55:43,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:55:43,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:55:43,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:55:43,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:55:43,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:55:43,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:55:43,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:55:43,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:55:43,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:55:43,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:55:43,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:55:43,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:55:43,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:55:43,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:55:43,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:55:43,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:55:43,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:55:43,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:55:43,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:55:43,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:55:43,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:55:43,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:55:43,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:55:43,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:55:43,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:55:43,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:55:43,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:55:43,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:55:43,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:55:43,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:55:43,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:55:43,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:55:43,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:55:43,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:55:43,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 23:55:43,392 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:55:43,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:55:43,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:55:43,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:55:43,394 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:55:43,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:55:43,394 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:55:43,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:55:43,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:55:43,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:55:43,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:55:43,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:55:43,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:55:43,395 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:55:43,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:55:43,396 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:55:43,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:55:43,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:55:43,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:55:43,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:55:43,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:55:43,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:55:43,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:55:43,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:55:43,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:55:43,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:55:43,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:55:43,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:55:43,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:55:43,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:55:43,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:55:43,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:55:43,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:55:43,449 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:55:43,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_single_elem_init.i [2019-10-01 23:55:43,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46fd25c6a/b92913daf3ca47b4b63200c0ca448aaa/FLAGb57bc4781 [2019-10-01 23:55:43,978 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:55:43,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_single_elem_init.i [2019-10-01 23:55:43,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46fd25c6a/b92913daf3ca47b4b63200c0ca448aaa/FLAGb57bc4781 [2019-10-01 23:55:44,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46fd25c6a/b92913daf3ca47b4b63200c0ca448aaa [2019-10-01 23:55:44,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:55:44,402 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:55:44,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:55:44,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:55:44,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:55:44,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9aa9a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44, skipping insertion in model container [2019-10-01 23:55:44,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,419 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:55:44,434 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:55:44,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:55:44,626 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:55:44,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:55:44,768 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:55:44,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44 WrapperNode [2019-10-01 23:55:44,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:55:44,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:55:44,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:55:44,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:55:44,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... [2019-10-01 23:55:44,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:55:44,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:55:44,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:55:44,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:55:44,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:55:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:55:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:55:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:55:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:55:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:55:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:55:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:55:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:55:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:55:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:55:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:55:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:55:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:55:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:55:45,205 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:55:45,205 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-01 23:55:45,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:55:45 BoogieIcfgContainer [2019-10-01 23:55:45,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:55:45,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:55:45,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:55:45,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:55:45,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:55:44" (1/3) ... [2019-10-01 23:55:45,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2044b0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:55:45, skipping insertion in model container [2019-10-01 23:55:45,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:44" (2/3) ... [2019-10-01 23:55:45,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2044b0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:55:45, skipping insertion in model container [2019-10-01 23:55:45,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:55:45" (3/3) ... [2019-10-01 23:55:45,218 INFO L109 eAbstractionObserver]: Analyzing ICFG array_single_elem_init.i [2019-10-01 23:55:45,227 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:55:45,235 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:55:45,252 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:55:45,279 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:55:45,280 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:55:45,280 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:55:45,280 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:55:45,280 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:55:45,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:55:45,281 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:55:45,281 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:55:45,281 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:55:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-01 23:55:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-01 23:55:45,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:45,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:45,308 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1656037931, now seen corresponding path program 1 times [2019-10-01 23:55:45,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:45,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:45,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:55:45,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:45,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:55:45,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:55:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:55:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:55:45,463 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-01 23:55:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:45,489 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-10-01 23:55:45,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:55:45,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-01 23:55:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:45,499 INFO L225 Difference]: With dead ends: 46 [2019-10-01 23:55:45,500 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 23:55:45,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:55:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 23:55:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 23:55:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:55:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-01 23:55:45,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 14 [2019-10-01 23:55:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:45,543 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-01 23:55:45,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:55:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-01 23:55:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-01 23:55:45,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:45,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:45,545 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -533813011, now seen corresponding path program 1 times [2019-10-01 23:55:45,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:45,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:45,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:55:45,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:45,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:55:45,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:55:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:55:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:45,631 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 3 states. [2019-10-01 23:55:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:45,723 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-10-01 23:55:45,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:55:45,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-01 23:55:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:45,727 INFO L225 Difference]: With dead ends: 45 [2019-10-01 23:55:45,727 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:55:45,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:55:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-10-01 23:55:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 23:55:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-01 23:55:45,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 14 [2019-10-01 23:55:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:45,744 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-01 23:55:45,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:55:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-01 23:55:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 23:55:45,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:45,746 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:45,746 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:45,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash -414258795, now seen corresponding path program 1 times [2019-10-01 23:55:45,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:45,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:45,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:45,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:55:45,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:45,848 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:45,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:55:45,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 23:55:45,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:55:45,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:55:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:55:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:55:45,963 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 5 states. [2019-10-01 23:55:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:46,067 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-10-01 23:55:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:55:46,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-01 23:55:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:46,069 INFO L225 Difference]: With dead ends: 56 [2019-10-01 23:55:46,070 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 23:55:46,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:55:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 23:55:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-10-01 23:55:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 23:55:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-10-01 23:55:46,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 22 [2019-10-01 23:55:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:46,078 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-10-01 23:55:46,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:55:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-10-01 23:55:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-01 23:55:46,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:46,080 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:46,080 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1579249427, now seen corresponding path program 2 times [2019-10-01 23:55:46,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:46,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:55:46,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:46,189 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:55:46,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:46,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:46,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:46,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:55:46,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:46,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:46,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:55:46,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:55:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:55:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:55:46,298 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 6 states. [2019-10-01 23:55:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:46,415 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-10-01 23:55:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:55:46,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-01 23:55:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:46,417 INFO L225 Difference]: With dead ends: 68 [2019-10-01 23:55:46,417 INFO L226 Difference]: Without dead ends: 51 [2019-10-01 23:55:46,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:55:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-01 23:55:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-10-01 23:55:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 23:55:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-10-01 23:55:46,427 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 30 [2019-10-01 23:55:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:46,427 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-10-01 23:55:46,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:55:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-10-01 23:55:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:55:46,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:46,429 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:46,429 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1850469483, now seen corresponding path program 3 times [2019-10-01 23:55:46,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:46,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:55:46,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:46,589 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:46,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:46,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 23:55:46,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:46,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:55:46,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:46,698 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:46,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-10-01 23:55:46,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:46,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:46,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:55:46,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-10-01 23:55:46,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:55:46,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 40 [2019-10-01 23:55:46,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:46,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:46,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-10-01 23:55:46,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:46,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2019-10-01 23:55:46,828 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:46,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:46,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-10-01 23:55:46,875 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:159, output treesize:108 [2019-10-01 23:55:46,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:55:46,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-10-01 23:55:46,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:46,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2019-10-01 23:55:46,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:47,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-10-01 23:55:47,005 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:47,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:47,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:55:47,050 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:140, output treesize:3 [2019-10-01 23:55:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:55:47,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:47,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 23:55:47,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:55:47,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:55:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:55:47,081 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 9 states. [2019-10-01 23:55:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:48,090 INFO L93 Difference]: Finished difference Result 109 states and 146 transitions. [2019-10-01 23:55:48,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:55:48,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-10-01 23:55:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:48,099 INFO L225 Difference]: With dead ends: 109 [2019-10-01 23:55:48,100 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 23:55:48,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:55:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 23:55:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2019-10-01 23:55:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 23:55:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2019-10-01 23:55:48,124 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 38 [2019-10-01 23:55:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:48,124 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2019-10-01 23:55:48,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:55:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2019-10-01 23:55:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 23:55:48,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:48,130 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:48,130 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash 304191085, now seen corresponding path program 1 times [2019-10-01 23:55:48,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:48,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:48,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:48,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-01 23:55:48,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:48,274 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:55:48,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:48,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:55:48,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:55:48,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:48,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:55:48,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:55:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:55:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:55:48,353 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 8 states. [2019-10-01 23:55:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:48,502 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-10-01 23:55:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:55:48,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 23:55:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:48,505 INFO L225 Difference]: With dead ends: 104 [2019-10-01 23:55:48,505 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 23:55:48,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:55:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 23:55:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2019-10-01 23:55:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 23:55:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2019-10-01 23:55:48,527 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 46 [2019-10-01 23:55:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:48,527 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2019-10-01 23:55:48,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:55:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2019-10-01 23:55:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 23:55:48,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:48,531 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:48,531 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:48,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:48,531 INFO L82 PathProgramCache]: Analyzing trace with hash -828408681, now seen corresponding path program 2 times [2019-10-01 23:55:48,532 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:48,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:48,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:55:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:48,650 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:48,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:48,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:48,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:48,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:55:48,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 23:55:48,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:55:48,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:55:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:55:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:55:48,739 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 9 states. [2019-10-01 23:55:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:48,882 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2019-10-01 23:55:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:55:48,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-01 23:55:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:48,885 INFO L225 Difference]: With dead ends: 118 [2019-10-01 23:55:48,885 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 23:55:48,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:55:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 23:55:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2019-10-01 23:55:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-01 23:55:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-10-01 23:55:48,907 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 54 [2019-10-01 23:55:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:48,908 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-10-01 23:55:48,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:55:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-10-01 23:55:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 23:55:48,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:48,910 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:48,911 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash 893310253, now seen corresponding path program 3 times [2019-10-01 23:55:48,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:48,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:48,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:48,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:48,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 23:55:49,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:49,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:49,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:49,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 23:55:49,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:49,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:55:49,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 23:55:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:49,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:55:49,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:55:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:55:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:55:49,201 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 10 states. [2019-10-01 23:55:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:49,357 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2019-10-01 23:55:49,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:55:49,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-10-01 23:55:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:49,359 INFO L225 Difference]: With dead ends: 132 [2019-10-01 23:55:49,359 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 23:55:49,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:55:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 23:55:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2019-10-01 23:55:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 23:55:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2019-10-01 23:55:49,385 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 62 [2019-10-01 23:55:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:49,385 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2019-10-01 23:55:49,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:55:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2019-10-01 23:55:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 23:55:49,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:49,389 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:49,390 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash -615935017, now seen corresponding path program 4 times [2019-10-01 23:55:49,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:49,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:49,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-01 23:55:49,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:49,544 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:49,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:49,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:49,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:55:49,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-01 23:55:49,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:49,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:55:49,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:55:49,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:55:49,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:55:49,631 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand 11 states. [2019-10-01 23:55:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:49,785 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2019-10-01 23:55:49,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:55:49,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-10-01 23:55:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:49,786 INFO L225 Difference]: With dead ends: 146 [2019-10-01 23:55:49,787 INFO L226 Difference]: Without dead ends: 114 [2019-10-01 23:55:49,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:55:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-01 23:55:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-10-01 23:55:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:55:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2019-10-01 23:55:49,797 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 70 [2019-10-01 23:55:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:49,797 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2019-10-01 23:55:49,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:55:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2019-10-01 23:55:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-01 23:55:49,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:49,806 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:49,807 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1889092589, now seen corresponding path program 5 times [2019-10-01 23:55:49,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:49,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:49,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:49,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:49,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-01 23:55:49,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:49,956 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:50,051 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-01 23:55:50,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:50,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:55:50,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-01 23:55:50,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:50,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:55:50,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:55:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:55:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:55:50,100 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand 12 states. [2019-10-01 23:55:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:50,303 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2019-10-01 23:55:50,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:55:50,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2019-10-01 23:55:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:50,305 INFO L225 Difference]: With dead ends: 160 [2019-10-01 23:55:50,305 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 23:55:50,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:55:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 23:55:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2019-10-01 23:55:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 23:55:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2019-10-01 23:55:50,314 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 78 [2019-10-01 23:55:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:50,315 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2019-10-01 23:55:50,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:55:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2019-10-01 23:55:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-01 23:55:50,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:50,317 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:50,317 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:50,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1861453033, now seen corresponding path program 6 times [2019-10-01 23:55:50,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:50,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:50,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:50,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:50,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-01 23:55:50,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:50,433 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:55:50,459 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:50,561 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:55:50,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:50,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:55:50,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-01 23:55:50,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:55:50,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:55:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:55:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:55:50,615 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand 13 states. [2019-10-01 23:55:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:50,862 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2019-10-01 23:55:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:55:50,862 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-10-01 23:55:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:50,864 INFO L225 Difference]: With dead ends: 174 [2019-10-01 23:55:50,864 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 23:55:50,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:55:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 23:55:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2019-10-01 23:55:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 23:55:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2019-10-01 23:55:50,872 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 86 [2019-10-01 23:55:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:50,873 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2019-10-01 23:55:50,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:55:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2019-10-01 23:55:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-01 23:55:50,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:50,875 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:50,875 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1223892307, now seen corresponding path program 7 times [2019-10-01 23:55:50,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:50,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:50,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-10-01 23:55:51,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:51,004 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:51,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:51,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:55:51,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:55:51,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:51,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:55:51,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:55:51,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:55:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:55:51,118 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand 14 states. [2019-10-01 23:55:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:51,324 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2019-10-01 23:55:51,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:55:51,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2019-10-01 23:55:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:51,326 INFO L225 Difference]: With dead ends: 188 [2019-10-01 23:55:51,326 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 23:55:51,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:55:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 23:55:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2019-10-01 23:55:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 23:55:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2019-10-01 23:55:51,333 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 94 [2019-10-01 23:55:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:51,333 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2019-10-01 23:55:51,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:55:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2019-10-01 23:55:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 23:55:51,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:51,336 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:51,336 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:51,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash -141807017, now seen corresponding path program 8 times [2019-10-01 23:55:51,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:51,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 23:55:51,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:51,496 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:51,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:51,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:51,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:55:51,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:51,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:55:51,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:55:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:55:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:55:51,673 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand 15 states. [2019-10-01 23:55:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:51,974 INFO L93 Difference]: Finished difference Result 202 states and 246 transitions. [2019-10-01 23:55:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:55:51,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2019-10-01 23:55:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:51,977 INFO L225 Difference]: With dead ends: 202 [2019-10-01 23:55:51,978 INFO L226 Difference]: Without dead ends: 158 [2019-10-01 23:55:51,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:55:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-01 23:55:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2019-10-01 23:55:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-01 23:55:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2019-10-01 23:55:51,988 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 102 [2019-10-01 23:55:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:51,989 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2019-10-01 23:55:51,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:55:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2019-10-01 23:55:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 23:55:51,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:51,993 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:51,993 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989165, now seen corresponding path program 9 times [2019-10-01 23:55:51,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:51,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:51,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-01 23:55:52,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:52,211 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:52,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:52,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 23:55:52,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:52,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:55:52,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:52,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:52,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:55:52,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:55:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:55:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:55:52,406 INFO L87 Difference]: Start difference. First operand 150 states and 188 transitions. Second operand 16 states. [2019-10-01 23:55:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:52,612 INFO L93 Difference]: Finished difference Result 216 states and 263 transitions. [2019-10-01 23:55:52,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:55:52,613 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 110 [2019-10-01 23:55:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:52,614 INFO L225 Difference]: With dead ends: 216 [2019-10-01 23:55:52,614 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:55:52,615 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:55:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:55:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2019-10-01 23:55:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 23:55:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 202 transitions. [2019-10-01 23:55:52,622 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 202 transitions. Word has length 110 [2019-10-01 23:55:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:52,622 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 202 transitions. [2019-10-01 23:55:52,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:55:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 202 transitions. [2019-10-01 23:55:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 23:55:52,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:52,624 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:52,625 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash -882067049, now seen corresponding path program 10 times [2019-10-01 23:55:52,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:52,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:52,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:52,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:52,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2019-10-01 23:55:52,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:52,806 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:52,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:52,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:52,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:52,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:55:52,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-01 23:55:52,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:52,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:55:52,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:55:52,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:55:52,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:55:52,929 INFO L87 Difference]: Start difference. First operand 161 states and 202 transitions. Second operand 17 states. [2019-10-01 23:55:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:53,202 INFO L93 Difference]: Finished difference Result 230 states and 280 transitions. [2019-10-01 23:55:53,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:55:53,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 118 [2019-10-01 23:55:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:53,204 INFO L225 Difference]: With dead ends: 230 [2019-10-01 23:55:53,204 INFO L226 Difference]: Without dead ends: 180 [2019-10-01 23:55:53,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:55:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-01 23:55:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2019-10-01 23:55:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 23:55:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2019-10-01 23:55:53,212 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 118 [2019-10-01 23:55:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:53,212 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2019-10-01 23:55:53,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:55:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2019-10-01 23:55:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 23:55:53,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:53,214 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:53,215 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash 128954413, now seen corresponding path program 11 times [2019-10-01 23:55:53,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:53,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:53,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-01 23:55:53,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:53,429 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:53,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:53,581 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 23:55:53,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:53,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:55:53,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-01 23:55:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:53,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:55:53,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:55:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:55:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:55:53,632 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand 18 states. [2019-10-01 23:55:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:53,906 INFO L93 Difference]: Finished difference Result 244 states and 297 transitions. [2019-10-01 23:55:53,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:55:53,906 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 126 [2019-10-01 23:55:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:53,908 INFO L225 Difference]: With dead ends: 244 [2019-10-01 23:55:53,908 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 23:55:53,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:55:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 23:55:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2019-10-01 23:55:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 23:55:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2019-10-01 23:55:53,916 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 126 [2019-10-01 23:55:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:53,916 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2019-10-01 23:55:53,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:55:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2019-10-01 23:55:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-01 23:55:53,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:53,918 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:53,919 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1101917993, now seen corresponding path program 12 times [2019-10-01 23:55:53,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:53,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:53,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-01 23:55:54,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:54,110 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:54,132 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:55:54,408 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 23:55:54,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:54,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:55:54,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:54,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:54,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:55:54,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:55:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:55:54,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:55:54,462 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand 19 states. [2019-10-01 23:55:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:54,757 INFO L93 Difference]: Finished difference Result 258 states and 314 transitions. [2019-10-01 23:55:54,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:55:54,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 134 [2019-10-01 23:55:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:54,760 INFO L225 Difference]: With dead ends: 258 [2019-10-01 23:55:54,761 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 23:55:54,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:55:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 23:55:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-10-01 23:55:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-01 23:55:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 244 transitions. [2019-10-01 23:55:54,770 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 244 transitions. Word has length 134 [2019-10-01 23:55:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:54,771 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 244 transitions. [2019-10-01 23:55:54,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:55:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 244 transitions. [2019-10-01 23:55:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:55:54,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:54,773 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:54,774 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 244768493, now seen corresponding path program 13 times [2019-10-01 23:55:54,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:54,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:54,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-10-01 23:55:55,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:55,049 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:55,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:55,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:55:55,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 23:55:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:55:55,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:55:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:55:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:55:55,160 INFO L87 Difference]: Start difference. First operand 194 states and 244 transitions. Second operand 20 states. [2019-10-01 23:55:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:55,469 INFO L93 Difference]: Finished difference Result 272 states and 331 transitions. [2019-10-01 23:55:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:55:55,470 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 142 [2019-10-01 23:55:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:55,472 INFO L225 Difference]: With dead ends: 272 [2019-10-01 23:55:55,472 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 23:55:55,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:55:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 23:55:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-10-01 23:55:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 23:55:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 258 transitions. [2019-10-01 23:55:55,480 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 258 transitions. Word has length 142 [2019-10-01 23:55:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:55,481 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 258 transitions. [2019-10-01 23:55:55,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:55:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 258 transitions. [2019-10-01 23:55:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 23:55:55,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:55,483 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:55,483 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1226819561, now seen corresponding path program 14 times [2019-10-01 23:55:55,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:55,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2019-10-01 23:55:55,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:55,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:55,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:55,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:55,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:55:55,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-10-01 23:55:55,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:55,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:55:55,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:55:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:55:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:55:55,835 INFO L87 Difference]: Start difference. First operand 205 states and 258 transitions. Second operand 21 states. [2019-10-01 23:55:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:56,237 INFO L93 Difference]: Finished difference Result 286 states and 348 transitions. [2019-10-01 23:55:56,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:55:56,239 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2019-10-01 23:55:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:56,240 INFO L225 Difference]: With dead ends: 286 [2019-10-01 23:55:56,240 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 23:55:56,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:55:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 23:55:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-10-01 23:55:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-01 23:55:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 272 transitions. [2019-10-01 23:55:56,250 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 272 transitions. Word has length 150 [2019-10-01 23:55:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:56,250 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 272 transitions. [2019-10-01 23:55:56,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:55:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2019-10-01 23:55:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-01 23:55:56,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:56,253 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:56,253 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1710801491, now seen corresponding path program 15 times [2019-10-01 23:55:56,254 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:56,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:56,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:56,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-10-01 23:55:56,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:56,565 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:56,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:57,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 23:55:57,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:57,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:55:57,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-10-01 23:55:57,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:55:57,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:55:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:55:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:55:57,543 INFO L87 Difference]: Start difference. First operand 216 states and 272 transitions. Second operand 22 states. [2019-10-01 23:55:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:57,872 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2019-10-01 23:55:57,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:55:57,873 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 158 [2019-10-01 23:55:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:57,875 INFO L225 Difference]: With dead ends: 300 [2019-10-01 23:55:57,875 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 23:55:57,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:55:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 23:55:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-10-01 23:55:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-01 23:55:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 286 transitions. [2019-10-01 23:55:57,883 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 286 transitions. Word has length 158 [2019-10-01 23:55:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:57,884 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 286 transitions. [2019-10-01 23:55:57,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:55:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 286 transitions. [2019-10-01 23:55:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-01 23:55:57,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:57,886 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:57,886 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 280702807, now seen corresponding path program 16 times [2019-10-01 23:55:57,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:57,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2019-10-01 23:55:58,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:58,128 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:58,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:58,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:58,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:58,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:55:58,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-01 23:55:58,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:58,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:55:58,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:55:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:55:58,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:55:58,273 INFO L87 Difference]: Start difference. First operand 227 states and 286 transitions. Second operand 23 states. [2019-10-01 23:55:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:58,598 INFO L93 Difference]: Finished difference Result 314 states and 382 transitions. [2019-10-01 23:55:58,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:55:58,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 166 [2019-10-01 23:55:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:58,601 INFO L225 Difference]: With dead ends: 314 [2019-10-01 23:55:58,601 INFO L226 Difference]: Without dead ends: 246 [2019-10-01 23:55:58,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:55:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-01 23:55:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 238. [2019-10-01 23:55:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 23:55:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2019-10-01 23:55:58,610 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 166 [2019-10-01 23:55:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:58,610 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2019-10-01 23:55:58,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:55:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2019-10-01 23:55:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 23:55:58,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:58,612 INFO L411 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:58,613 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash 870108269, now seen corresponding path program 17 times [2019-10-01 23:55:58,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:58,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:58,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:58,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2019-10-01 23:55:58,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:58,947 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:59,313 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-01 23:55:59,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:59,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:55:59,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2019-10-01 23:55:59,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:59,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:55:59,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:55:59,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:55:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:55:59,375 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand 24 states. [2019-10-01 23:55:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:59,675 INFO L93 Difference]: Finished difference Result 328 states and 399 transitions. [2019-10-01 23:55:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:55:59,675 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 174 [2019-10-01 23:55:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:59,677 INFO L225 Difference]: With dead ends: 328 [2019-10-01 23:55:59,677 INFO L226 Difference]: Without dead ends: 257 [2019-10-01 23:55:59,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:55:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-01 23:55:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2019-10-01 23:55:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-01 23:55:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 314 transitions. [2019-10-01 23:55:59,685 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 314 transitions. Word has length 174 [2019-10-01 23:55:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:59,686 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 314 transitions. [2019-10-01 23:55:59,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:55:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 314 transitions. [2019-10-01 23:55:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-01 23:55:59,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:59,687 INFO L411 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:59,687 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash -595134825, now seen corresponding path program 18 times [2019-10-01 23:55:59,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:59,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:59,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2019-10-01 23:56:00,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:00,033 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:00,057 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:56:00,644 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-10-01 23:56:00,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:00,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:56:00,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-10-01 23:56:00,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:00,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:56:00,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:56:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:56:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:56:00,693 INFO L87 Difference]: Start difference. First operand 249 states and 314 transitions. Second operand 25 states. [2019-10-01 23:56:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:01,022 INFO L93 Difference]: Finished difference Result 342 states and 416 transitions. [2019-10-01 23:56:01,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:56:01,023 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 182 [2019-10-01 23:56:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:01,025 INFO L225 Difference]: With dead ends: 342 [2019-10-01 23:56:01,025 INFO L226 Difference]: Without dead ends: 268 [2019-10-01 23:56:01,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:56:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-01 23:56:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2019-10-01 23:56:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-01 23:56:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 328 transitions. [2019-10-01 23:56:01,036 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 328 transitions. Word has length 182 [2019-10-01 23:56:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:01,036 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 328 transitions. [2019-10-01 23:56:01,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:56:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 328 transitions. [2019-10-01 23:56:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-01 23:56:01,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:01,038 INFO L411 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:01,038 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:01,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1863087315, now seen corresponding path program 19 times [2019-10-01 23:56:01,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:01,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:01,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:01,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:01,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2019-10-01 23:56:01,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:01,366 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:01,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:01,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:56:01,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-01 23:56:01,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:01,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:56:01,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:56:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:56:01,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:56:01,520 INFO L87 Difference]: Start difference. First operand 260 states and 328 transitions. Second operand 26 states. [2019-10-01 23:56:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:01,877 INFO L93 Difference]: Finished difference Result 356 states and 433 transitions. [2019-10-01 23:56:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:56:01,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2019-10-01 23:56:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:01,880 INFO L225 Difference]: With dead ends: 356 [2019-10-01 23:56:01,881 INFO L226 Difference]: Without dead ends: 279 [2019-10-01 23:56:01,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:56:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-01 23:56:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2019-10-01 23:56:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-01 23:56:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 342 transitions. [2019-10-01 23:56:01,891 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 342 transitions. Word has length 190 [2019-10-01 23:56:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:01,892 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 342 transitions. [2019-10-01 23:56:01,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:56:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 342 transitions. [2019-10-01 23:56:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-01 23:56:01,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:01,894 INFO L411 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:01,895 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 535268823, now seen corresponding path program 20 times [2019-10-01 23:56:01,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:01,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2019-10-01 23:56:02,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:02,388 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:02,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:56:02,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:56:02,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:02,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:56:02,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-10-01 23:56:02,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:02,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:56:02,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:56:02,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:56:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:56:02,572 INFO L87 Difference]: Start difference. First operand 271 states and 342 transitions. Second operand 27 states. [2019-10-01 23:56:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:02,939 INFO L93 Difference]: Finished difference Result 370 states and 450 transitions. [2019-10-01 23:56:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:56:02,940 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 198 [2019-10-01 23:56:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:02,942 INFO L225 Difference]: With dead ends: 370 [2019-10-01 23:56:02,942 INFO L226 Difference]: Without dead ends: 290 [2019-10-01 23:56:02,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:56:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-01 23:56:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2019-10-01 23:56:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-01 23:56:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 356 transitions. [2019-10-01 23:56:02,952 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 356 transitions. Word has length 198 [2019-10-01 23:56:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:02,952 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 356 transitions. [2019-10-01 23:56:02,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:56:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 356 transitions. [2019-10-01 23:56:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 23:56:02,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:02,954 INFO L411 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:02,954 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1361541613, now seen corresponding path program 21 times [2019-10-01 23:56:02,954 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:02,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:02,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-10-01 23:56:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:03,330 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:03,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:56:04,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-10-01 23:56:04,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:04,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:56:04,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:56:05,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:05,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:56:05,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:56:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:56:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:56:05,024 INFO L87 Difference]: Start difference. First operand 282 states and 356 transitions. Second operand 28 states. [2019-10-01 23:56:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:05,492 INFO L93 Difference]: Finished difference Result 384 states and 467 transitions. [2019-10-01 23:56:05,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:56:05,492 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 206 [2019-10-01 23:56:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:05,495 INFO L225 Difference]: With dead ends: 384 [2019-10-01 23:56:05,495 INFO L226 Difference]: Without dead ends: 301 [2019-10-01 23:56:05,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:56:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-01 23:56:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2019-10-01 23:56:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-01 23:56:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 370 transitions. [2019-10-01 23:56:05,508 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 370 transitions. Word has length 206 [2019-10-01 23:56:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:05,509 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 370 transitions. [2019-10-01 23:56:05,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:56:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 370 transitions. [2019-10-01 23:56:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 23:56:05,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:05,512 INFO L411 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:05,512 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 360772887, now seen corresponding path program 22 times [2019-10-01 23:56:05,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:05,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:05,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2019-10-01 23:56:06,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:06,078 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:06,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:56:06,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:56:06,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:06,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:56:06,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-10-01 23:56:06,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:06,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:56:06,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:56:06,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:56:06,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:56:06,233 INFO L87 Difference]: Start difference. First operand 293 states and 370 transitions. Second operand 29 states. [2019-10-01 23:56:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:06,680 INFO L93 Difference]: Finished difference Result 398 states and 484 transitions. [2019-10-01 23:56:06,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:56:06,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 214 [2019-10-01 23:56:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:06,684 INFO L225 Difference]: With dead ends: 398 [2019-10-01 23:56:06,684 INFO L226 Difference]: Without dead ends: 312 [2019-10-01 23:56:06,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:56:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-10-01 23:56:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-10-01 23:56:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-01 23:56:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 384 transitions. [2019-10-01 23:56:06,694 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 384 transitions. Word has length 214 [2019-10-01 23:56:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:06,695 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 384 transitions. [2019-10-01 23:56:06,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:56:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 384 transitions. [2019-10-01 23:56:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 23:56:06,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:06,697 INFO L411 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:06,697 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:06,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:06,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1084974931, now seen corresponding path program 23 times [2019-10-01 23:56:06,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:06,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:06,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2678 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1651 trivial. 0 not checked. [2019-10-01 23:56:07,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:07,121 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:07,152 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:56:07,621 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-01 23:56:07,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:07,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:56:07,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2678 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:56:07,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:07,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:56:07,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:56:07,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:56:07,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:56:07,690 INFO L87 Difference]: Start difference. First operand 304 states and 384 transitions. Second operand 30 states. [2019-10-01 23:56:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:08,145 INFO L93 Difference]: Finished difference Result 412 states and 501 transitions. [2019-10-01 23:56:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:56:08,150 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 222 [2019-10-01 23:56:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:08,153 INFO L225 Difference]: With dead ends: 412 [2019-10-01 23:56:08,153 INFO L226 Difference]: Without dead ends: 323 [2019-10-01 23:56:08,154 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:56:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-01 23:56:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 315. [2019-10-01 23:56:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-01 23:56:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 398 transitions. [2019-10-01 23:56:08,161 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 398 transitions. Word has length 222 [2019-10-01 23:56:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:08,162 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 398 transitions. [2019-10-01 23:56:08,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:56:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 398 transitions. [2019-10-01 23:56:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 23:56:08,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:08,164 INFO L411 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:08,164 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:08,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1828138071, now seen corresponding path program 24 times [2019-10-01 23:56:08,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:08,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:08,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2889 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2019-10-01 23:56:08,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:08,715 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:08,764 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:56:13,673 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-10-01 23:56:13,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:13,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:56:13,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2889 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:56:13,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:13,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:56:13,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:56:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:56:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:56:13,777 INFO L87 Difference]: Start difference. First operand 315 states and 398 transitions. Second operand 31 states. [2019-10-01 23:56:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:14,247 INFO L93 Difference]: Finished difference Result 426 states and 518 transitions. [2019-10-01 23:56:14,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:56:14,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 230 [2019-10-01 23:56:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:14,251 INFO L225 Difference]: With dead ends: 426 [2019-10-01 23:56:14,251 INFO L226 Difference]: Without dead ends: 334 [2019-10-01 23:56:14,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:56:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-01 23:56:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2019-10-01 23:56:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-10-01 23:56:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 412 transitions. [2019-10-01 23:56:14,261 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 412 transitions. Word has length 230 [2019-10-01 23:56:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:14,262 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 412 transitions. [2019-10-01 23:56:14,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:56:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 412 transitions. [2019-10-01 23:56:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 23:56:14,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:14,264 INFO L411 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:14,264 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1856575635, now seen corresponding path program 25 times [2019-10-01 23:56:14,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:14,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:14,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1918 trivial. 0 not checked. [2019-10-01 23:56:14,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:14,748 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:14,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:14,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:56:14,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-10-01 23:56:14,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:14,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:56:14,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:56:14,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:56:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:56:14,915 INFO L87 Difference]: Start difference. First operand 326 states and 412 transitions. Second operand 32 states. [2019-10-01 23:56:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:15,467 INFO L93 Difference]: Finished difference Result 440 states and 535 transitions. [2019-10-01 23:56:15,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:56:15,468 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 238 [2019-10-01 23:56:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:15,471 INFO L225 Difference]: With dead ends: 440 [2019-10-01 23:56:15,471 INFO L226 Difference]: Without dead ends: 345 [2019-10-01 23:56:15,472 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:56:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-01 23:56:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2019-10-01 23:56:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-01 23:56:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 426 transitions. [2019-10-01 23:56:15,480 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 426 transitions. Word has length 238 [2019-10-01 23:56:15,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:15,481 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 426 transitions. [2019-10-01 23:56:15,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:56:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 426 transitions. [2019-10-01 23:56:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 23:56:15,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:15,483 INFO L411 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:15,483 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:15,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1964100713, now seen corresponding path program 26 times [2019-10-01 23:56:15,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:15,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:15,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:15,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:15,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 2059 trivial. 0 not checked. [2019-10-01 23:56:16,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:16,060 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:16,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:56:16,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:56:16,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:16,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:56:16,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-10-01 23:56:16,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:16,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:56:16,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:56:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:56:16,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:56:16,239 INFO L87 Difference]: Start difference. First operand 337 states and 426 transitions. Second operand 33 states. [2019-10-01 23:56:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:16,756 INFO L93 Difference]: Finished difference Result 454 states and 552 transitions. [2019-10-01 23:56:16,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:56:16,757 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 246 [2019-10-01 23:56:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:16,759 INFO L225 Difference]: With dead ends: 454 [2019-10-01 23:56:16,759 INFO L226 Difference]: Without dead ends: 356 [2019-10-01 23:56:16,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:56:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-10-01 23:56:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 348. [2019-10-01 23:56:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-01 23:56:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 440 transitions. [2019-10-01 23:56:16,768 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 440 transitions. Word has length 246 [2019-10-01 23:56:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:16,768 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 440 transitions. [2019-10-01 23:56:16,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:56:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 440 transitions. [2019-10-01 23:56:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 23:56:16,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:16,770 INFO L411 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:16,771 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:16,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:16,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1475713491, now seen corresponding path program 27 times [2019-10-01 23:56:16,771 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:16,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:16,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2019-10-01 23:56:17,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:17,342 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:17,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:56:24,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-10-01 23:56:24,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:24,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:56:24,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2019-10-01 23:56:24,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:24,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:56:24,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:56:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:56:24,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:56:24,421 INFO L87 Difference]: Start difference. First operand 348 states and 440 transitions. Second operand 34 states. [2019-10-01 23:56:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:24,857 INFO L93 Difference]: Finished difference Result 468 states and 569 transitions. [2019-10-01 23:56:24,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:56:24,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 254 [2019-10-01 23:56:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:24,861 INFO L225 Difference]: With dead ends: 468 [2019-10-01 23:56:24,861 INFO L226 Difference]: Without dead ends: 367 [2019-10-01 23:56:24,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:56:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-01 23:56:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 359. [2019-10-01 23:56:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-01 23:56:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 454 transitions. [2019-10-01 23:56:24,873 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 454 transitions. Word has length 254 [2019-10-01 23:56:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:24,874 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 454 transitions. [2019-10-01 23:56:24,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:56:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 454 transitions. [2019-10-01 23:56:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-01 23:56:24,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:24,876 INFO L411 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:24,876 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -922088745, now seen corresponding path program 28 times [2019-10-01 23:56:24,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:24,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3813 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 2356 trivial. 0 not checked. [2019-10-01 23:56:25,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:25,608 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:25,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:56:25,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:56:25,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:25,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:56:25,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3813 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2019-10-01 23:56:25,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:25,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:56:25,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:56:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:56:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:56:25,807 INFO L87 Difference]: Start difference. First operand 359 states and 454 transitions. Second operand 35 states. [2019-10-01 23:56:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:26,329 INFO L93 Difference]: Finished difference Result 482 states and 586 transitions. [2019-10-01 23:56:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:56:26,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 262 [2019-10-01 23:56:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:26,333 INFO L225 Difference]: With dead ends: 482 [2019-10-01 23:56:26,333 INFO L226 Difference]: Without dead ends: 378 [2019-10-01 23:56:26,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:56:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-01 23:56:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-01 23:56:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-01 23:56:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 468 transitions. [2019-10-01 23:56:26,343 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 468 transitions. Word has length 262 [2019-10-01 23:56:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:26,343 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 468 transitions. [2019-10-01 23:56:26,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:56:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 468 transitions. [2019-10-01 23:56:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-01 23:56:26,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:26,345 INFO L411 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:26,345 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash -817163027, now seen corresponding path program 29 times [2019-10-01 23:56:26,346 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:26,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:26,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4064 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2019-10-01 23:56:26,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:26,911 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:26,949 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:56:29,323 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 23:56:29,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:29,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:56:29,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4064 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-01 23:56:29,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:29,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:56:29,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:56:29,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:56:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:56:29,427 INFO L87 Difference]: Start difference. First operand 370 states and 468 transitions. Second operand 36 states. [2019-10-01 23:56:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:29,953 INFO L93 Difference]: Finished difference Result 496 states and 603 transitions. [2019-10-01 23:56:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:56:29,954 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 270 [2019-10-01 23:56:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:29,956 INFO L225 Difference]: With dead ends: 496 [2019-10-01 23:56:29,956 INFO L226 Difference]: Without dead ends: 389 [2019-10-01 23:56:29,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:56:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-10-01 23:56:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2019-10-01 23:56:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-01 23:56:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 482 transitions. [2019-10-01 23:56:29,966 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 482 transitions. Word has length 270 [2019-10-01 23:56:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:29,966 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 482 transitions. [2019-10-01 23:56:29,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:56:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 482 transitions. [2019-10-01 23:56:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 23:56:29,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:29,968 INFO L411 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:29,969 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1242648041, now seen corresponding path program 30 times [2019-10-01 23:56:29,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:29,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:29,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:29,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:29,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 2673 trivial. 0 not checked. [2019-10-01 23:56:30,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:30,816 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:30,864 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:56:57,645 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-10-01 23:56:57,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:57,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:56:57,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-10-01 23:56:57,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:57,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:56:57,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:56:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:56:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:56:57,773 INFO L87 Difference]: Start difference. First operand 381 states and 482 transitions. Second operand 37 states. [2019-10-01 23:56:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:58,399 INFO L93 Difference]: Finished difference Result 510 states and 620 transitions. [2019-10-01 23:56:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:56:58,404 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 278 [2019-10-01 23:56:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:58,406 INFO L225 Difference]: With dead ends: 510 [2019-10-01 23:56:58,407 INFO L226 Difference]: Without dead ends: 400 [2019-10-01 23:56:58,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:56:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-10-01 23:56:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 392. [2019-10-01 23:56:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-01 23:56:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 496 transitions. [2019-10-01 23:56:58,416 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 496 transitions. Word has length 278 [2019-10-01 23:56:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:58,416 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 496 transitions. [2019-10-01 23:56:58,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:56:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 496 transitions. [2019-10-01 23:56:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-01 23:56:58,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:58,418 INFO L411 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:58,418 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2113205165, now seen corresponding path program 31 times [2019-10-01 23:56:58,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:58,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:58,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:58,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:58,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4590 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 2839 trivial. 0 not checked. [2019-10-01 23:56:59,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:59,003 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:59,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:59,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:56:59,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4590 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:56:59,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:59,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:56:59,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:56:59,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:56:59,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:56:59,287 INFO L87 Difference]: Start difference. First operand 392 states and 496 transitions. Second operand 38 states. [2019-10-01 23:56:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:59,868 INFO L93 Difference]: Finished difference Result 524 states and 637 transitions. [2019-10-01 23:56:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:56:59,868 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 286 [2019-10-01 23:56:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:59,871 INFO L225 Difference]: With dead ends: 524 [2019-10-01 23:56:59,871 INFO L226 Difference]: Without dead ends: 411 [2019-10-01 23:56:59,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:56:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-01 23:56:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 403. [2019-10-01 23:56:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-10-01 23:56:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 510 transitions. [2019-10-01 23:56:59,880 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 510 transitions. Word has length 286 [2019-10-01 23:56:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:59,881 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 510 transitions. [2019-10-01 23:56:59,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:56:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 510 transitions. [2019-10-01 23:56:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-01 23:56:59,883 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:59,883 INFO L411 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:59,883 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1430268247, now seen corresponding path program 32 times [2019-10-01 23:56:59,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:59,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:59,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:59,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:56:59,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4865 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2019-10-01 23:57:00,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:00,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:00,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:57:00,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:57:00,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:57:00,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:57:00,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:57:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4865 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2019-10-01 23:57:00,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:57:00,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:57:00,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:57:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:57:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:57:00,820 INFO L87 Difference]: Start difference. First operand 403 states and 510 transitions. Second operand 39 states. [2019-10-01 23:57:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:57:01,319 INFO L93 Difference]: Finished difference Result 538 states and 654 transitions. [2019-10-01 23:57:01,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:57:01,320 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 294 [2019-10-01 23:57:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:57:01,321 INFO L225 Difference]: With dead ends: 538 [2019-10-01 23:57:01,321 INFO L226 Difference]: Without dead ends: 422 [2019-10-01 23:57:01,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:57:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-10-01 23:57:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2019-10-01 23:57:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-10-01 23:57:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 524 transitions. [2019-10-01 23:57:01,331 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 524 transitions. Word has length 294 [2019-10-01 23:57:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:57:01,331 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 524 transitions. [2019-10-01 23:57:01,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:57:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 524 transitions. [2019-10-01 23:57:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-01 23:57:01,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:57:01,334 INFO L411 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:57:01,334 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:57:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:57:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1780219283, now seen corresponding path program 33 times [2019-10-01 23:57:01,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:57:01,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:57:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:01,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:57:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5148 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 3186 trivial. 0 not checked. [2019-10-01 23:57:02,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:02,029 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:02,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:57:27,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-10-01 23:57:27,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:57:27,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:57:27,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:57:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5148 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2019-10-01 23:57:27,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:57:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-01 23:57:27,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 23:57:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 23:57:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:57:27,303 INFO L87 Difference]: Start difference. First operand 414 states and 524 transitions. Second operand 40 states. [2019-10-01 23:57:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:57:27,901 INFO L93 Difference]: Finished difference Result 552 states and 671 transitions. [2019-10-01 23:57:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:57:27,901 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 302 [2019-10-01 23:57:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:57:27,904 INFO L225 Difference]: With dead ends: 552 [2019-10-01 23:57:27,904 INFO L226 Difference]: Without dead ends: 433 [2019-10-01 23:57:27,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:57:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-01 23:57:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2019-10-01 23:57:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-01 23:57:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 538 transitions. [2019-10-01 23:57:27,913 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 538 transitions. Word has length 302 [2019-10-01 23:57:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:57:27,913 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 538 transitions. [2019-10-01 23:57:27,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 23:57:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2019-10-01 23:57:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 23:57:27,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:57:27,916 INFO L411 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:57:27,916 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:57:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:57:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1604481175, now seen corresponding path program 34 times [2019-10-01 23:57:27,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:57:27,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:57:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:27,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:57:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5439 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 3367 trivial. 0 not checked. [2019-10-01 23:57:28,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:28,939 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:28,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:57:29,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:57:29,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:57:29,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:57:29,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:57:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5439 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2019-10-01 23:57:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:57:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:57:29,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:57:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:57:29,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:57:29,194 INFO L87 Difference]: Start difference. First operand 425 states and 538 transitions. Second operand 41 states. [2019-10-01 23:57:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:57:29,841 INFO L93 Difference]: Finished difference Result 566 states and 688 transitions. [2019-10-01 23:57:29,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:57:29,841 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 310 [2019-10-01 23:57:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:57:29,844 INFO L225 Difference]: With dead ends: 566 [2019-10-01 23:57:29,844 INFO L226 Difference]: Without dead ends: 444 [2019-10-01 23:57:29,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:57:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-01 23:57:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 436. [2019-10-01 23:57:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-10-01 23:57:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 552 transitions. [2019-10-01 23:57:29,854 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 552 transitions. Word has length 310 [2019-10-01 23:57:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:57:29,854 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 552 transitions. [2019-10-01 23:57:29,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:57:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 552 transitions. [2019-10-01 23:57:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-01 23:57:29,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:57:29,857 INFO L411 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:57:29,857 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:57:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:57:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 603210029, now seen corresponding path program 35 times [2019-10-01 23:57:29,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:57:29,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:57:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:29,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:57:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5738 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 3553 trivial. 0 not checked. [2019-10-01 23:57:30,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:30,606 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:30,652 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:57:32,075 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-10-01 23:57:32,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:57:32,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:57:32,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:57:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5738 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2019-10-01 23:57:32,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:57:32,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:57:32,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:57:32,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:57:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:57:32,202 INFO L87 Difference]: Start difference. First operand 436 states and 552 transitions. Second operand 42 states. [2019-10-01 23:57:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:57:32,868 INFO L93 Difference]: Finished difference Result 580 states and 705 transitions. [2019-10-01 23:57:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:57:32,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 318 [2019-10-01 23:57:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:57:32,871 INFO L225 Difference]: With dead ends: 580 [2019-10-01 23:57:32,871 INFO L226 Difference]: Without dead ends: 455 [2019-10-01 23:57:32,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:57:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-10-01 23:57:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 447. [2019-10-01 23:57:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-10-01 23:57:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 566 transitions. [2019-10-01 23:57:32,880 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 566 transitions. Word has length 318 [2019-10-01 23:57:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:57:32,880 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 566 transitions. [2019-10-01 23:57:32,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:57:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 566 transitions. [2019-10-01 23:57:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-01 23:57:32,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:57:32,883 INFO L411 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:57:32,883 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:57:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:57:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2101770281, now seen corresponding path program 36 times [2019-10-01 23:57:32,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:57:32,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:57:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:32,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:57:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:57:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:57:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6045 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 3744 trivial. 0 not checked. [2019-10-01 23:57:33,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:57:33,749 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:57:33,802 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:58:29,213 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-10-01 23:58:29,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:58:29,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:58:29,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6045 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 3744 trivial. 0 not checked. [2019-10-01 23:58:29,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:29,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 23:58:29,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 23:58:29,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 23:58:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:58:29,370 INFO L87 Difference]: Start difference. First operand 447 states and 566 transitions. Second operand 43 states. [2019-10-01 23:58:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:30,317 INFO L93 Difference]: Finished difference Result 594 states and 722 transitions. [2019-10-01 23:58:30,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 23:58:30,318 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 326 [2019-10-01 23:58:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:30,321 INFO L225 Difference]: With dead ends: 594 [2019-10-01 23:58:30,321 INFO L226 Difference]: Without dead ends: 466 [2019-10-01 23:58:30,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:58:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-01 23:58:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 458. [2019-10-01 23:58:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-01 23:58:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 580 transitions. [2019-10-01 23:58:30,334 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 580 transitions. Word has length 326 [2019-10-01 23:58:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:30,335 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 580 transitions. [2019-10-01 23:58:30,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 23:58:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 580 transitions. [2019-10-01 23:58:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-01 23:58:30,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:30,337 INFO L411 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:30,338 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash 536981485, now seen corresponding path program 37 times [2019-10-01 23:58:30,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:30,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:30,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:58:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6360 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 3940 trivial. 0 not checked. [2019-10-01 23:58:31,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:31,165 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:31,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:58:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:31,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:58:31,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6360 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2019-10-01 23:58:31,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:31,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 23:58:31,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:58:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:58:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:58:31,444 INFO L87 Difference]: Start difference. First operand 458 states and 580 transitions. Second operand 44 states. [2019-10-01 23:58:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:32,029 INFO L93 Difference]: Finished difference Result 608 states and 739 transitions. [2019-10-01 23:58:32,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:58:32,033 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 334 [2019-10-01 23:58:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:32,036 INFO L225 Difference]: With dead ends: 608 [2019-10-01 23:58:32,036 INFO L226 Difference]: Without dead ends: 477 [2019-10-01 23:58:32,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:58:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-01 23:58:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2019-10-01 23:58:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-01 23:58:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 594 transitions. [2019-10-01 23:58:32,046 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 594 transitions. Word has length 334 [2019-10-01 23:58:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:32,046 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 594 transitions. [2019-10-01 23:58:32,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:58:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 594 transitions. [2019-10-01 23:58:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-01 23:58:32,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:32,049 INFO L411 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:32,049 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1591120105, now seen corresponding path program 38 times [2019-10-01 23:58:32,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:32,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:32,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:58:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6683 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 4141 trivial. 0 not checked. [2019-10-01 23:58:33,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:33,240 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:33,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:58:33,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:58:33,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:58:33,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:58:33,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6683 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2019-10-01 23:58:33,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:33,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 23:58:33,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 23:58:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 23:58:33,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:58:33,508 INFO L87 Difference]: Start difference. First operand 469 states and 594 transitions. Second operand 45 states. [2019-10-01 23:58:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:34,332 INFO L93 Difference]: Finished difference Result 622 states and 756 transitions. [2019-10-01 23:58:34,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 23:58:34,332 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 342 [2019-10-01 23:58:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:34,334 INFO L225 Difference]: With dead ends: 622 [2019-10-01 23:58:34,334 INFO L226 Difference]: Without dead ends: 488 [2019-10-01 23:58:34,335 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:58:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-10-01 23:58:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 480. [2019-10-01 23:58:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-10-01 23:58:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 608 transitions. [2019-10-01 23:58:34,343 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 608 transitions. Word has length 342 [2019-10-01 23:58:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:34,343 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 608 transitions. [2019-10-01 23:58:34,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 23:58:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 608 transitions. [2019-10-01 23:58:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-01 23:58:34,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:34,345 INFO L411 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:34,345 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 753421997, now seen corresponding path program 39 times [2019-10-01 23:58:34,346 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:34,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:34,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:58:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7014 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-10-01 23:58:35,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:35,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:35,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:58:47,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-10-01 23:58:47,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:58:47,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:58:47,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7014 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:58:47,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-10-01 23:58:47,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 23:58:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 23:58:47,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:58:47,200 INFO L87 Difference]: Start difference. First operand 480 states and 608 transitions. Second operand 46 states. [2019-10-01 23:58:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:48,099 INFO L93 Difference]: Finished difference Result 636 states and 773 transitions. [2019-10-01 23:58:48,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 23:58:48,100 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 350 [2019-10-01 23:58:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:48,102 INFO L225 Difference]: With dead ends: 636 [2019-10-01 23:58:48,102 INFO L226 Difference]: Without dead ends: 499 [2019-10-01 23:58:48,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:58:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-01 23:58:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 491. [2019-10-01 23:58:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-01 23:58:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 622 transitions. [2019-10-01 23:58:48,113 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 622 transitions. Word has length 350 [2019-10-01 23:58:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:48,114 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 622 transitions. [2019-10-01 23:58:48,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 23:58:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 622 transitions. [2019-10-01 23:58:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-01 23:58:48,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:48,116 INFO L411 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:48,117 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash 311830103, now seen corresponding path program 40 times [2019-10-01 23:58:48,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:48,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:48,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:58:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7353 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 4558 trivial. 0 not checked. [2019-10-01 23:58:48,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:48,988 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:49,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:58:49,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:58:49,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:58:49,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:58:49,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:58:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7353 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2019-10-01 23:58:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:58:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 23:58:49,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 23:58:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 23:58:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:58:49,266 INFO L87 Difference]: Start difference. First operand 491 states and 622 transitions. Second operand 47 states. [2019-10-01 23:58:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:58:49,934 INFO L93 Difference]: Finished difference Result 650 states and 790 transitions. [2019-10-01 23:58:49,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 23:58:49,935 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 358 [2019-10-01 23:58:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:58:49,937 INFO L225 Difference]: With dead ends: 650 [2019-10-01 23:58:49,937 INFO L226 Difference]: Without dead ends: 510 [2019-10-01 23:58:49,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:58:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-01 23:58:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 502. [2019-10-01 23:58:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-01 23:58:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 636 transitions. [2019-10-01 23:58:49,947 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 636 transitions. Word has length 358 [2019-10-01 23:58:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:58:49,948 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 636 transitions. [2019-10-01 23:58:49,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 23:58:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 636 transitions. [2019-10-01 23:58:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-01 23:58:49,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:58:49,951 INFO L411 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:58:49,951 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:58:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:58:49,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1485053293, now seen corresponding path program 41 times [2019-10-01 23:58:49,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:58:49,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:58:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:49,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:58:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:58:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:58:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 4774 trivial. 0 not checked. [2019-10-01 23:58:50,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:58:50,974 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:58:51,035 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:59:05,180 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-10-01 23:59:05,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:59:05,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 23:59:05,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:59:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-10-01 23:59:05,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:59:05,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 23:59:05,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 23:59:05,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 23:59:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:59:05,300 INFO L87 Difference]: Start difference. First operand 502 states and 636 transitions. Second operand 48 states. [2019-10-01 23:59:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:59:06,208 INFO L93 Difference]: Finished difference Result 664 states and 807 transitions. [2019-10-01 23:59:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 23:59:06,209 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 366 [2019-10-01 23:59:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:59:06,212 INFO L225 Difference]: With dead ends: 664 [2019-10-01 23:59:06,212 INFO L226 Difference]: Without dead ends: 521 [2019-10-01 23:59:06,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:59:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-10-01 23:59:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 513. [2019-10-01 23:59:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-10-01 23:59:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 650 transitions. [2019-10-01 23:59:06,220 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 650 transitions. Word has length 366 [2019-10-01 23:59:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:59:06,221 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 650 transitions. [2019-10-01 23:59:06,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 23:59:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 650 transitions. [2019-10-01 23:59:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-01 23:59:06,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:59:06,224 INFO L411 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:59:06,224 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:59:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:59:06,224 INFO L82 PathProgramCache]: Analyzing trace with hash -475812457, now seen corresponding path program 42 times [2019-10-01 23:59:06,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:59:06,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:59:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:59:06,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:59:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:59:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:59:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8055 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 4995 trivial. 0 not checked. [2019-10-01 23:59:07,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:59:07,757 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:59:07,855 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:00:47,435 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-10-02 00:00:47,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:00:47,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 00:00:47,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:00:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8055 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 4995 trivial. 0 not checked. [2019-10-02 00:00:47,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:00:47,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-02 00:00:47,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 00:00:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 00:00:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 00:00:47,597 INFO L87 Difference]: Start difference. First operand 513 states and 650 transitions. Second operand 49 states. [2019-10-02 00:00:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:00:48,548 INFO L93 Difference]: Finished difference Result 678 states and 824 transitions. [2019-10-02 00:00:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 00:00:48,548 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 374 [2019-10-02 00:00:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:00:48,551 INFO L225 Difference]: With dead ends: 678 [2019-10-02 00:00:48,551 INFO L226 Difference]: Without dead ends: 532 [2019-10-02 00:00:48,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 00:00:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-02 00:00:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 524. [2019-10-02 00:00:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-10-02 00:00:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 664 transitions. [2019-10-02 00:00:48,561 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 664 transitions. Word has length 374 [2019-10-02 00:00:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:00:48,561 INFO L475 AbstractCegarLoop]: Abstraction has 524 states and 664 transitions. [2019-10-02 00:00:48,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 00:00:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 664 transitions. [2019-10-02 00:00:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-02 00:00:48,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:00:48,564 INFO L411 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:00:48,564 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:00:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:00:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -609149907, now seen corresponding path program 43 times [2019-10-02 00:00:48,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:00:48,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:00:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:48,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:00:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:00:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8418 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 5221 trivial. 0 not checked. [2019-10-02 00:00:49,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:00:49,780 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:00:49,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:00:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:00:49,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 00:00:49,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:00:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8418 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-10-02 00:00:50,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:00:50,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-02 00:00:50,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 00:00:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 00:00:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 00:00:50,080 INFO L87 Difference]: Start difference. First operand 524 states and 664 transitions. Second operand 50 states. [2019-10-02 00:00:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:00:50,924 INFO L93 Difference]: Finished difference Result 692 states and 841 transitions. [2019-10-02 00:00:50,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 00:00:50,924 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 382 [2019-10-02 00:00:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:00:50,927 INFO L225 Difference]: With dead ends: 692 [2019-10-02 00:00:50,927 INFO L226 Difference]: Without dead ends: 543 [2019-10-02 00:00:50,927 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 00:00:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-10-02 00:00:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 535. [2019-10-02 00:00:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-10-02 00:00:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 678 transitions. [2019-10-02 00:00:50,935 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 678 transitions. Word has length 382 [2019-10-02 00:00:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:00:50,935 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 678 transitions. [2019-10-02 00:00:50,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 00:00:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 678 transitions. [2019-10-02 00:00:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 00:00:50,938 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:00:50,938 INFO L411 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:00:50,938 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:00:50,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:00:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash 368444631, now seen corresponding path program 44 times [2019-10-02 00:00:50,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:00:50,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:00:50,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:50,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:00:50,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:00:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8789 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 5452 trivial. 0 not checked. [2019-10-02 00:00:51,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:00:51,990 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:00:52,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:00:52,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:00:52,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:00:52,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 00:00:52,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:00:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8789 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2019-10-02 00:00:52,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:00:52,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-02 00:00:52,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 00:00:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 00:00:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 00:00:52,289 INFO L87 Difference]: Start difference. First operand 535 states and 678 transitions. Second operand 51 states. [2019-10-02 00:00:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:00:53,056 INFO L93 Difference]: Finished difference Result 706 states and 858 transitions. [2019-10-02 00:00:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 00:00:53,057 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 390 [2019-10-02 00:00:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:00:53,060 INFO L225 Difference]: With dead ends: 706 [2019-10-02 00:00:53,060 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 00:00:53,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 00:00:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 00:00:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 546. [2019-10-02 00:00:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-02 00:00:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 692 transitions. [2019-10-02 00:00:53,069 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 692 transitions. Word has length 390 [2019-10-02 00:00:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:00:53,070 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 692 transitions. [2019-10-02 00:00:53,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 00:00:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 692 transitions. [2019-10-02 00:00:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-02 00:00:53,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:00:53,072 INFO L411 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:00:53,072 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:00:53,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:00:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash -632599827, now seen corresponding path program 45 times [2019-10-02 00:00:53,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:00:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:00:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:53,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:00:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:00:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:00:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9168 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 5688 trivial. 0 not checked. [2019-10-02 00:00:54,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:00:54,164 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:00:54,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:01:47,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-10-02 00:01:47,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:01:47,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-02 00:01:47,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:01:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9168 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2019-10-02 00:01:47,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:01:47,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-10-02 00:01:47,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 00:01:47,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 00:01:47,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 00:01:47,246 INFO L87 Difference]: Start difference. First operand 546 states and 692 transitions. Second operand 52 states. [2019-10-02 00:01:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:01:48,034 INFO L93 Difference]: Finished difference Result 720 states and 875 transitions. [2019-10-02 00:01:48,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 00:01:48,034 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 398 [2019-10-02 00:01:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:01:48,037 INFO L225 Difference]: With dead ends: 720 [2019-10-02 00:01:48,037 INFO L226 Difference]: Without dead ends: 565 [2019-10-02 00:01:48,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 00:01:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-02 00:01:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 557. [2019-10-02 00:01:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-02 00:01:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 706 transitions. [2019-10-02 00:01:48,044 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 706 transitions. Word has length 398 [2019-10-02 00:01:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:01:48,045 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 706 transitions. [2019-10-02 00:01:48,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 00:01:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 706 transitions. [2019-10-02 00:01:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-10-02 00:01:48,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:01:48,048 INFO L411 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:01:48,048 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:01:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:01:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash -533648361, now seen corresponding path program 46 times [2019-10-02 00:01:48,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:01:48,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:01:48,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:01:48,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:01:48,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:01:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:01:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9555 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 5929 trivial. 0 not checked. [2019-10-02 00:01:49,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:01:49,127 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:01:49,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:01:49,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:01:49,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:01:49,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 00:01:49,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:01:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9555 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-10-02 00:01:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:01:49,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-02 00:01:49,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 00:01:49,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 00:01:49,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 00:01:49,428 INFO L87 Difference]: Start difference. First operand 557 states and 706 transitions. Second operand 53 states. [2019-10-02 00:01:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:01:50,421 INFO L93 Difference]: Finished difference Result 734 states and 892 transitions. [2019-10-02 00:01:50,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 00:01:50,422 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 406 [2019-10-02 00:01:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:01:50,424 INFO L225 Difference]: With dead ends: 734 [2019-10-02 00:01:50,424 INFO L226 Difference]: Without dead ends: 576 [2019-10-02 00:01:50,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 00:01:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-02 00:01:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 568. [2019-10-02 00:01:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-02 00:01:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 720 transitions. [2019-10-02 00:01:50,433 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 720 transitions. Word has length 406 [2019-10-02 00:01:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:01:50,433 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 720 transitions. [2019-10-02 00:01:50,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 00:01:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 720 transitions. [2019-10-02 00:01:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-02 00:01:50,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:01:50,436 INFO L411 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:01:50,437 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:01:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:01:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash 590260653, now seen corresponding path program 47 times [2019-10-02 00:01:50,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:01:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:01:50,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:01:50,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:01:50,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:01:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:01:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9950 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 6175 trivial. 0 not checked. [2019-10-02 00:01:51,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:01:51,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:01:51,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:01:55,016 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-10-02 00:01:55,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:01:55,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-02 00:01:55,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:01:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9950 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 6175 trivial. 0 not checked. [2019-10-02 00:01:55,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:01:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-02 00:01:55,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 00:01:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 00:01:55,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 00:01:55,232 INFO L87 Difference]: Start difference. First operand 568 states and 720 transitions. Second operand 54 states. [2019-10-02 00:01:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:01:56,338 INFO L93 Difference]: Finished difference Result 748 states and 909 transitions. [2019-10-02 00:01:56,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 00:01:56,338 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 414 [2019-10-02 00:01:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:01:56,341 INFO L225 Difference]: With dead ends: 748 [2019-10-02 00:01:56,341 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 00:01:56,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 00:01:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 00:01:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 579. [2019-10-02 00:01:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-02 00:01:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 734 transitions. [2019-10-02 00:01:56,349 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 734 transitions. Word has length 414 [2019-10-02 00:01:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:01:56,350 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 734 transitions. [2019-10-02 00:01:56,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 00:01:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 734 transitions. [2019-10-02 00:01:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-02 00:01:56,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:01:56,352 INFO L411 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:01:56,352 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:01:56,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:01:56,352 INFO L82 PathProgramCache]: Analyzing trace with hash -302439593, now seen corresponding path program 48 times [2019-10-02 00:01:56,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:01:56,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:01:56,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:01:56,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:01:56,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:01:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:01:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10353 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 6426 trivial. 0 not checked. [2019-10-02 00:01:57,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:01:57,523 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:01:57,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:04:34,491 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-10-02 00:04:34,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:04:34,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 00:04:34,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:04:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10353 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 3927 trivial. 0 not checked. [2019-10-02 00:04:34,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:04:34,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-02 00:04:34,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 00:04:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 00:04:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 00:04:34,709 INFO L87 Difference]: Start difference. First operand 579 states and 734 transitions. Second operand 55 states. [2019-10-02 00:04:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:04:35,465 INFO L93 Difference]: Finished difference Result 762 states and 926 transitions. [2019-10-02 00:04:35,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 00:04:35,465 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 422 [2019-10-02 00:04:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:04:35,469 INFO L225 Difference]: With dead ends: 762 [2019-10-02 00:04:35,469 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 00:04:35,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 00:04:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 00:04:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 590. [2019-10-02 00:04:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 00:04:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 748 transitions. [2019-10-02 00:04:35,478 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 748 transitions. Word has length 422 [2019-10-02 00:04:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:04:35,478 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 748 transitions. [2019-10-02 00:04:35,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 00:04:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 748 transitions. [2019-10-02 00:04:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-10-02 00:04:35,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:04:35,481 INFO L411 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:04:35,481 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:04:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:04:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash -264816531, now seen corresponding path program 49 times [2019-10-02 00:04:35,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:04:35,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:04:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:04:35,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:04:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:04:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:04:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10764 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 6682 trivial. 0 not checked. [2019-10-02 00:04:36,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:04:36,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:04:36,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:04:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:04:36,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-02 00:04:36,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:04:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10764 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-10-02 00:04:37,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:04:37,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-02 00:04:37,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 00:04:37,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 00:04:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 00:04:37,025 INFO L87 Difference]: Start difference. First operand 590 states and 748 transitions. Second operand 56 states. [2019-10-02 00:04:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:04:37,810 INFO L93 Difference]: Finished difference Result 776 states and 943 transitions. [2019-10-02 00:04:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 00:04:37,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 430 [2019-10-02 00:04:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:04:37,814 INFO L225 Difference]: With dead ends: 776 [2019-10-02 00:04:37,814 INFO L226 Difference]: Without dead ends: 609 [2019-10-02 00:04:37,815 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 00:04:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-10-02 00:04:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 601. [2019-10-02 00:04:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-02 00:04:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 762 transitions. [2019-10-02 00:04:37,824 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 762 transitions. Word has length 430 [2019-10-02 00:04:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:04:37,825 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 762 transitions. [2019-10-02 00:04:37,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 00:04:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 762 transitions. [2019-10-02 00:04:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 00:04:37,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:04:37,828 INFO L411 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:04:37,828 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:04:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:04:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1611535721, now seen corresponding path program 50 times [2019-10-02 00:04:37,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:04:37,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:04:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:04:37,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:04:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:04:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:04:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11183 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 6943 trivial. 0 not checked. [2019-10-02 00:04:39,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:04:39,074 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:04:39,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:04:39,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:04:39,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:04:39,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 00:04:39,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:04:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11183 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 4240 trivial. 0 not checked. [2019-10-02 00:04:39,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:04:39,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-02 00:04:39,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-02 00:04:39,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-02 00:04:39,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 00:04:39,426 INFO L87 Difference]: Start difference. First operand 601 states and 762 transitions. Second operand 57 states. [2019-10-02 00:04:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:04:40,369 INFO L93 Difference]: Finished difference Result 790 states and 960 transitions. [2019-10-02 00:04:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 00:04:40,370 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 438 [2019-10-02 00:04:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:04:40,373 INFO L225 Difference]: With dead ends: 790 [2019-10-02 00:04:40,373 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 00:04:40,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 00:04:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 00:04:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 612. [2019-10-02 00:04:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 00:04:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-10-02 00:04:40,382 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 438 [2019-10-02 00:04:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:04:40,383 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-10-02 00:04:40,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-02 00:04:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-10-02 00:04:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-02 00:04:40,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:04:40,385 INFO L411 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:04:40,385 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:04:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:04:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1505691859, now seen corresponding path program 51 times [2019-10-02 00:04:40,385 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:04:40,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:04:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:04:40,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:04:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:04:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:04:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11610 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 7209 trivial. 0 not checked. [2019-10-02 00:04:41,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:04:41,691 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:04:41,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:07:12,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-10-02 00:07:12,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:07:12,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-02 00:07:12,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:07:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11610 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 7209 trivial. 0 not checked. [2019-10-02 00:07:12,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:07:12,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-10-02 00:07:12,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-02 00:07:12,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-02 00:07:12,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 00:07:12,371 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 58 states. [2019-10-02 00:07:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:07:13,640 INFO L93 Difference]: Finished difference Result 804 states and 977 transitions. [2019-10-02 00:07:13,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 00:07:13,640 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 446 [2019-10-02 00:07:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:07:13,643 INFO L225 Difference]: With dead ends: 804 [2019-10-02 00:07:13,643 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 00:07:13,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 00:07:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 00:07:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 623. [2019-10-02 00:07:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 00:07:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 790 transitions. [2019-10-02 00:07:13,653 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 790 transitions. Word has length 446 [2019-10-02 00:07:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:07:13,653 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 790 transitions. [2019-10-02 00:07:13,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-02 00:07:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 790 transitions. [2019-10-02 00:07:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-10-02 00:07:13,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:07:13,656 INFO L411 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:07:13,656 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:07:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:07:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1270841815, now seen corresponding path program 52 times [2019-10-02 00:07:13,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:07:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:07:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:13,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:07:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:07:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12045 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 7480 trivial. 0 not checked. [2019-10-02 00:07:14,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:07:14,990 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:07:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:07:15,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:07:15,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:07:15,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-02 00:07:15,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:07:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12045 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2019-10-02 00:07:15,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:07:15,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-02 00:07:15,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 00:07:15,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 00:07:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 00:07:15,359 INFO L87 Difference]: Start difference. First operand 623 states and 790 transitions. Second operand 59 states. [2019-10-02 00:07:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:07:16,497 INFO L93 Difference]: Finished difference Result 818 states and 994 transitions. [2019-10-02 00:07:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 00:07:16,498 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 454 [2019-10-02 00:07:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:07:16,500 INFO L225 Difference]: With dead ends: 818 [2019-10-02 00:07:16,500 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 00:07:16,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 00:07:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 00:07:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 634. [2019-10-02 00:07:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-02 00:07:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 804 transitions. [2019-10-02 00:07:16,511 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 804 transitions. Word has length 454 [2019-10-02 00:07:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:07:16,511 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 804 transitions. [2019-10-02 00:07:16,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 00:07:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 804 transitions. [2019-10-02 00:07:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-10-02 00:07:16,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:07:16,515 INFO L411 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:07:16,515 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:07:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:07:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1792547347, now seen corresponding path program 53 times [2019-10-02 00:07:16,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:07:16,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:07:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:16,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:07:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:07:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12488 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 7756 trivial. 0 not checked. [2019-10-02 00:07:17,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:07:17,914 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:07:18,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:07:44,563 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-10-02 00:07:44,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:07:44,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-02 00:07:44,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:07:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12488 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 7756 trivial. 0 not checked. [2019-10-02 00:07:44,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:07:44,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-02 00:07:44,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-02 00:07:44,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-02 00:07:44,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 00:07:44,710 INFO L87 Difference]: Start difference. First operand 634 states and 804 transitions. Second operand 60 states. [2019-10-02 00:07:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:07:46,060 INFO L93 Difference]: Finished difference Result 832 states and 1011 transitions. [2019-10-02 00:07:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 00:07:46,061 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 462 [2019-10-02 00:07:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:07:46,063 INFO L225 Difference]: With dead ends: 832 [2019-10-02 00:07:46,063 INFO L226 Difference]: Without dead ends: 653 [2019-10-02 00:07:46,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 00:07:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-02 00:07:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 645. [2019-10-02 00:07:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 00:07:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 818 transitions. [2019-10-02 00:07:46,074 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 818 transitions. Word has length 462 [2019-10-02 00:07:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:07:46,075 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 818 transitions. [2019-10-02 00:07:46,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-02 00:07:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 818 transitions. [2019-10-02 00:07:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-10-02 00:07:46,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:07:46,078 INFO L411 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:07:46,078 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:07:46,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:07:46,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2080762135, now seen corresponding path program 54 times [2019-10-02 00:07:46,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:07:46,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:07:46,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:46,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:07:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:07:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:07:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12939 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 8037 trivial. 0 not checked. [2019-10-02 00:07:47,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:07:47,511 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:07:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE