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/loop-acceleration/array_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:41:49,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:41:49,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:41:49,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:41:49,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:41:49,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:41:49,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:41:49,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:41:49,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:41:49,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:41:49,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:41:49,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:41:49,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:41:49,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:41:49,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:41:49,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:41:49,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:41:49,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:41:49,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:41:49,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:41:49,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:41:49,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:41:49,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:41:49,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:41:49,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:41:49,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:41:49,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:41:49,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:41:49,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:41:49,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:41:49,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:41:49,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:41:49,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:41:49,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:41:49,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:41:49,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:41:49,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:41:49,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:41:49,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:41:49,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:41:49,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:41:49,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:41:49,662 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:41:49,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:41:49,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:41:49,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:41:49,664 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:41:49,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:41:49,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:41:49,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:41:49,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:41:49,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:41:49,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:41:49,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:41:49,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:41:49,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:41:49,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:41:49,666 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:41:49,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:41:49,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:41:49,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:41:49,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:41:49,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:41:49,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:41:49,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:41:49,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:41:49,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:41:49,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:41:49,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:41:49,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:41:49,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:41:49,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:41:49,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:41:49,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:41:49,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:41:49,741 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:41:49,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_4.i [2019-09-05 11:41:49,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cc3c251/56c7daa35df840a7836fe56c6e7239e7/FLAGf3663b0dc [2019-09-05 11:41:50,231 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:41:50,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_4.i [2019-09-05 11:41:50,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cc3c251/56c7daa35df840a7836fe56c6e7239e7/FLAGf3663b0dc [2019-09-05 11:41:50,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cc3c251/56c7daa35df840a7836fe56c6e7239e7 [2019-09-05 11:41:50,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:41:50,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:41:50,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:41:50,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:41:50,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:41:50,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:50,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8518d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50, skipping insertion in model container [2019-09-05 11:41:50,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:50,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:41:50,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:41:50,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:41:50,859 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:41:50,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:41:50,895 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:41:50,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50 WrapperNode [2019-09-05 11:41:50,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:41:50,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:41:50,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:41:50,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:41:50,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:50,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:51,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:51,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:51,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:51,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:51,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... [2019-09-05 11:41:51,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:41:51,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:41:51,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:41:51,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:41:51,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:41:51,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:41:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:41:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:41:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:41:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:41:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:41:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:41:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:41:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:41:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:41:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:41:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:41:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:41:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:41:51,274 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:41:51,277 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 11:41:51,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:41:51 BoogieIcfgContainer [2019-09-05 11:41:51,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:41:51,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:41:51,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:41:51,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:41:51,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:41:50" (1/3) ... [2019-09-05 11:41:51,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffcbc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:41:51, skipping insertion in model container [2019-09-05 11:41:51,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:41:50" (2/3) ... [2019-09-05 11:41:51,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffcbc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:41:51, skipping insertion in model container [2019-09-05 11:41:51,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:41:51" (3/3) ... [2019-09-05 11:41:51,299 INFO L109 eAbstractionObserver]: Analyzing ICFG array_4.i [2019-09-05 11:41:51,321 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:41:51,328 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:41:51,344 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:41:51,383 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:41:51,383 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:41:51,383 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:41:51,384 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:41:51,384 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:41:51,384 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:41:51,384 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:41:51,384 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:41:51,384 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:41:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-05 11:41:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:41:51,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:51,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:51,405 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1816719235, now seen corresponding path program 1 times [2019-09-05 11:41:51,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:51,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:51,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:41:51,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:41:51,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:41:51,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:41:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:41:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:41:51,547 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-05 11:41:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:51,566 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-09-05 11:41:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:41:51,567 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-05 11:41:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:51,573 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:41:51,573 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:41:51,576 INFO L628 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-09-05 11:41:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:41:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:41:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:41:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-05 11:41:51,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2019-09-05 11:41:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:51,607 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-05 11:41:51,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:41:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-05 11:41:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:41:51,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:51,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:51,609 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1663088498, now seen corresponding path program 1 times [2019-09-05 11:41:51,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:51,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:51,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:51,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:41:51,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:41:51,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:41:51,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:41:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:41:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:41:51,660 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2019-09-05 11:41:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:51,700 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-05 11:41:51,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:41:51,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 11:41:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:51,703 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:41:51,703 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:41:51,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:41:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:41:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-09-05 11:41:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:41:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-05 11:41:51,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-09-05 11:41:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:51,710 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-05 11:41:51,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:41:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-05 11:41:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:41:51,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:51,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:51,711 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash 845539860, now seen corresponding path program 1 times [2019-09-05 11:41:51,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:51,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:41:51,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:41:51,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:41:51,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:41:51,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:41:51,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:41:51,816 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2019-09-05 11:41:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:51,875 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-09-05 11:41:51,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:41:51,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 11:41:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:51,877 INFO L225 Difference]: With dead ends: 27 [2019-09-05 11:41:51,877 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:41:51,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:41:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:41:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-05 11:41:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 11:41:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-05 11:41:51,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-09-05 11:41:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:51,883 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-05 11:41:51,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:41:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-05 11:41:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:41:51,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:51,885 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:51,885 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash 221784433, now seen corresponding path program 1 times [2019-09-05 11:41:51,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:41:51,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:51,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:41:51,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:52,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 11:41:52,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:41:52,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:52,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-09-05 11:41:52,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:41:52,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:41:52,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:41:52,088 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-09-05 11:41:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:52,181 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-09-05 11:41:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:41:52,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-05 11:41:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:52,182 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:41:52,182 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:41:52,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:41:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:41:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-05 11:41:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:41:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-05 11:41:52,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2019-09-05 11:41:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:52,190 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-05 11:41:52,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:41:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-05 11:41:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:41:52,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:52,191 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:52,191 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:52,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1899315606, now seen corresponding path program 2 times [2019-09-05 11:41:52,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:52,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:41:52,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:52,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:52,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:41:52,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:41:52,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:52,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:41:52,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 11:41:52,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:52,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-09-05 11:41:52,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:41:52,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:41:52,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:41:52,338 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2019-09-05 11:41:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:52,419 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-09-05 11:41:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:41:52,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-09-05 11:41:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:52,420 INFO L225 Difference]: With dead ends: 49 [2019-09-05 11:41:52,420 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:41:52,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:41:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:41:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-05 11:41:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:41:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-05 11:41:52,427 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2019-09-05 11:41:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:52,428 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-05 11:41:52,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:41:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-05 11:41:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:41:52,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:52,429 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:52,430 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2019962701, now seen corresponding path program 3 times [2019-09-05 11:41:52,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:52,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:52,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:52,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:41:52,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:52,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:52,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:41:52,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:41:52,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:52,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:41:52,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 11:41:52,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:52,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-09-05 11:41:52,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:41:52,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:41:52,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:41:52,619 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2019-09-05 11:41:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:52,699 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-09-05 11:41:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:41:52,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-09-05 11:41:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:52,700 INFO L225 Difference]: With dead ends: 57 [2019-09-05 11:41:52,700 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:41:52,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:41:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:41:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-05 11:41:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:41:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-05 11:41:52,707 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2019-09-05 11:41:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:52,707 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-05 11:41:52,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:41:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-05 11:41:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:41:52,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:52,709 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:52,709 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:52,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:52,709 INFO L82 PathProgramCache]: Analyzing trace with hash -73516102, now seen corresponding path program 4 times [2019-09-05 11:41:52,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:52,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:52,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 11:41:52,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:52,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:41:52,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:52,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:41:52,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:52,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:41:52,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 11:41:52,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:52,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-09-05 11:41:52,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:41:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:41:52,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:41:52,893 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2019-09-05 11:41:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:52,976 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2019-09-05 11:41:52,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:41:52,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-09-05 11:41:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:52,978 INFO L225 Difference]: With dead ends: 65 [2019-09-05 11:41:52,978 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:41:52,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:41:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:41:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-05 11:41:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:41:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-05 11:41:52,984 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2019-09-05 11:41:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:52,985 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-05 11:41:52,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:41:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-05 11:41:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:41:52,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:52,986 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:52,986 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash -669211351, now seen corresponding path program 5 times [2019-09-05 11:41:52,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:52,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 11:41:53,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:53,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:41:53,164 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 11:41:53,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:53,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:41:53,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 11:41:53,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:53,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-09-05 11:41:53,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:41:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:41:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:41:53,197 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-05 11:41:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:53,286 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-09-05 11:41:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:41:53,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-09-05 11:41:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:53,287 INFO L225 Difference]: With dead ends: 73 [2019-09-05 11:41:53,288 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 11:41:53,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:41:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 11:41:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-09-05 11:41:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 11:41:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-05 11:41:53,294 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2019-09-05 11:41:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:53,294 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-05 11:41:53,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:41:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-05 11:41:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:41:53,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:53,295 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:53,296 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:53,296 INFO L82 PathProgramCache]: Analyzing trace with hash -37624354, now seen corresponding path program 6 times [2019-09-05 11:41:53,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:53,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:53,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:53,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:41:53,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:53,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:41:53,498 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:41:53,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:53,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:41:53,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:41:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:41:53,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:53,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2019-09-05 11:41:53,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:41:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:41:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:41:53,568 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 14 states. [2019-09-05 11:41:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:53,682 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2019-09-05 11:41:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:41:53,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-09-05 11:41:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:53,684 INFO L225 Difference]: With dead ends: 81 [2019-09-05 11:41:53,684 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 11:41:53,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:41:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 11:41:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-09-05 11:41:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 11:41:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-05 11:41:53,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2019-09-05 11:41:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:53,690 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-05 11:41:53,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:41:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-05 11:41:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:41:53,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:53,691 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:53,692 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash 37047045, now seen corresponding path program 7 times [2019-09-05 11:41:53,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:53,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:53,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 11:41:53,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:53,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:41:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:53,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:41:53,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 11:41:53,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:53,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2019-09-05 11:41:53,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:41:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:41:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:41:53,884 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 13 states. [2019-09-05 11:41:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:53,984 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-09-05 11:41:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:41:53,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-09-05 11:41:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:53,986 INFO L225 Difference]: With dead ends: 89 [2019-09-05 11:41:53,987 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 11:41:53,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:41:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 11:41:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-05 11:41:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:41:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-05 11:41:54,001 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2019-09-05 11:41:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:54,005 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-05 11:41:54,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:41:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-05 11:41:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:41:54,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:54,007 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:54,007 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1182367742, now seen corresponding path program 8 times [2019-09-05 11:41:54,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:54,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:54,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 11:41:54,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:54,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:41:54,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:54,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:41:54,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:54,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:41:54,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:41:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-09-05 11:41:54,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:41:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:41:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:41:54,243 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 14 states. [2019-09-05 11:41:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:54,331 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-09-05 11:41:54,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:41:54,332 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-09-05 11:41:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:54,332 INFO L225 Difference]: With dead ends: 97 [2019-09-05 11:41:54,333 INFO L226 Difference]: Without dead ends: 62 [2019-09-05 11:41:54,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:41:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-05 11:41:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-09-05 11:41:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 11:41:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-05 11:41:54,339 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2019-09-05 11:41:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:54,340 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-05 11:41:54,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:41:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-05 11:41:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-05 11:41:54,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:54,343 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:54,343 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1274421023, now seen corresponding path program 9 times [2019-09-05 11:41:54,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:54,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:54,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:54,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:54,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 11:41:54,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:54,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:54,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:41:54,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 11:41:54,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:54,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:41:54,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:54,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:41:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 11:41:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:54,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2019-09-05 11:41:54,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:41:54,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:41:54,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:41:54,656 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 17 states. [2019-09-05 11:41:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:54,782 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2019-09-05 11:41:54,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:41:54,782 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-09-05 11:41:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:54,783 INFO L225 Difference]: With dead ends: 105 [2019-09-05 11:41:54,783 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:41:54,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:41:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:41:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-09-05 11:41:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 11:41:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-05 11:41:54,791 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2019-09-05 11:41:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:54,792 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-05 11:41:54,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:41:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-05 11:41:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 11:41:54,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:54,793 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:54,793 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1532119590, now seen corresponding path program 10 times [2019-09-05 11:41:54,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:54,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:54,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 11:41:54,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:54,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:41:54,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:41:54,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:54,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:41:54,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-05 11:41:55,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:55,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2019-09-05 11:41:55,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:41:55,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:41:55,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:41:55,030 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 16 states. [2019-09-05 11:41:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:55,133 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2019-09-05 11:41:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:41:55,133 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2019-09-05 11:41:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:55,134 INFO L225 Difference]: With dead ends: 113 [2019-09-05 11:41:55,134 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 11:41:55,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:41:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 11:41:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-05 11:41:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 11:41:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-05 11:41:55,141 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2019-09-05 11:41:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:55,142 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-05 11:41:55,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:41:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-05 11:41:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-05 11:41:55,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:55,143 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:55,143 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:55,144 INFO L82 PathProgramCache]: Analyzing trace with hash -294377795, now seen corresponding path program 11 times [2019-09-05 11:41:55,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:55,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:55,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:55,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:55,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-05 11:41:55,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:55,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:41:55,313 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:55,387 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 11:41:55,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:55,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:41:55,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-05 11:41:55,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:55,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-09-05 11:41:55,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:41:55,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:41:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:41:55,419 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 17 states. [2019-09-05 11:41:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:55,504 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-09-05 11:41:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:41:55,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-05 11:41:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:55,506 INFO L225 Difference]: With dead ends: 121 [2019-09-05 11:41:55,506 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 11:41:55,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:41:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 11:41:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-09-05 11:41:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 11:41:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-05 11:41:55,513 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 69 [2019-09-05 11:41:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:55,513 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-05 11:41:55,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:41:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-05 11:41:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 11:41:55,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:55,514 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:55,514 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1643412406, now seen corresponding path program 12 times [2019-09-05 11:41:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:55,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 11:41:55,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:55,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:55,663 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:41:55,876 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:41:55,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:55,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:41:55,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:41:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 11:41:55,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:55,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2019-09-05 11:41:55,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:41:55,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:41:55,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:41:55,938 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2019-09-05 11:41:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:56,064 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2019-09-05 11:41:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:41:56,065 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2019-09-05 11:41:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:56,066 INFO L225 Difference]: With dead ends: 129 [2019-09-05 11:41:56,066 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 11:41:56,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:41:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 11:41:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-09-05 11:41:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 11:41:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-05 11:41:56,075 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2019-09-05 11:41:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:56,075 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-05 11:41:56,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:41:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-05 11:41:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 11:41:56,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:56,076 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:56,076 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1372445849, now seen corresponding path program 13 times [2019-09-05 11:41:56,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:56,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:56,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-05 11:41:56,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:56,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:56,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:56,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:41:56,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-05 11:41:56,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2019-09-05 11:41:56,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:41:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:41:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:41:56,351 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 19 states. [2019-09-05 11:41:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:56,468 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2019-09-05 11:41:56,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:41:56,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2019-09-05 11:41:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:56,470 INFO L225 Difference]: With dead ends: 137 [2019-09-05 11:41:56,470 INFO L226 Difference]: Without dead ends: 87 [2019-09-05 11:41:56,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:41:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-05 11:41:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-09-05 11:41:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-05 11:41:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-09-05 11:41:56,482 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 79 [2019-09-05 11:41:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:56,483 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-09-05 11:41:56,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:41:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-09-05 11:41:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-05 11:41:56,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:56,484 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:56,484 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1863872110, now seen corresponding path program 14 times [2019-09-05 11:41:56,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:41:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 11:41:56,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:56,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:41:56,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:56,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:41:56,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:56,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:41:56,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:41:56,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:56,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2019-09-05 11:41:56,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:41:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:41:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:41:56,786 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 20 states. [2019-09-05 11:41:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:56,911 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-09-05 11:41:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:41:56,912 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2019-09-05 11:41:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:56,914 INFO L225 Difference]: With dead ends: 145 [2019-09-05 11:41:56,914 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 11:41:56,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:41:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 11:41:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-09-05 11:41:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-05 11:41:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-05 11:41:56,921 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 84 [2019-09-05 11:41:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:56,921 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-05 11:41:56,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:41:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-05 11:41:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-05 11:41:56,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:56,923 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:56,923 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2045821557, now seen corresponding path program 15 times [2019-09-05 11:41:56,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:56,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:56,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 11:41:57,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:57,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:41:57,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:57,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 11:41:57,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:57,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:41:57,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-05 11:41:57,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:57,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-09-05 11:41:57,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:41:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:41:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:41:57,586 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 21 states. [2019-09-05 11:41:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:57,693 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2019-09-05 11:41:57,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:41:57,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2019-09-05 11:41:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:57,694 INFO L225 Difference]: With dead ends: 153 [2019-09-05 11:41:57,694 INFO L226 Difference]: Without dead ends: 97 [2019-09-05 11:41:57,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:41:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-05 11:41:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-09-05 11:41:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 11:41:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-05 11:41:57,699 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 89 [2019-09-05 11:41:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:57,700 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-05 11:41:57,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:41:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-05 11:41:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 11:41:57,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:57,701 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:57,701 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:57,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1839249262, now seen corresponding path program 16 times [2019-09-05 11:41:57,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:57,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:57,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 11:41:57,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:57,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:57,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:41:57,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:41:57,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:57,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:41:57,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:41:58,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:58,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2019-09-05 11:41:58,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:41:58,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:41:58,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:41:58,002 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 22 states. [2019-09-05 11:41:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:58,148 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2019-09-05 11:41:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:41:58,148 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 94 [2019-09-05 11:41:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:58,149 INFO L225 Difference]: With dead ends: 161 [2019-09-05 11:41:58,149 INFO L226 Difference]: Without dead ends: 102 [2019-09-05 11:41:58,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:41:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-05 11:41:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-09-05 11:41:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 11:41:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-05 11:41:58,154 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 94 [2019-09-05 11:41:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:58,155 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-05 11:41:58,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:41:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-05 11:41:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-05 11:41:58,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:58,156 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:58,156 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1513527377, now seen corresponding path program 17 times [2019-09-05 11:41:58,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:58,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-05 11:41:58,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:58,359 INFO L223 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-09-05 11:41:58,370 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:41:58,563 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-05 11:41:58,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:58,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:41:58,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-05 11:41:58,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:58,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2019-09-05 11:41:58,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:41:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:41:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:41:58,597 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 23 states. [2019-09-05 11:41:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:58,746 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-09-05 11:41:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:41:58,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2019-09-05 11:41:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:58,747 INFO L225 Difference]: With dead ends: 169 [2019-09-05 11:41:58,747 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 11:41:58,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:41:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 11:41:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-09-05 11:41:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-05 11:41:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-09-05 11:41:58,752 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 99 [2019-09-05 11:41:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:58,752 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-09-05 11:41:58,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:41:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-09-05 11:41:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-05 11:41:58,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:58,754 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:58,754 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1179013814, now seen corresponding path program 18 times [2019-09-05 11:41:58,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:58,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-05 11:41:58,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:58,972 INFO L223 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-09-05 11:41:58,982 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:42:00,342 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:42:00,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:00,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:42:00,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-05 11:42:00,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:00,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-09-05 11:42:00,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:42:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:42:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:42:00,377 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 24 states. [2019-09-05 11:42:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:00,508 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2019-09-05 11:42:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:42:00,508 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 104 [2019-09-05 11:42:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:00,509 INFO L225 Difference]: With dead ends: 177 [2019-09-05 11:42:00,510 INFO L226 Difference]: Without dead ends: 112 [2019-09-05 11:42:00,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=361, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:42:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-05 11:42:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-05 11:42:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-05 11:42:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-05 11:42:00,514 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 104 [2019-09-05 11:42:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:00,514 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-05 11:42:00,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:42:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-05 11:42:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-05 11:42:00,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:00,516 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:00,516 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1720115667, now seen corresponding path program 19 times [2019-09-05 11:42:00,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:00,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:00,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-05 11:42:00,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:00,760 INFO L223 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-09-05 11:42:00,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:00,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:42:00,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-05 11:42:00,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:00,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2019-09-05 11:42:00,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:42:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:42:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:42:00,861 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 25 states. [2019-09-05 11:42:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:01,043 INFO L93 Difference]: Finished difference Result 185 states and 188 transitions. [2019-09-05 11:42:01,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:42:01,046 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2019-09-05 11:42:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:01,047 INFO L225 Difference]: With dead ends: 185 [2019-09-05 11:42:01,047 INFO L226 Difference]: Without dead ends: 117 [2019-09-05 11:42:01,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:42:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-05 11:42:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-09-05 11:42:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-05 11:42:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-09-05 11:42:01,052 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 109 [2019-09-05 11:42:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:01,052 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-09-05 11:42:01,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:42:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-09-05 11:42:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 11:42:01,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:01,053 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:01,053 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash -407647014, now seen corresponding path program 20 times [2019-09-05 11:42:01,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:01,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:01,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:01,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:01,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-05 11:42:01,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:01,324 INFO L223 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-09-05 11:42:01,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:42:01,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:42:01,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:01,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:42:01,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-05 11:42:01,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:01,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2019-09-05 11:42:01,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:42:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:42:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:42:01,433 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 26 states. [2019-09-05 11:42:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:01,565 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-09-05 11:42:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:42:01,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 114 [2019-09-05 11:42:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:01,567 INFO L225 Difference]: With dead ends: 193 [2019-09-05 11:42:01,567 INFO L226 Difference]: Without dead ends: 122 [2019-09-05 11:42:01,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=284, Invalid=418, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:42:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-05 11:42:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-09-05 11:42:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-05 11:42:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-05 11:42:01,572 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 114 [2019-09-05 11:42:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:01,573 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-05 11:42:01,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:42:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-05 11:42:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-05 11:42:01,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:01,574 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:01,575 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -300805111, now seen corresponding path program 21 times [2019-09-05 11:42:01,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:01,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-05 11:42:01,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:01,844 INFO L223 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-09-05 11:42:01,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:42:03,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 11:42:03,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:03,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 11:42:03,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:42:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-05 11:42:03,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:03,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 29 [2019-09-05 11:42:03,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:42:03,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:42:03,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:42:03,811 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 29 states. [2019-09-05 11:42:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:04,012 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2019-09-05 11:42:04,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:42:04,013 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 119 [2019-09-05 11:42:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:04,013 INFO L225 Difference]: With dead ends: 201 [2019-09-05 11:42:04,013 INFO L226 Difference]: Without dead ends: 127 [2019-09-05 11:42:04,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:42:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-05 11:42:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-09-05 11:42:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-05 11:42:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-09-05 11:42:04,018 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 119 [2019-09-05 11:42:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:04,018 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-09-05 11:42:04,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:42:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-09-05 11:42:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-05 11:42:04,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:04,019 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:04,019 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1777469698, now seen corresponding path program 22 times [2019-09-05 11:42:04,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:04,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:04,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-05 11:42:04,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:04,374 INFO L223 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-09-05 11:42:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:42:04,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:42:04,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:04,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:42:04,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:42:04,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:04,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 28 [2019-09-05 11:42:04,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:42:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:42:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:42:04,469 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 28 states. [2019-09-05 11:42:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:04,641 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2019-09-05 11:42:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:42:04,641 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 124 [2019-09-05 11:42:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:04,643 INFO L225 Difference]: With dead ends: 209 [2019-09-05 11:42:04,643 INFO L226 Difference]: Without dead ends: 132 [2019-09-05 11:42:04,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=333, Invalid=479, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:42:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-05 11:42:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-09-05 11:42:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-05 11:42:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-05 11:42:04,649 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 124 [2019-09-05 11:42:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:04,649 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-05 11:42:04,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:42:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-05 11:42:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-05 11:42:04,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:04,650 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:04,651 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2044410341, now seen corresponding path program 23 times [2019-09-05 11:42:04,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:04,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:04,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-05 11:42:05,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:05,134 INFO L223 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) [2019-09-05 11:42:05,148 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:05,550 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-05 11:42:05,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:05,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:42:05,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-09-05 11:42:05,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:05,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2019-09-05 11:42:05,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:42:05,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:42:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:42:05,592 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 29 states. [2019-09-05 11:42:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:05,801 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-09-05 11:42:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:42:05,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 129 [2019-09-05 11:42:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:05,802 INFO L225 Difference]: With dead ends: 217 [2019-09-05 11:42:05,802 INFO L226 Difference]: Without dead ends: 137 [2019-09-05 11:42:05,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:42:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-05 11:42:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-09-05 11:42:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-05 11:42:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-09-05 11:42:05,807 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 129 [2019-09-05 11:42:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:05,807 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-09-05 11:42:05,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:42:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-09-05 11:42:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-05 11:42:05,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:05,809 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:05,809 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:05,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash -683994846, now seen corresponding path program 24 times [2019-09-05 11:42:05,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:05,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:05,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:05,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-05 11:42:06,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:06,159 INFO L223 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-09-05 11:42:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:42:09,545 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 11:42:09,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:09,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:42:09,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-09-05 11:42:09,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:09,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 30 [2019-09-05 11:42:09,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:42:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:42:09,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=488, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:42:09,588 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 30 states. [2019-09-05 11:42:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:09,783 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2019-09-05 11:42:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:42:09,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 134 [2019-09-05 11:42:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:09,785 INFO L225 Difference]: With dead ends: 225 [2019-09-05 11:42:09,785 INFO L226 Difference]: Without dead ends: 142 [2019-09-05 11:42:09,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=544, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:42:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-05 11:42:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-09-05 11:42:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-05 11:42:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2019-09-05 11:42:09,791 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 134 [2019-09-05 11:42:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:09,791 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2019-09-05 11:42:09,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:42:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2019-09-05 11:42:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-05 11:42:09,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:09,793 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:09,793 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash 640569281, now seen corresponding path program 25 times [2019-09-05 11:42:09,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:09,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:09,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-05 11:42:10,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:10,175 INFO L223 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-09-05 11:42:10,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:10,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:42:10,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-05 11:42:10,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:10,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 31 [2019-09-05 11:42:10,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:42:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:42:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:42:10,291 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 31 states. [2019-09-05 11:42:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:10,481 INFO L93 Difference]: Finished difference Result 233 states and 236 transitions. [2019-09-05 11:42:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:42:10,481 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 139 [2019-09-05 11:42:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:10,483 INFO L225 Difference]: With dead ends: 233 [2019-09-05 11:42:10,483 INFO L226 Difference]: Without dead ends: 147 [2019-09-05 11:42:10,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=414, Invalid=578, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:42:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-05 11:42:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-05 11:42:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 11:42:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-05 11:42:10,488 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 139 [2019-09-05 11:42:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:10,488 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-05 11:42:10,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:42:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-05 11:42:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-05 11:42:10,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:10,490 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:10,490 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1000430406, now seen corresponding path program 26 times [2019-09-05 11:42:10,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:10,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:10,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-05 11:42:10,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:10,880 INFO L223 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-09-05 11:42:10,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:42:10,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:42:10,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:10,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 11:42:10,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 676 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-09-05 11:42:10,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:10,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2019-09-05 11:42:10,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:42:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:42:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:42:10,991 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 32 states. [2019-09-05 11:42:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:11,201 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-09-05 11:42:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:42:11,202 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 144 [2019-09-05 11:42:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:11,204 INFO L225 Difference]: With dead ends: 241 [2019-09-05 11:42:11,204 INFO L226 Difference]: Without dead ends: 152 [2019-09-05 11:42:11,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:42:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-05 11:42:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-09-05 11:42:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 11:42:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-09-05 11:42:11,211 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 144 [2019-09-05 11:42:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:11,212 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-09-05 11:42:11,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:42:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-09-05 11:42:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-05 11:42:11,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:11,214 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:11,215 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:11,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1763939, now seen corresponding path program 27 times [2019-09-05 11:42:11,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:11,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 11:42:11,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:11,769 INFO L223 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-09-05 11:42:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:42:15,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 11:42:15,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:15,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:42:15,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-05 11:42:15,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:15,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 33 [2019-09-05 11:42:15,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:42:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:42:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:42:15,145 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 33 states. [2019-09-05 11:42:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:15,358 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2019-09-05 11:42:15,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:42:15,358 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 149 [2019-09-05 11:42:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:15,359 INFO L225 Difference]: With dead ends: 249 [2019-09-05 11:42:15,360 INFO L226 Difference]: Without dead ends: 157 [2019-09-05 11:42:15,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=473, Invalid=649, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:42:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-05 11:42:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2019-09-05 11:42:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-05 11:42:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-09-05 11:42:15,365 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 149 [2019-09-05 11:42:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:15,365 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-09-05 11:42:15,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:42:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-09-05 11:42:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-05 11:42:15,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:15,367 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:15,368 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash 36115818, now seen corresponding path program 28 times [2019-09-05 11:42:15,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:15,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:15,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-05 11:42:15,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:15,867 INFO L223 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) [2019-09-05 11:42:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:15,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:42:15,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:15,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:42:15,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-05 11:42:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 34 [2019-09-05 11:42:15,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:42:15,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:42:15,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=622, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:42:15,998 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 34 states. [2019-09-05 11:42:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:16,192 INFO L93 Difference]: Finished difference Result 257 states and 260 transitions. [2019-09-05 11:42:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:42:16,192 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 154 [2019-09-05 11:42:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:16,194 INFO L225 Difference]: With dead ends: 257 [2019-09-05 11:42:16,194 INFO L226 Difference]: Without dead ends: 162 [2019-09-05 11:42:16,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=504, Invalid=686, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:42:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-05 11:42:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-05 11:42:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-05 11:42:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-05 11:42:16,199 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 154 [2019-09-05 11:42:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:16,200 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-05 11:42:16,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:42:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-05 11:42:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-05 11:42:16,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:16,201 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:16,202 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:16,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1822864519, now seen corresponding path program 29 times [2019-09-05 11:42:16,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:16,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:16,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 11:42:16,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:16,789 INFO L223 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) [2019-09-05 11:42:16,802 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:18,864 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-05 11:42:18,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:18,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:42:18,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-05 11:42:18,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:18,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 35 [2019-09-05 11:42:18,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:42:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:42:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:42:18,904 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 35 states. [2019-09-05 11:42:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:19,117 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-09-05 11:42:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:42:19,118 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 159 [2019-09-05 11:42:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:19,119 INFO L225 Difference]: With dead ends: 265 [2019-09-05 11:42:19,119 INFO L226 Difference]: Without dead ends: 167 [2019-09-05 11:42:19,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=536, Invalid=724, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:42:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-05 11:42:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2019-09-05 11:42:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-05 11:42:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-09-05 11:42:19,129 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 159 [2019-09-05 11:42:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:19,129 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-09-05 11:42:19,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:42:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-09-05 11:42:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-05 11:42:19,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:19,131 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:19,131 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1137541234, now seen corresponding path program 30 times [2019-09-05 11:42:19,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:19,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:19,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:19,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:19,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-05 11:42:19,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:19,766 INFO L223 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) [2019-09-05 11:42:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:38,151 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 11:42:38,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:38,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:42:38,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:38,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:42:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-05 11:42:38,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:38,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 38 [2019-09-05 11:42:38,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:42:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:42:38,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:42:38,269 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 38 states. [2019-09-05 11:42:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:38,531 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2019-09-05 11:42:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:42:38,531 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 164 [2019-09-05 11:42:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:38,532 INFO L225 Difference]: With dead ends: 273 [2019-09-05 11:42:38,532 INFO L226 Difference]: Without dead ends: 172 [2019-09-05 11:42:38,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:42:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-05 11:42:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-09-05 11:42:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-05 11:42:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-05 11:42:38,538 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 164 [2019-09-05 11:42:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:38,538 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-05 11:42:38,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:42:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-05 11:42:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-05 11:42:38,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:38,540 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:38,540 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:38,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1214558549, now seen corresponding path program 31 times [2019-09-05 11:42:38,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:38,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:38,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 11:42:39,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:39,087 INFO L223 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) [2019-09-05 11:42:39,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:39,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:42:39,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:42:39,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:39,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 37 [2019-09-05 11:42:39,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:42:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:42:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=733, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:42:39,209 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 37 states. [2019-09-05 11:42:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:39,444 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2019-09-05 11:42:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:42:39,445 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 169 [2019-09-05 11:42:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:39,447 INFO L225 Difference]: With dead ends: 281 [2019-09-05 11:42:39,447 INFO L226 Difference]: Without dead ends: 177 [2019-09-05 11:42:39,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=603, Invalid=803, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:42:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-05 11:42:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-09-05 11:42:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-05 11:42:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-05 11:42:39,453 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 169 [2019-09-05 11:42:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:39,454 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-05 11:42:39,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:42:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-05 11:42:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-05 11:42:39,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:39,455 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:39,455 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:39,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:39,456 INFO L82 PathProgramCache]: Analyzing trace with hash -240526926, now seen corresponding path program 32 times [2019-09-05 11:42:39,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:39,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:39,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:39,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-05 11:42:40,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:40,171 INFO L223 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-09-05 11:42:40,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:42:40,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:42:40,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:40,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:42:40,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-09-05 11:42:40,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:40,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 38 [2019-09-05 11:42:40,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:42:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:42:40,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:42:40,290 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 38 states. [2019-09-05 11:42:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:40,564 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-09-05 11:42:40,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:42:40,564 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 174 [2019-09-05 11:42:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:40,566 INFO L225 Difference]: With dead ends: 289 [2019-09-05 11:42:40,566 INFO L226 Difference]: Without dead ends: 182 [2019-09-05 11:42:40,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=844, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:42:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-05 11:42:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-09-05 11:42:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-05 11:42:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-09-05 11:42:40,572 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 174 [2019-09-05 11:42:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:40,572 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2019-09-05 11:42:40,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:42:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2019-09-05 11:42:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-05 11:42:40,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:40,573 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:40,573 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:40,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1100937423, now seen corresponding path program 33 times [2019-09-05 11:42:40,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:40,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:40,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:40,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 11:42:41,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:41,112 INFO L223 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-09-05 11:42:41,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:42:51,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-05 11:42:51,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:51,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:42:51,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-09-05 11:42:51,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:51,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 39 [2019-09-05 11:42:51,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:42:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:42:51,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:42:51,890 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 39 states. [2019-09-05 11:42:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:52,178 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2019-09-05 11:42:52,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 11:42:52,179 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 179 [2019-09-05 11:42:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:52,180 INFO L225 Difference]: With dead ends: 297 [2019-09-05 11:42:52,180 INFO L226 Difference]: Without dead ends: 187 [2019-09-05 11:42:52,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=674, Invalid=886, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:42:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-05 11:42:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-09-05 11:42:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-05 11:42:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-09-05 11:42:52,187 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 179 [2019-09-05 11:42:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:52,187 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-09-05 11:42:52,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:42:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-09-05 11:42:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-05 11:42:52,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:52,189 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:52,189 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -990682154, now seen corresponding path program 34 times [2019-09-05 11:42:52,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:52,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-05 11:42:52,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:52,767 INFO L223 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-09-05 11:42:52,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:42:52,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:42:52,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:52,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 11:42:52,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2019-09-05 11:42:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:52,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 40 [2019-09-05 11:42:52,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 11:42:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 11:42:52,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=853, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:42:52,911 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 40 states. [2019-09-05 11:42:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:53,156 INFO L93 Difference]: Finished difference Result 305 states and 308 transitions. [2019-09-05 11:42:53,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 11:42:53,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 184 [2019-09-05 11:42:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:53,157 INFO L225 Difference]: With dead ends: 305 [2019-09-05 11:42:53,157 INFO L226 Difference]: Without dead ends: 192 [2019-09-05 11:42:53,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=711, Invalid=929, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:42:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-05 11:42:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-09-05 11:42:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-05 11:42:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-05 11:42:53,164 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 184 [2019-09-05 11:42:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:53,164 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-05 11:42:53,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 11:42:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-05 11:42:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-05 11:42:53,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:53,166 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:53,166 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 673713421, now seen corresponding path program 35 times [2019-09-05 11:42:53,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:53,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 11:42:53,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:53,740 INFO L223 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-09-05 11:42:53,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:42:54,774 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-05 11:42:54,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:54,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:42:54,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:42:54,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:54,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 41 [2019-09-05 11:42:54,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:42:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:42:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:42:54,845 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 41 states. [2019-09-05 11:42:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:55,098 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-09-05 11:42:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 11:42:55,098 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 189 [2019-09-05 11:42:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:55,100 INFO L225 Difference]: With dead ends: 313 [2019-09-05 11:42:55,100 INFO L226 Difference]: Without dead ends: 197 [2019-09-05 11:42:55,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=749, Invalid=973, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:42:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-05 11:42:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-09-05 11:42:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-05 11:42:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-09-05 11:42:55,107 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 189 [2019-09-05 11:42:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:55,107 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-09-05 11:42:55,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:42:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-09-05 11:42:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-05 11:42:55,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:55,108 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:55,109 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1762304518, now seen corresponding path program 36 times [2019-09-05 11:42:55,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:55,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:55,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-05 11:42:55,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:55,803 INFO L223 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-09-05 11:42:55,825 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:43:38,526 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-05 11:43:38,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:38,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:43:38,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:38,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-05 11:43:38,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:38,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 44 [2019-09-05 11:43:38,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 11:43:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 11:43:38,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:43:38,631 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 44 states. [2019-09-05 11:43:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:38,944 INFO L93 Difference]: Finished difference Result 321 states and 324 transitions. [2019-09-05 11:43:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 11:43:38,948 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 194 [2019-09-05 11:43:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:38,949 INFO L225 Difference]: With dead ends: 321 [2019-09-05 11:43:38,949 INFO L226 Difference]: Without dead ends: 202 [2019-09-05 11:43:38,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:43:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-05 11:43:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-09-05 11:43:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-05 11:43:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-05 11:43:38,955 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 194 [2019-09-05 11:43:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:38,955 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-05 11:43:38,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 11:43:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-05 11:43:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-05 11:43:38,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:38,957 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:38,957 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1475116311, now seen corresponding path program 37 times [2019-09-05 11:43:38,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:38,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:38,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-05 11:43:39,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:39,590 INFO L223 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-09-05 11:43:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:39,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:43:39,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2019-09-05 11:43:39,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 43 [2019-09-05 11:43:39,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:43:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:43:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=982, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:43:39,731 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 43 states. [2019-09-05 11:43:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:40,041 INFO L93 Difference]: Finished difference Result 329 states and 332 transitions. [2019-09-05 11:43:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 11:43:40,042 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 199 [2019-09-05 11:43:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:40,043 INFO L225 Difference]: With dead ends: 329 [2019-09-05 11:43:40,044 INFO L226 Difference]: Without dead ends: 207 [2019-09-05 11:43:40,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=828, Invalid=1064, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:43:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-05 11:43:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-09-05 11:43:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-05 11:43:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-09-05 11:43:40,051 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 199 [2019-09-05 11:43:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:40,051 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-09-05 11:43:40,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:43:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-09-05 11:43:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-05 11:43:40,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:40,053 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:40,053 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1424619490, now seen corresponding path program 38 times [2019-09-05 11:43:40,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:40,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:40,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2019-09-05 11:43:40,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:40,745 INFO L223 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-09-05 11:43:40,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:40,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:40,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:40,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 11:43:40,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2019-09-05 11:43:40,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:40,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 44 [2019-09-05 11:43:40,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 11:43:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 11:43:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:43:40,902 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 44 states. [2019-09-05 11:43:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:41,179 INFO L93 Difference]: Finished difference Result 337 states and 340 transitions. [2019-09-05 11:43:41,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 11:43:41,179 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 204 [2019-09-05 11:43:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:41,181 INFO L225 Difference]: With dead ends: 337 [2019-09-05 11:43:41,181 INFO L226 Difference]: Without dead ends: 212 [2019-09-05 11:43:41,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=869, Invalid=1111, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:43:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-05 11:43:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-09-05 11:43:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-05 11:43:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-05 11:43:41,186 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 204 [2019-09-05 11:43:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:41,187 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-05 11:43:41,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 11:43:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-05 11:43:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-05 11:43:41,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:41,188 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:41,189 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1409472315, now seen corresponding path program 39 times [2019-09-05 11:43:41,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:41,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:41,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:41,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:41,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-05 11:43:41,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:41,919 INFO L223 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) [2019-09-05 11:43:41,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:44:06,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-05 11:44:06,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:44:06,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:44:06,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:06,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:44:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:44:06,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:06,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 47 [2019-09-05 11:44:06,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:44:06,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:44:06,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:44:06,193 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 47 states. [2019-09-05 11:44:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:06,527 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2019-09-05 11:44:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 11:44:06,527 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 209 [2019-09-05 11:44:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:06,529 INFO L225 Difference]: With dead ends: 345 [2019-09-05 11:44:06,530 INFO L226 Difference]: Without dead ends: 217 [2019-09-05 11:44:06,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:44:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-05 11:44:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-09-05 11:44:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-05 11:44:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-09-05 11:44:06,535 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 209 [2019-09-05 11:44:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:06,536 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-09-05 11:44:06,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:44:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-09-05 11:44:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-05 11:44:06,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:06,537 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:06,537 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash -885284286, now seen corresponding path program 40 times [2019-09-05 11:44:06,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:06,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:44:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-05 11:44:07,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:07,471 INFO L223 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-09-05 11:44:07,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:44:07,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:44:07,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:44:07,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:44:07,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2019-09-05 11:44:07,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:07,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43] total 46 [2019-09-05 11:44:07,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 11:44:07,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 11:44:07,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=1120, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:44:07,604 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 46 states. [2019-09-05 11:44:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:07,912 INFO L93 Difference]: Finished difference Result 353 states and 356 transitions. [2019-09-05 11:44:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 11:44:07,912 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 214 [2019-09-05 11:44:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:07,914 INFO L225 Difference]: With dead ends: 353 [2019-09-05 11:44:07,914 INFO L226 Difference]: Without dead ends: 222 [2019-09-05 11:44:07,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=954, Invalid=1208, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:44:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-05 11:44:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-09-05 11:44:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-05 11:44:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2019-09-05 11:44:07,921 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 214 [2019-09-05 11:44:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:07,922 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2019-09-05 11:44:07,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 11:44:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2019-09-05 11:44:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-05 11:44:07,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:07,923 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:07,924 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1228848801, now seen corresponding path program 41 times [2019-09-05 11:44:07,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:07,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:44:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-05 11:44:08,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:08,785 INFO L223 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-09-05 11:44:08,795 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:44:10,626 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-05 11:44:10,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:44:10,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:44:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:44:10,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:10,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 47 [2019-09-05 11:44:10,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:44:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:44:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:44:10,686 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 47 states. [2019-09-05 11:44:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:11,029 INFO L93 Difference]: Finished difference Result 361 states and 364 transitions. [2019-09-05 11:44:11,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 11:44:11,030 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 219 [2019-09-05 11:44:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:11,031 INFO L225 Difference]: With dead ends: 361 [2019-09-05 11:44:11,031 INFO L226 Difference]: Without dead ends: 227 [2019-09-05 11:44:11,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=998, Invalid=1258, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:44:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-05 11:44:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2019-09-05 11:44:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-05 11:44:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2019-09-05 11:44:11,037 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 219 [2019-09-05 11:44:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:11,038 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2019-09-05 11:44:11,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:44:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2019-09-05 11:44:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-05 11:44:11,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:11,039 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:11,040 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:11,040 INFO L82 PathProgramCache]: Analyzing trace with hash -338924442, now seen corresponding path program 42 times [2019-09-05 11:44:11,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:11,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:11,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:44:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-05 11:44:11,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:11,910 INFO L223 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-09-05 11:44:11,920 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:45:49,965 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-05 11:45:49,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:50,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:45:50,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:50,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:45:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-05 11:45:50,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:50,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 50 [2019-09-05 11:45:50,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 11:45:50,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 11:45:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:45:50,145 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 50 states. [2019-09-05 11:45:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:50,530 INFO L93 Difference]: Finished difference Result 369 states and 372 transitions. [2019-09-05 11:45:50,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 11:45:50,531 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 224 [2019-09-05 11:45:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:50,532 INFO L225 Difference]: With dead ends: 369 [2019-09-05 11:45:50,533 INFO L226 Difference]: Without dead ends: 232 [2019-09-05 11:45:50,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:45:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-05 11:45:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-09-05 11:45:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-05 11:45:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2019-09-05 11:45:50,538 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 224 [2019-09-05 11:45:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:50,539 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2019-09-05 11:45:50,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 11:45:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2019-09-05 11:45:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-05 11:45:50,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:50,541 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:50,541 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1733163907, now seen corresponding path program 43 times [2019-09-05 11:45:50,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:50,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:50,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:50,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:50,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-05 11:45:51,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:51,433 INFO L223 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-09-05 11:45:51,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:45:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:51,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:45:51,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:45:51,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:51,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 46] total 49 [2019-09-05 11:45:51,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 11:45:51,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 11:45:51,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=1267, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:45:51,589 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 49 states. [2019-09-05 11:45:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:51,932 INFO L93 Difference]: Finished difference Result 377 states and 380 transitions. [2019-09-05 11:45:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 11:45:51,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 229 [2019-09-05 11:45:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:51,934 INFO L225 Difference]: With dead ends: 377 [2019-09-05 11:45:51,935 INFO L226 Difference]: Without dead ends: 237 [2019-09-05 11:45:51,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1089, Invalid=1361, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:45:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-05 11:45:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2019-09-05 11:45:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-05 11:45:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2019-09-05 11:45:51,941 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 229 [2019-09-05 11:45:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:51,941 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2019-09-05 11:45:51,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 11:45:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2019-09-05 11:45:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-05 11:45:51,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:51,943 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:51,943 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:51,943 INFO L82 PathProgramCache]: Analyzing trace with hash -810637686, now seen corresponding path program 44 times [2019-09-05 11:45:51,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:51,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:45:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-05 11:45:52,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:52,930 INFO L223 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-09-05 11:45:52,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:45:53,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:45:53,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:53,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:45:53,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:45:53,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:53,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 50 [2019-09-05 11:45:53,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 11:45:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 11:45:53,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:45:53,088 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 50 states. [2019-09-05 11:45:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:53,426 INFO L93 Difference]: Finished difference Result 385 states and 388 transitions. [2019-09-05 11:45:53,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 11:45:53,427 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 234 [2019-09-05 11:45:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:53,428 INFO L225 Difference]: With dead ends: 385 [2019-09-05 11:45:53,429 INFO L226 Difference]: Without dead ends: 242 [2019-09-05 11:45:53,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1136, Invalid=1414, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:45:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-05 11:45:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-05 11:45:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-05 11:45:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2019-09-05 11:45:53,434 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 234 [2019-09-05 11:45:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:53,434 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2019-09-05 11:45:53,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 11:45:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2019-09-05 11:45:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-05 11:45:53,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:53,436 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:53,436 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:53,437 INFO L82 PathProgramCache]: Analyzing trace with hash 313571929, now seen corresponding path program 45 times [2019-09-05 11:45:53,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:53,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:53,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:53,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:53,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-05 11:45:54,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:54,324 INFO L223 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-09-05 11:45:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:46:41,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-05 11:46:41,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:41,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:46:41,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2019-09-05 11:46:41,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:41,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48] total 51 [2019-09-05 11:46:41,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 11:46:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 11:46:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:46:41,706 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 51 states. [2019-09-05 11:46:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:42,094 INFO L93 Difference]: Finished difference Result 393 states and 396 transitions. [2019-09-05 11:46:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 11:46:42,095 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 239 [2019-09-05 11:46:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:42,097 INFO L225 Difference]: With dead ends: 393 [2019-09-05 11:46:42,097 INFO L226 Difference]: Without dead ends: 247 [2019-09-05 11:46:42,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 11:46:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-05 11:46:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-09-05 11:46:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-05 11:46:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2019-09-05 11:46:42,107 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 239 [2019-09-05 11:46:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:42,108 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2019-09-05 11:46:42,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 11:46:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2019-09-05 11:46:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-05 11:46:42,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:42,110 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:42,110 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:42,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1404530514, now seen corresponding path program 46 times [2019-09-05 11:46:42,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:42,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:42,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2019-09-05 11:46:43,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:43,245 INFO L223 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-09-05 11:46:43,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:46:43,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:46:43,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:43,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:46:43,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:46:43,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:43,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49] total 52 [2019-09-05 11:46:43,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 11:46:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 11:46:43,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=1423, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 11:46:43,401 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 52 states. [2019-09-05 11:46:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:43,785 INFO L93 Difference]: Finished difference Result 401 states and 404 transitions. [2019-09-05 11:46:43,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 11:46:43,785 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 244 [2019-09-05 11:46:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:43,787 INFO L225 Difference]: With dead ends: 401 [2019-09-05 11:46:43,787 INFO L226 Difference]: Without dead ends: 252 [2019-09-05 11:46:43,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1233, Invalid=1523, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:46:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-05 11:46:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2019-09-05 11:46:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-05 11:46:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2019-09-05 11:46:43,792 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 244 [2019-09-05 11:46:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:43,792 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2019-09-05 11:46:43,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 11:46:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2019-09-05 11:46:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-05 11:46:43,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:43,794 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:43,794 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:43,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:43,795 INFO L82 PathProgramCache]: Analyzing trace with hash -350969803, now seen corresponding path program 47 times [2019-09-05 11:46:43,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:43,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:43,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:43,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-09-05 11:46:44,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:44,792 INFO L223 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-09-05 11:46:44,802 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:46:47,146 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-05 11:46:47,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:47,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:46:47,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:46:47,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:47,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50] total 53 [2019-09-05 11:46:47,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 11:46:47,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 11:46:47,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:46:47,235 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 53 states. [2019-09-05 11:46:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:47,596 INFO L93 Difference]: Finished difference Result 409 states and 412 transitions. [2019-09-05 11:46:47,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 11:46:47,596 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 249 [2019-09-05 11:46:47,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:47,598 INFO L225 Difference]: With dead ends: 409 [2019-09-05 11:46:47,598 INFO L226 Difference]: Without dead ends: 257 [2019-09-05 11:46:47,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1283, Invalid=1579, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 11:46:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-05 11:46:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2019-09-05 11:46:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-05 11:46:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-09-05 11:46:47,605 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 249 [2019-09-05 11:46:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:47,605 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2019-09-05 11:46:47,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 11:46:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2019-09-05 11:46:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-05 11:46:47,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:47,607 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:47,607 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash -847222062, now seen corresponding path program 48 times [2019-09-05 11:46:47,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:47,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-05 11:46:48,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:48,588 INFO L223 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-09-05 11:46:48,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:50:02,939 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-05 11:50:02,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:03,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:50:03,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2019-09-05 11:50:03,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:03,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 51] total 54 [2019-09-05 11:50:03,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-05 11:50:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-05 11:50:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=1532, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 11:50:03,079 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 54 states. [2019-09-05 11:50:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:03,434 INFO L93 Difference]: Finished difference Result 417 states and 420 transitions. [2019-09-05 11:50:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 11:50:03,435 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 254 [2019-09-05 11:50:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:03,437 INFO L225 Difference]: With dead ends: 417 [2019-09-05 11:50:03,437 INFO L226 Difference]: Without dead ends: 262 [2019-09-05 11:50:03,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1334, Invalid=1636, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:50:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-05 11:50:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-05 11:50:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-05 11:50:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2019-09-05 11:50:03,443 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 254 [2019-09-05 11:50:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:03,443 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2019-09-05 11:50:03,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-05 11:50:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2019-09-05 11:50:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-05 11:50:03,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:03,458 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:03,460 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1832351249, now seen corresponding path program 49 times [2019-09-05 11:50:03,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:03,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:03,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2019-09-05 11:50:04,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:04,493 INFO L223 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-09-05 11:50:04,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:50:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:04,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:50:04,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:50:04,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:04,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 52] total 55 [2019-09-05 11:50:04,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 11:50:04,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 11:50:04,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1382, Invalid=1588, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:50:04,667 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 55 states. [2019-09-05 11:50:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:05,027 INFO L93 Difference]: Finished difference Result 425 states and 428 transitions. [2019-09-05 11:50:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 11:50:05,028 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 259 [2019-09-05 11:50:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:05,029 INFO L225 Difference]: With dead ends: 425 [2019-09-05 11:50:05,029 INFO L226 Difference]: Without dead ends: 267 [2019-09-05 11:50:05,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1386, Invalid=1694, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 11:50:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-05 11:50:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2019-09-05 11:50:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-05 11:50:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2019-09-05 11:50:05,035 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 259 [2019-09-05 11:50:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:05,036 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2019-09-05 11:50:05,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 11:50:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2019-09-05 11:50:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-05 11:50:05,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:05,037 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:05,037 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash 968652022, now seen corresponding path program 50 times [2019-09-05 11:50:05,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:05,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:50:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2019-09-05 11:50:06,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:06,106 INFO L223 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-09-05 11:50:06,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:50:06,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:50:06,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:06,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 11:50:06,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 3775 trivial. 0 not checked. [2019-09-05 11:50:06,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:06,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 56 [2019-09-05 11:50:06,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 11:50:06,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 11:50:06,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=1645, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 11:50:06,302 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 56 states. [2019-09-05 11:50:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:06,714 INFO L93 Difference]: Finished difference Result 433 states and 436 transitions. [2019-09-05 11:50:06,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 11:50:06,714 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 264 [2019-09-05 11:50:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:06,715 INFO L225 Difference]: With dead ends: 433 [2019-09-05 11:50:06,715 INFO L226 Difference]: Without dead ends: 272 [2019-09-05 11:50:06,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1439, Invalid=1753, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:50:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-05 11:50:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2019-09-05 11:50:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-05 11:50:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2019-09-05 11:50:06,721 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 264 [2019-09-05 11:50:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:06,721 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2019-09-05 11:50:06,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 11:50:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2019-09-05 11:50:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-05 11:50:06,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:06,723 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:06,723 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1475541997, now seen corresponding path program 51 times [2019-09-05 11:50:06,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:06,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:06,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:06,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-05 11:50:07,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:07,821 INFO L223 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-09-05 11:50:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:51:29,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-05 11:51:29,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:29,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 11:51:29,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:29,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:51:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-05 11:51:29,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:29,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 59 [2019-09-05 11:51:29,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 11:51:29,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 11:51:29,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 11:51:29,905 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 59 states. [2019-09-05 11:51:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:30,418 INFO L93 Difference]: Finished difference Result 441 states and 444 transitions. [2019-09-05 11:51:30,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-05 11:51:30,419 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 269 [2019-09-05 11:51:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:30,420 INFO L225 Difference]: With dead ends: 441 [2019-09-05 11:51:30,420 INFO L226 Difference]: Without dead ends: 277 [2019-09-05 11:51:30,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 11:51:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-05 11:51:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2019-09-05 11:51:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-05 11:51:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2019-09-05 11:51:30,427 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 269 [2019-09-05 11:51:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:30,427 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2019-09-05 11:51:30,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 11:51:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2019-09-05 11:51:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-05 11:51:30,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:30,429 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:30,429 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:30,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1440935706, now seen corresponding path program 52 times [2019-09-05 11:51:30,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:30,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:30,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:51:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2019-09-05 11:51:31,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:31,557 INFO L223 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-09-05 11:51:31,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:51:31,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:51:31,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:31,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 11:51:31,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-09-05 11:51:31,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:31,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 55] total 58 [2019-09-05 11:51:31,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-05 11:51:31,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-05 11:51:31,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1544, Invalid=1762, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 11:51:31,726 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 58 states. [2019-09-05 11:51:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:32,158 INFO L93 Difference]: Finished difference Result 449 states and 452 transitions. [2019-09-05 11:51:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 11:51:32,158 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 274 [2019-09-05 11:51:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:32,160 INFO L225 Difference]: With dead ends: 449 [2019-09-05 11:51:32,160 INFO L226 Difference]: Without dead ends: 282 [2019-09-05 11:51:32,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1548, Invalid=1874, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 11:51:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-05 11:51:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-09-05 11:51:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-05 11:51:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2019-09-05 11:51:32,166 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 274 [2019-09-05 11:51:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:32,166 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2019-09-05 11:51:32,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-05 11:51:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2019-09-05 11:51:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-05 11:51:32,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:32,168 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:32,168 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash 966848969, now seen corresponding path program 53 times [2019-09-05 11:51:32,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:32,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:32,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:51:32,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-05 11:51:33,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:33,378 INFO L223 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-09-05 11:51:33,388 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:52:00,625 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-05 11:52:00,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:00,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:52:00,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 4240 trivial. 0 not checked. [2019-09-05 11:52:00,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:00,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 56] total 59 [2019-09-05 11:52:00,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 11:52:00,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 11:52:00,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 11:52:00,721 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 59 states. [2019-09-05 11:52:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:01,144 INFO L93 Difference]: Finished difference Result 457 states and 460 transitions. [2019-09-05 11:52:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 11:52:01,145 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 279 [2019-09-05 11:52:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:01,146 INFO L225 Difference]: With dead ends: 457 [2019-09-05 11:52:01,146 INFO L226 Difference]: Without dead ends: 287 [2019-09-05 11:52:01,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1604, Invalid=1936, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 11:52:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-05 11:52:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2019-09-05 11:52:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-05 11:52:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2019-09-05 11:52:01,153 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 279 [2019-09-05 11:52:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:01,153 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2019-09-05 11:52:01,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 11:52:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2019-09-05 11:52:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-05 11:52:01,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:01,155 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:01,155 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1990584002, now seen corresponding path program 54 times [2019-09-05 11:52:01,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:01,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:01,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-05 11:52:02,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:02,951 INFO L223 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-09-05 11:52:02,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:55:47,790 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-05 11:55:47,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:47,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 11:55:47,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 4401 trivial. 0 not checked. [2019-09-05 11:55:47,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:47,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 57] total 60 [2019-09-05 11:55:47,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-05 11:55:47,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-05 11:55:47,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1657, Invalid=1883, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 11:55:47,922 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 60 states. [2019-09-05 11:55:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:48,407 INFO L93 Difference]: Finished difference Result 465 states and 468 transitions. [2019-09-05 11:55:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 11:55:48,407 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 284 [2019-09-05 11:55:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:48,409 INFO L225 Difference]: With dead ends: 465 [2019-09-05 11:55:48,409 INFO L226 Difference]: Without dead ends: 292 [2019-09-05 11:55:48,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1661, Invalid=1999, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 11:55:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-05 11:55:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2019-09-05 11:55:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-05 11:55:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2019-09-05 11:55:48,415 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 284 [2019-09-05 11:55:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:48,415 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2019-09-05 11:55:48,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-05 11:55:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2019-09-05 11:55:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-05 11:55:48,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:48,417 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:48,417 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash -870639707, now seen corresponding path program 55 times [2019-09-05 11:55:48,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:48,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:48,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2019-09-05 11:55:50,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:50,005 INFO L223 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-09-05 11:55:50,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:55:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:50,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:55:50,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:55:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 58] total 61 [2019-09-05 11:55:50,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-05 11:55:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-05 11:55:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1715, Invalid=1945, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 11:55:50,187 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 61 states. [2019-09-05 11:55:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:50,781 INFO L93 Difference]: Finished difference Result 473 states and 476 transitions. [2019-09-05 11:55:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-05 11:55:50,781 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 289 [2019-09-05 11:55:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:50,783 INFO L225 Difference]: With dead ends: 473 [2019-09-05 11:55:50,783 INFO L226 Difference]: Without dead ends: 297 [2019-09-05 11:55:50,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1719, Invalid=2063, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 11:55:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-05 11:55:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-09-05 11:55:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-05 11:55:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-09-05 11:55:50,789 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 289 [2019-09-05 11:55:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:50,790 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-09-05 11:55:50,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-05 11:55:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-09-05 11:55:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-05 11:55:50,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:50,791 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:50,792 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -502779038, now seen corresponding path program 56 times [2019-09-05 11:55:50,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:50,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:50,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:50,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:55:50,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2019-09-05 11:55:52,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:52,141 INFO L223 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-09-05 11:55:52,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:55:52,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:55:52,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:52,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 11:55:52,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 4732 trivial. 0 not checked. [2019-09-05 11:55:52,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:52,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2019-09-05 11:55:52,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-05 11:55:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-05 11:55:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 11:55:52,337 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 62 states. [2019-09-05 11:55:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:52,756 INFO L93 Difference]: Finished difference Result 481 states and 484 transitions. [2019-09-05 11:55:52,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 11:55:52,757 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 294 [2019-09-05 11:55:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:52,758 INFO L225 Difference]: With dead ends: 481 [2019-09-05 11:55:52,758 INFO L226 Difference]: Without dead ends: 302 [2019-09-05 11:55:52,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1778, Invalid=2128, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 11:55:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-05 11:55:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-09-05 11:55:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-05 11:55:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2019-09-05 11:55:52,764 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 294 [2019-09-05 11:55:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:52,764 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2019-09-05 11:55:52,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-05 11:55:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2019-09-05 11:55:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-05 11:55:52,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:52,766 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:52,766 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:52,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1354444161, now seen corresponding path program 57 times [2019-09-05 11:55:52,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:52,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:52,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8151 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-05 11:55:54,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:54,090 INFO L223 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-09-05 11:55:54,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2