java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:32:25,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:32:25,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:32:25,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:32:25,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:32:25,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:32:25,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:32:25,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:32:25,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:32:25,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:32:25,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:32:25,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:32:25,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:32:25,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:32:25,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:32:25,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:32:25,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:32:25,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:32:25,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:32:25,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:32:25,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:32:25,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:32:25,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:32:25,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:32:25,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:32:25,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:32:25,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:32:25,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:32:25,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:32:25,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:32:25,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:32:25,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:32:25,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:32:25,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:32:25,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:32:25,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:32:25,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:32:25,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:32:25,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:32:25,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:32:25,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:32:25,727 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-07 10:32:25,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:32:25,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:32:25,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:32:25,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:32:25,742 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:32:25,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:32:25,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:32:25,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:32:25,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:32:25,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:32:25,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:32:25,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:32:25,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:32:25,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:32:25,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:32:25,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:32:25,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:32:25,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:32:25,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:32:25,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:32:25,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:32:25,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:32:25,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:32:25,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:32:25,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:32:25,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:32:25,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:32:25,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:32:25,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:32:25,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:32:25,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:32:25,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:32:25,798 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:32:25,799 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:32:25,799 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_02.i [2019-09-07 10:32:25,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff9657ed/192ce0740a754c5e9db1bd4f68de6b66/FLAG01a64c25b [2019-09-07 10:32:26,310 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:32:26,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_02.i [2019-09-07 10:32:26,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff9657ed/192ce0740a754c5e9db1bd4f68de6b66/FLAG01a64c25b [2019-09-07 10:32:26,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff9657ed/192ce0740a754c5e9db1bd4f68de6b66 [2019-09-07 10:32:26,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:32:26,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:32:26,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:32:26,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:32:26,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:32:26,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:32:26" (1/1) ... [2019-09-07 10:32:26,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4ace30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:26, skipping insertion in model container [2019-09-07 10:32:26,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:32:26" (1/1) ... [2019-09-07 10:32:26,751 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:32:26,771 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:32:26,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:32:26,995 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:32:27,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:32:27,038 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:32:27,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27 WrapperNode [2019-09-07 10:32:27,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:32:27,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:32:27,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:32:27,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:32:27,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (1/1) ... [2019-09-07 10:32:27,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (1/1) ... [2019-09-07 10:32:27,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (1/1) ... [2019-09-07 10:32:27,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (1/1) ... [2019-09-07 10:32:27,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (1/1) ... [2019-09-07 10:32:27,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (1/1) ... [2019-09-07 10:32:27,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (1/1) ... [2019-09-07 10:32:27,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:32:27,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:32:27,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:32:27,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:32:27,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (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-07 10:32:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:32:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:32:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:32:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:32:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:32:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:32:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:32:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:32:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:32:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:32:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:32:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:32:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:32:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:32:27,464 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:32:27,464 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:32:27,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:32:27 BoogieIcfgContainer [2019-09-07 10:32:27,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:32:27,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:32:27,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:32:27,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:32:27,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:32:26" (1/3) ... [2019-09-07 10:32:27,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c0be9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:32:27, skipping insertion in model container [2019-09-07 10:32:27,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:32:27" (2/3) ... [2019-09-07 10:32:27,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c0be9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:32:27, skipping insertion in model container [2019-09-07 10:32:27,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:32:27" (3/3) ... [2019-09-07 10:32:27,474 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_02.i [2019-09-07 10:32:27,484 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:32:27,493 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:32:27,525 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:32:27,583 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:32:27,584 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:32:27,584 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:32:27,584 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:32:27,585 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:32:27,585 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:32:27,585 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:32:27,585 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:32:27,585 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:32:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-07 10:32:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:32:27,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:27,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:27,618 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2019-09-07 10:32:27,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:27,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:27,763 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-07 10:32:27,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:32:27,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:32:27,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:32:27,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:32:27,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:32:27,785 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-07 10:32:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:27,811 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-09-07 10:32:27,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:32:27,812 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:32:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:27,821 INFO L225 Difference]: With dead ends: 41 [2019-09-07 10:32:27,822 INFO L226 Difference]: Without dead ends: 19 [2019-09-07 10:32:27,825 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-07 10:32:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-07 10:32:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-07 10:32:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-07 10:32:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-07 10:32:27,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-09-07 10:32:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:27,873 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-07 10:32:27,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:32:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-07 10:32:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:32:27,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:27,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:27,875 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2019-09-07 10:32:27,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:27,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:27,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:27,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:27,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:27,989 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-07 10:32:27,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:32:27,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:32:27,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:32:27,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:32:27,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:32:27,994 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-09-07 10:32:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:28,052 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-07 10:32:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:32:28,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:32:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:28,054 INFO L225 Difference]: With dead ends: 32 [2019-09-07 10:32:28,054 INFO L226 Difference]: Without dead ends: 20 [2019-09-07 10:32:28,055 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-07 10:32:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-07 10:32:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-07 10:32:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-07 10:32:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-07 10:32:28,062 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-09-07 10:32:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:28,063 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-07 10:32:28,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:32:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-07 10:32:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 10:32:28,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:28,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:28,064 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2019-09-07 10:32:28,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:28,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:28,153 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-07 10:32:28,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:32:28,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:32:28,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:32:28,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:32:28,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:32:28,159 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-09-07 10:32:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:28,208 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-07 10:32:28,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:32:28,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 10:32:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:28,212 INFO L225 Difference]: With dead ends: 34 [2019-09-07 10:32:28,212 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 10:32:28,213 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-07 10:32:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 10:32:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-07 10:32:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-07 10:32:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-07 10:32:28,233 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-09-07 10:32:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:28,234 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-07 10:32:28,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:32:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-07 10:32:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:32:28,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:28,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:28,236 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2019-09-07 10:32:28,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:28,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:32:28,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:28,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:28,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:28,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:32:28,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:32:28,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:28,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:32:28,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:32:28,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:32:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:32:28,442 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2019-09-07 10:32:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:28,510 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-07 10:32:28,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:32:28,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-07 10:32:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:28,513 INFO L225 Difference]: With dead ends: 38 [2019-09-07 10:32:28,513 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:32:28,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:32:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:32:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-09-07 10:32:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:32:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 10:32:28,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2019-09-07 10:32:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:28,524 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 10:32:28,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:32:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 10:32:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 10:32:28,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:28,526 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:28,526 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1302144745, now seen corresponding path program 2 times [2019-09-07 10:32:28,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:28,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:28,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:28,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:32:28,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:28,621 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) [2019-09-07 10:32:28,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:28,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:32:28,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:28,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:32:28,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:32:28,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:28,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:32:28,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:32:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:32:28,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:32:28,700 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-09-07 10:32:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:28,776 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-09-07 10:32:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:32:28,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-07 10:32:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:28,778 INFO L225 Difference]: With dead ends: 39 [2019-09-07 10:32:28,778 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 10:32:28,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:32:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 10:32:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-07 10:32:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 10:32:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-07 10:32:28,790 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-07 10:32:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:28,790 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-07 10:32:28,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:32:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-07 10:32:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:32:28,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:28,792 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:28,793 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash 561287237, now seen corresponding path program 3 times [2019-09-07 10:32:28,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:28,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:28,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:28,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:32:28,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:28,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:32:28,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:28,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 10:32:28,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:28,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:32:28,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:32:28,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:28,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:32:28,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:32:28,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:32:28,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:32:28,957 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2019-09-07 10:32:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:29,027 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-09-07 10:32:29,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:32:29,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 10:32:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:29,029 INFO L225 Difference]: With dead ends: 40 [2019-09-07 10:32:29,029 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 10:32:29,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:32:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 10:32:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-09-07 10:32:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:32:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 10:32:29,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2019-09-07 10:32:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:29,040 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 10:32:29,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:32:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 10:32:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:32:29,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:29,043 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:29,043 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1897825622, now seen corresponding path program 4 times [2019-09-07 10:32:29,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:29,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:29,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:29,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:32:29,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:29,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:29,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:32:29,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:32:29,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:29,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:32:29,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:32:29,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:29,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:32:29,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:32:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:32:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:32:29,155 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-07 10:32:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:29,218 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-09-07 10:32:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:32:29,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-07 10:32:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:29,220 INFO L225 Difference]: With dead ends: 45 [2019-09-07 10:32:29,220 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 10:32:29,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:32:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 10:32:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-09-07 10:32:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:32:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-07 10:32:29,226 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2019-09-07 10:32:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:29,226 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-07 10:32:29,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:32:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-07 10:32:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 10:32:29,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:29,227 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:29,228 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash -897319674, now seen corresponding path program 5 times [2019-09-07 10:32:29,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:29,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:32:29,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:29,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:32:29,322 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:29,353 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-09-07 10:32:29,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:29,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:32:29,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:32:29,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:29,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:32:29,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:32:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:32:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:32:29,373 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2019-09-07 10:32:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:29,445 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-09-07 10:32:29,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:32:29,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-09-07 10:32:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:29,447 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:32:29,447 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:32:29,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:32:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:32:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-07 10:32:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 10:32:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-07 10:32:29,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2019-09-07 10:32:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:29,453 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-07 10:32:29,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:32:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-07 10:32:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 10:32:29,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:29,454 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:29,454 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:29,455 INFO L82 PathProgramCache]: Analyzing trace with hash 53593642, now seen corresponding path program 6 times [2019-09-07 10:32:29,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:29,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:32:29,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:29,500 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-07 10:32:29,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:32:29,546 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-09-07 10:32:29,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:29,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:32:29,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:32:29,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:29,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:32:29,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:32:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:32:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:32:29,563 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-09-07 10:32:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:29,622 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-09-07 10:32:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:32:29,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-07 10:32:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:29,624 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:32:29,624 INFO L226 Difference]: Without dead ends: 36 [2019-09-07 10:32:29,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:32:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-07 10:32:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-09-07 10:32:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 10:32:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-07 10:32:29,630 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2019-09-07 10:32:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:29,630 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-07 10:32:29,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:32:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-07 10:32:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:32:29,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:29,631 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:29,631 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash -456457883, now seen corresponding path program 7 times [2019-09-07 10:32:29,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:29,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:29,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:29,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:32:29,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:29,723 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-07 10:32:29,747 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-07 10:32:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:32:29,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:32:29,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:29,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:32:29,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:32:29,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:32:29,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:32:29,800 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2019-09-07 10:32:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:29,892 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-09-07 10:32:29,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:32:29,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-09-07 10:32:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:29,894 INFO L225 Difference]: With dead ends: 52 [2019-09-07 10:32:29,894 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:32:29,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:32:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:32:29,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-09-07 10:32:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:32:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-07 10:32:29,905 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-09-07 10:32:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:29,905 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-07 10:32:29,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:32:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-07 10:32:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 10:32:29,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:29,906 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:29,907 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:29,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1456795255, now seen corresponding path program 8 times [2019-09-07 10:32:29,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:29,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:32:29,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:29,993 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:30,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:32:30,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:32:30,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:30,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:32:30,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 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-07 10:32:30,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:30,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:32:30,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:32:30,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:32:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:32:30,063 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2019-09-07 10:32:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:30,140 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-09-07 10:32:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:32:30,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-07 10:32:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:30,142 INFO L225 Difference]: With dead ends: 53 [2019-09-07 10:32:30,142 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 10:32:30,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:32:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 10:32:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2019-09-07 10:32:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 10:32:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-07 10:32:30,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-09-07 10:32:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:30,158 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-07 10:32:30,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:32:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-07 10:32:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 10:32:30,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:30,160 INFO L399 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:30,161 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1892484581, now seen corresponding path program 9 times [2019-09-07 10:32:30,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:30,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:30,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:30,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:32:30,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:30,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:32:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:32:30,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:32:30,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:30,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:32:30,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:32:30,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:30,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:32:30,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:32:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:32:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:32:30,312 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2019-09-07 10:32:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:30,394 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-09-07 10:32:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:32:30,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-07 10:32:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:30,396 INFO L225 Difference]: With dead ends: 52 [2019-09-07 10:32:30,396 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:32:30,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:32:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:32:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-07 10:32:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 10:32:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-07 10:32:30,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2019-09-07 10:32:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:30,410 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-07 10:32:30,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:32:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-07 10:32:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 10:32:30,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:30,411 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:30,416 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:30,416 INFO L82 PathProgramCache]: Analyzing trace with hash 714586378, now seen corresponding path program 10 times [2019-09-07 10:32:30,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:30,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:32:30,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:30,561 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-07 10:32:30,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:32:30,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:32:30,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:30,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:32:30,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:32:30,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:30,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:32:30,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:32:30,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:32:30,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:32:30,643 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 11 states. [2019-09-07 10:32:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:30,728 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-07 10:32:30,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:32:30,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-07 10:32:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:30,729 INFO L225 Difference]: With dead ends: 59 [2019-09-07 10:32:30,731 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 10:32:30,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:32:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 10:32:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-09-07 10:32:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 10:32:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-07 10:32:30,743 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2019-09-07 10:32:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:30,743 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-07 10:32:30,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:32:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-07 10:32:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:32:30,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:30,745 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:30,747 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1852963226, now seen corresponding path program 11 times [2019-09-07 10:32:30,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:30,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:32:30,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:30,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:30,892 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:32:31,000 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 10:32:31,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:31,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:32:31,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:32:31,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:31,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-09-07 10:32:31,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:32:31,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:32:31,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:32:31,028 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 12 states. [2019-09-07 10:32:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:31,127 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-07 10:32:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:32:31,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-09-07 10:32:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:31,128 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:32:31,129 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 10:32:31,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:32:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 10:32:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2019-09-07 10:32:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 10:32:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-07 10:32:31,134 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2019-09-07 10:32:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:31,135 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-07 10:32:31,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:32:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-07 10:32:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 10:32:31,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:31,136 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:31,136 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1963168809, now seen corresponding path program 12 times [2019-09-07 10:32:31,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:31,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:31,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:32:31,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:31,258 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-07 10:32:31,275 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:32:31,460 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-07 10:32:31,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:31,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:32:31,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:32:31,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:31,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 14 [2019-09-07 10:32:31,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:32:31,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:32:31,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:32:31,507 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 14 states. [2019-09-07 10:32:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:31,654 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-09-07 10:32:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:32:31,655 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-07 10:32:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:31,656 INFO L225 Difference]: With dead ends: 72 [2019-09-07 10:32:31,656 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 10:32:31,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:32:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 10:32:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-09-07 10:32:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 10:32:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-09-07 10:32:31,662 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2019-09-07 10:32:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:31,662 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-09-07 10:32:31,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:32:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-09-07 10:32:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 10:32:31,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:31,664 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:31,664 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1260943302, now seen corresponding path program 13 times [2019-09-07 10:32:31,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:31,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:31,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:32:31,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:31,807 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-07 10:32:31,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:31,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:32:31,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:32:31,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:31,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:32:31,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:32:31,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:32:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:32:31,892 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 16 states. [2019-09-07 10:32:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:32,011 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-09-07 10:32:32,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:32:32,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-09-07 10:32:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:32,014 INFO L225 Difference]: With dead ends: 74 [2019-09-07 10:32:32,014 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 10:32:32,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:32:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 10:32:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-09-07 10:32:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-07 10:32:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-07 10:32:32,020 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2019-09-07 10:32:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:32,020 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-07 10:32:32,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:32:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-07 10:32:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 10:32:32,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:32,021 INFO L399 BasicCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:32,022 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:32,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1390258922, now seen corresponding path program 14 times [2019-09-07 10:32:32,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:32,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:32,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:32:32,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:32,089 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-07 10:32:32,109 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-07 10:32:32,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:32:32,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:32,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:32:32,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:32:32,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:32,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 17 [2019-09-07 10:32:32,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:32:32,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:32:32,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:32:32,221 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 17 states. [2019-09-07 10:32:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:32,328 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-09-07 10:32:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:32:32,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-09-07 10:32:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:32,329 INFO L225 Difference]: With dead ends: 79 [2019-09-07 10:32:32,329 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 10:32:32,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:32:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 10:32:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2019-09-07 10:32:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:32:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-07 10:32:32,336 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 34 [2019-09-07 10:32:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:32,336 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-07 10:32:32,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:32:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-07 10:32:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 10:32:32,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:32,337 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:32,338 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2043719369, now seen corresponding path program 15 times [2019-09-07 10:32:32,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:32,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:32,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:32,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:32:32,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:32,503 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-07 10:32:32,541 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-07 10:32:32,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 10:32:32,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:32,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:32:32,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:32:32,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:32,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 18 [2019-09-07 10:32:32,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:32:32,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:32:32,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:32:32,681 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 18 states. [2019-09-07 10:32:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:32,824 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-09-07 10:32:32,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:32:32,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-09-07 10:32:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:32,826 INFO L225 Difference]: With dead ends: 86 [2019-09-07 10:32:32,826 INFO L226 Difference]: Without dead ends: 67 [2019-09-07 10:32:32,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:32:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-07 10:32:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-09-07 10:32:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 10:32:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-09-07 10:32:32,833 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 36 [2019-09-07 10:32:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:32,834 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-09-07 10:32:32,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:32:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-09-07 10:32:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:32:32,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:32,835 INFO L399 BasicCegarLoop]: trace histogram [16, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:32,835 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash -35040986, now seen corresponding path program 16 times [2019-09-07 10:32:32,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:32,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:32,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:32,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:32:33,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:33,026 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-07 10:32:33,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:32:33,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:32:33,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:33,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:32:33,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:32:33,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:33,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:32:33,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:32:33,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:32:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:32:33,104 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 20 states. [2019-09-07 10:32:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:33,286 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2019-09-07 10:32:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:32:33,288 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-09-07 10:32:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:33,289 INFO L225 Difference]: With dead ends: 88 [2019-09-07 10:32:33,289 INFO L226 Difference]: Without dead ends: 68 [2019-09-07 10:32:33,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:32:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-07 10:32:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 44. [2019-09-07 10:32:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:32:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-07 10:32:33,299 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2019-09-07 10:32:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:33,300 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-07 10:32:33,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:32:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-07 10:32:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 10:32:33,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:33,301 INFO L399 BasicCegarLoop]: trace histogram [17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:33,301 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash -133392054, now seen corresponding path program 17 times [2019-09-07 10:32:33,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:33,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:33,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:33,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:33,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:32:33,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:33,396 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-07 10:32:33,412 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:32:37,042 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-07 10:32:37,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:37,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:32:37,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:32:37,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:37,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 21 [2019-09-07 10:32:37,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:32:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:32:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:32:37,155 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 21 states. [2019-09-07 10:32:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:37,333 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-09-07 10:32:37,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:32:37,334 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-07 10:32:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:37,335 INFO L225 Difference]: With dead ends: 93 [2019-09-07 10:32:37,335 INFO L226 Difference]: Without dead ends: 73 [2019-09-07 10:32:37,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:32:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-07 10:32:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2019-09-07 10:32:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:32:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-07 10:32:37,343 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 40 [2019-09-07 10:32:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:37,344 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-07 10:32:37,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:32:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-07 10:32:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 10:32:37,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:37,345 INFO L399 BasicCegarLoop]: trace histogram [18, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:37,345 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:37,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1984142999, now seen corresponding path program 18 times [2019-09-07 10:32:37,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:37,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:37,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:32:37,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:37,630 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) [2019-09-07 10:32:37,656 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:42,335 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 10:32:42,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:42,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:32:42,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:32:42,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:42,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:32:42,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:32:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:32:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:32:42,380 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 22 states. [2019-09-07 10:32:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:42,548 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2019-09-07 10:32:42,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:32:42,549 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-09-07 10:32:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:42,550 INFO L225 Difference]: With dead ends: 95 [2019-09-07 10:32:42,550 INFO L226 Difference]: Without dead ends: 74 [2019-09-07 10:32:42,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:32:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-07 10:32:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 47. [2019-09-07 10:32:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:32:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-07 10:32:42,562 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2019-09-07 10:32:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:42,562 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-07 10:32:42,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:32:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-07 10:32:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:32:42,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:42,563 INFO L399 BasicCegarLoop]: trace histogram [19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:42,563 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1501853381, now seen corresponding path program 19 times [2019-09-07 10:32:42,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:42,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:42,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:32:42,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:42,686 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-07 10:32:42,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:42,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:32:42,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:32:42,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:42,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22] total 23 [2019-09-07 10:32:42,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:32:42,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:32:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:32:42,861 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 23 states. [2019-09-07 10:32:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:43,027 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2019-09-07 10:32:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:32:43,028 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-09-07 10:32:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:43,029 INFO L225 Difference]: With dead ends: 100 [2019-09-07 10:32:43,029 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 10:32:43,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:32:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 10:32:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2019-09-07 10:32:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 10:32:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-09-07 10:32:43,036 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 43 [2019-09-07 10:32:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:43,037 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-09-07 10:32:43,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:32:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-09-07 10:32:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 10:32:43,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:43,038 INFO L399 BasicCegarLoop]: trace histogram [20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:43,038 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1457951366, now seen corresponding path program 20 times [2019-09-07 10:32:43,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:43,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:32:43,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:43,305 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-07 10:32:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:32:43,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:32:43,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:43,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:32:43,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:32:43,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:43,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:32:43,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:32:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:32:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:32:43,381 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 24 states. [2019-09-07 10:32:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:43,557 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-09-07 10:32:43,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:32:43,558 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-09-07 10:32:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:43,559 INFO L225 Difference]: With dead ends: 102 [2019-09-07 10:32:43,559 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 10:32:43,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:32:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 10:32:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2019-09-07 10:32:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 10:32:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-07 10:32:43,564 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 45 [2019-09-07 10:32:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:43,564 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-07 10:32:43,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:32:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-07 10:32:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 10:32:43,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:43,565 INFO L399 BasicCegarLoop]: trace histogram [21, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:43,566 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash 466890666, now seen corresponding path program 21 times [2019-09-07 10:32:43,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:43,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:43,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-07 10:32:43,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:43,674 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) [2019-09-07 10:32:43,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:44,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:32:44,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:44,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:32:44,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-07 10:32:44,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:44,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:32:44,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:32:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:32:44,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:32:44,100 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-09-07 10:32:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:44,243 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2019-09-07 10:32:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:32:44,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-09-07 10:32:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:44,245 INFO L225 Difference]: With dead ends: 94 [2019-09-07 10:32:44,245 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:32:44,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:32:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:32:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 51. [2019-09-07 10:32:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 10:32:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-09-07 10:32:44,253 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2019-09-07 10:32:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:44,254 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-09-07 10:32:44,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:32:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-09-07 10:32:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:32:44,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:44,255 INFO L399 BasicCegarLoop]: trace histogram [21, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:44,255 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -529152027, now seen corresponding path program 22 times [2019-09-07 10:32:44,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:44,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:44,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:32:44,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:44,545 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-07 10:32:44,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:32:44,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:32:44,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:44,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:32:44,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:32:44,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:44,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:32:44,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:32:44,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:32:44,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:32:44,633 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 25 states. [2019-09-07 10:32:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:44,844 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2019-09-07 10:32:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:32:44,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-09-07 10:32:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:44,845 INFO L225 Difference]: With dead ends: 108 [2019-09-07 10:32:44,845 INFO L226 Difference]: Without dead ends: 85 [2019-09-07 10:32:44,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:32:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-07 10:32:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2019-09-07 10:32:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:32:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-07 10:32:44,855 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2019-09-07 10:32:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:44,855 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-07 10:32:44,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:32:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-07 10:32:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 10:32:44,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:44,856 INFO L399 BasicCegarLoop]: trace histogram [22, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:44,856 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:44,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 544254985, now seen corresponding path program 23 times [2019-09-07 10:32:44,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:44,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:32:45,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:45,165 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) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:45,174 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:33:02,456 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-07 10:33:02,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:02,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:33:02,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:33:02,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:02,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:33:02,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:33:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:33:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:33:02,500 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-09-07 10:33:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:02,677 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-09-07 10:33:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:33:02,678 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-07 10:33:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:02,679 INFO L225 Difference]: With dead ends: 109 [2019-09-07 10:33:02,679 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 10:33:02,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:33:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 10:33:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 53. [2019-09-07 10:33:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 10:33:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-09-07 10:33:02,683 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2019-09-07 10:33:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:02,684 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-09-07 10:33:02,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:33:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-09-07 10:33:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 10:33:02,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:02,685 INFO L399 BasicCegarLoop]: trace histogram [23, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:02,685 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash -539866011, now seen corresponding path program 24 times [2019-09-07 10:33:02,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:02,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:02,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 10:33:02,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:02,798 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-07 10:33:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:33:16,304 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:33:16,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:16,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:33:16,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 10:33:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:16,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:33:16,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:33:16,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:33:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:33:16,331 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 15 states. [2019-09-07 10:33:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:16,501 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2019-09-07 10:33:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:33:16,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2019-09-07 10:33:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:16,502 INFO L225 Difference]: With dead ends: 100 [2019-09-07 10:33:16,502 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 10:33:16,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:33:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 10:33:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 54. [2019-09-07 10:33:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 10:33:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-09-07 10:33:16,507 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 49 [2019-09-07 10:33:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:16,507 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-09-07 10:33:16,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:33:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-09-07 10:33:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 10:33:16,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:16,508 INFO L399 BasicCegarLoop]: trace histogram [23, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:16,508 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1673837942, now seen corresponding path program 25 times [2019-09-07 10:33:16,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:16,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:16,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:33:16,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:16,812 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-07 10:33:16,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:33:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:16,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:33:16,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:33:16,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:16,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:33:16,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:33:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:33:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:33:16,879 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 27 states. [2019-09-07 10:33:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:17,113 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-09-07 10:33:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:33:17,117 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-09-07 10:33:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:17,118 INFO L225 Difference]: With dead ends: 115 [2019-09-07 10:33:17,118 INFO L226 Difference]: Without dead ends: 91 [2019-09-07 10:33:17,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:33:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-07 10:33:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2019-09-07 10:33:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 10:33:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-09-07 10:33:17,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2019-09-07 10:33:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:17,122 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-09-07 10:33:17,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:33:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-09-07 10:33:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:33:17,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:17,123 INFO L399 BasicCegarLoop]: trace histogram [24, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:17,123 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash 162937830, now seen corresponding path program 26 times [2019-09-07 10:33:17,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:17,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:17,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:33:17,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:33:17,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:17,448 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) [2019-09-07 10:33:17,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:17,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:33:17,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:17,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:33:17,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:33:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:17,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:33:17,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:33:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:33:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:33:17,532 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 28 states. [2019-09-07 10:33:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:17,756 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-09-07 10:33:17,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:33:17,757 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-09-07 10:33:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:17,758 INFO L225 Difference]: With dead ends: 116 [2019-09-07 10:33:17,758 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 10:33:17,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:33:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 10:33:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-09-07 10:33:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:33:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-07 10:33:17,764 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-09-07 10:33:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:17,765 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-07 10:33:17,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:33:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-07 10:33:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 10:33:17,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:17,766 INFO L399 BasicCegarLoop]: trace histogram [25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:17,766 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:17,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1268411914, now seen corresponding path program 27 times [2019-09-07 10:33:17,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:17,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:17,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:17,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:17,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 10:33:17,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:17,924 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) [2019-09-07 10:33:17,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:18,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:33:18,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:18,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:33:18,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:33:18,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:18,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:33:18,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:33:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:33:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:33:18,596 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 16 states. [2019-09-07 10:33:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:18,752 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-09-07 10:33:18,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:33:18,752 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-09-07 10:33:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:18,754 INFO L225 Difference]: With dead ends: 106 [2019-09-07 10:33:18,754 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 10:33:18,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:33:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 10:33:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2019-09-07 10:33:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-07 10:33:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-09-07 10:33:18,759 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2019-09-07 10:33:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:18,759 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-09-07 10:33:18,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:33:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-09-07 10:33:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 10:33:18,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:18,760 INFO L399 BasicCegarLoop]: trace histogram [25, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:18,761 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1451797115, now seen corresponding path program 28 times [2019-09-07 10:33:18,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:18,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:18,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:33:19,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:19,068 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) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:19,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:33:19,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:33:19,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:19,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:33:19,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:33:19,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:19,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:33:19,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:33:19,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:33:19,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:33:19,139 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 29 states. [2019-09-07 10:33:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:19,386 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2019-09-07 10:33:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:33:19,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-09-07 10:33:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:19,391 INFO L225 Difference]: With dead ends: 122 [2019-09-07 10:33:19,391 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 10:33:19,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:33:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 10:33:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2019-09-07 10:33:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 10:33:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-07 10:33:19,398 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 53 [2019-09-07 10:33:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:19,398 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-07 10:33:19,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:33:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-07 10:33:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 10:33:19,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:19,399 INFO L399 BasicCegarLoop]: trace histogram [26, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:19,400 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 51875497, now seen corresponding path program 29 times [2019-09-07 10:33:19,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:19,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:33:19,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:19,804 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) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:19,814 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:33:47,466 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 10:33:47,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:47,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:33:47,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-07 10:33:47,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:47,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 30 [2019-09-07 10:33:47,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:33:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:33:47,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:33:47,525 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 30 states. [2019-09-07 10:33:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:47,834 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2019-09-07 10:33:47,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:33:47,834 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-09-07 10:33:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:47,835 INFO L225 Difference]: With dead ends: 128 [2019-09-07 10:33:47,835 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 10:33:47,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:33:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 10:33:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2019-09-07 10:33:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 10:33:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-07 10:33:47,843 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 54 [2019-09-07 10:33:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:47,843 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-07 10:33:47,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:33:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-07 10:33:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:33:47,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:47,844 INFO L399 BasicCegarLoop]: trace histogram [28, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:47,844 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash 812535110, now seen corresponding path program 30 times [2019-09-07 10:33:47,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:47,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:47,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:47,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:33:48,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:48,319 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) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:48,336 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:34:43,459 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-07 10:34:43,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:43,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:34:43,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-09-07 10:34:43,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:43,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 32 [2019-09-07 10:34:43,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:34:43,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:34:43,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:34:43,537 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 32 states. [2019-09-07 10:34:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:43,841 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2019-09-07 10:34:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:34:43,842 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-09-07 10:34:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:43,844 INFO L225 Difference]: With dead ends: 135 [2019-09-07 10:34:43,844 INFO L226 Difference]: Without dead ends: 109 [2019-09-07 10:34:43,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:34:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-07 10:34:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 64. [2019-09-07 10:34:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:34:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-07 10:34:43,850 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2019-09-07 10:34:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:43,850 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-07 10:34:43,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:34:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-07 10:34:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 10:34:43,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:43,851 INFO L399 BasicCegarLoop]: trace histogram [30, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:43,851 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -530904759, now seen corresponding path program 31 times [2019-09-07 10:34:43,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:43,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:43,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:34:44,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:44,458 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-07 10:34:44,474 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-07 10:34:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:44,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:34:44,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:34:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:44,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:34:44,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:34:44,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:34:44,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:34:44,553 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 34 states. [2019-09-07 10:34:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:44,916 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2019-09-07 10:34:44,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:34:44,917 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 60 [2019-09-07 10:34:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:44,918 INFO L225 Difference]: With dead ends: 137 [2019-09-07 10:34:44,918 INFO L226 Difference]: Without dead ends: 110 [2019-09-07 10:34:44,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:34:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-07 10:34:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 65. [2019-09-07 10:34:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 10:34:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-09-07 10:34:44,923 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 60 [2019-09-07 10:34:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:44,923 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-09-07 10:34:44,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:34:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-09-07 10:34:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 10:34:44,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:44,924 INFO L399 BasicCegarLoop]: trace histogram [31, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:44,924 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash 828571557, now seen corresponding path program 32 times [2019-09-07 10:34:44,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:44,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:44,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-07 10:34:45,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:45,117 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) [2019-09-07 10:34:45,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:45,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:34:45,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:45,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:34:45,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:34:45,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:45,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34] total 35 [2019-09-07 10:34:45,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:34:45,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:34:45,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:34:45,384 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 35 states. [2019-09-07 10:34:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:45,637 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2019-09-07 10:34:45,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:34:45,637 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 61 [2019-09-07 10:34:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:45,639 INFO L225 Difference]: With dead ends: 142 [2019-09-07 10:34:45,639 INFO L226 Difference]: Without dead ends: 115 [2019-09-07 10:34:45,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:34:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-07 10:34:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2019-09-07 10:34:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 10:34:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-09-07 10:34:45,646 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 61 [2019-09-07 10:34:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:45,647 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2019-09-07 10:34:45,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:34:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2019-09-07 10:34:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:34:45,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:45,648 INFO L399 BasicCegarLoop]: trace histogram [32, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:45,649 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1415264602, now seen corresponding path program 33 times [2019-09-07 10:34:45,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:45,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:45,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-07 10:34:46,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:46,635 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-07 10:34:46,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:34:55,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:34:55,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:55,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:34:55,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-07 10:34:55,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:55,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19] total 36 [2019-09-07 10:34:55,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:34:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:34:55,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:34:55,758 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 36 states. [2019-09-07 10:34:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:56,182 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2019-09-07 10:34:56,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:34:56,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 63 [2019-09-07 10:34:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:56,184 INFO L225 Difference]: With dead ends: 149 [2019-09-07 10:34:56,184 INFO L226 Difference]: Without dead ends: 121 [2019-09-07 10:34:56,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:34:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-07 10:34:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 70. [2019-09-07 10:34:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 10:34:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-07 10:34:56,189 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-09-07 10:34:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:56,189 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-07 10:34:56,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:34:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-07 10:34:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 10:34:56,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:56,190 INFO L399 BasicCegarLoop]: trace histogram [34, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:56,190 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash -261809175, now seen corresponding path program 34 times [2019-09-07 10:34:56,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:56,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:56,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:34:56,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:56,939 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) [2019-09-07 10:34:56,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:57,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:34:57,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:57,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:34:57,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:34:57,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:57,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:34:57,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:34:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:34:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:34:57,029 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 38 states. [2019-09-07 10:34:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:57,430 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2019-09-07 10:34:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:34:57,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2019-09-07 10:34:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:57,431 INFO L225 Difference]: With dead ends: 151 [2019-09-07 10:34:57,432 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 10:34:57,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:34:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 10:34:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 71. [2019-09-07 10:34:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 10:34:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-09-07 10:34:57,438 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2019-09-07 10:34:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:57,439 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-09-07 10:34:57,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:34:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-09-07 10:34:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:34:57,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:57,439 INFO L399 BasicCegarLoop]: trace histogram [35, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:57,440 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1608113477, now seen corresponding path program 35 times [2019-09-07 10:34:57,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:57,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:57,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-07 10:34:57,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:57,634 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-07 10:34:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:36:05,144 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 10:36:05,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:05,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:36:05,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:36:05,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:05,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 38] total 39 [2019-09-07 10:36:05,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:36:05,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:36:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:36:05,446 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 39 states. [2019-09-07 10:36:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:05,753 INFO L93 Difference]: Finished difference Result 156 states and 179 transitions. [2019-09-07 10:36:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:36:05,753 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 67 [2019-09-07 10:36:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:05,755 INFO L225 Difference]: With dead ends: 156 [2019-09-07 10:36:05,755 INFO L226 Difference]: Without dead ends: 127 [2019-09-07 10:36:05,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:36:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-07 10:36:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 73. [2019-09-07 10:36:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 10:36:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-09-07 10:36:05,768 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 67 [2019-09-07 10:36:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:05,769 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-09-07 10:36:05,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:36:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-09-07 10:36:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 10:36:05,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:05,769 INFO L399 BasicCegarLoop]: trace histogram [36, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:05,770 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2106611706, now seen corresponding path program 36 times [2019-09-07 10:36:05,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:05,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:05,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:36:06,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:06,529 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) [2019-09-07 10:36:06,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:37:28,525 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:37:28,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:28,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:37:28,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-09-07 10:37:28,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:28,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21] total 40 [2019-09-07 10:37:28,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:37:28,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:37:28,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:37:28,625 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 40 states. [2019-09-07 10:37:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:29,141 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2019-09-07 10:37:29,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:37:29,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 69 [2019-09-07 10:37:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:29,143 INFO L225 Difference]: With dead ends: 163 [2019-09-07 10:37:29,144 INFO L226 Difference]: Without dead ends: 133 [2019-09-07 10:37:29,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:37:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-07 10:37:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2019-09-07 10:37:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:37:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-07 10:37:29,150 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2019-09-07 10:37:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:29,150 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-07 10:37:29,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:37:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-07 10:37:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 10:37:29,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:29,151 INFO L399 BasicCegarLoop]: trace histogram [38, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:29,151 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1797273975, now seen corresponding path program 37 times [2019-09-07 10:37:29,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:29,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:37:29,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:29,802 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-07 10:37:29,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:37:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:29,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:37:29,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:37:29,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:29,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-07 10:37:29,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 10:37:29,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 10:37:29,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:37:29,905 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 42 states. [2019-09-07 10:37:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:30,489 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2019-09-07 10:37:30,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 10:37:30,490 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 72 [2019-09-07 10:37:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:30,491 INFO L225 Difference]: With dead ends: 165 [2019-09-07 10:37:30,491 INFO L226 Difference]: Without dead ends: 134 [2019-09-07 10:37:30,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:37:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-07 10:37:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 77. [2019-09-07 10:37:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 10:37:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-09-07 10:37:30,498 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2019-09-07 10:37:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:30,499 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-09-07 10:37:30,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 10:37:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-09-07 10:37:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 10:37:30,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:30,500 INFO L399 BasicCegarLoop]: trace histogram [39, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:30,500 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash 851251941, now seen corresponding path program 38 times [2019-09-07 10:37:30,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:30,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:37:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-07 10:37:30,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:30,795 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) [2019-09-07 10:37:30,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:37:30,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:37:30,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:30,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:37:30,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:37:31,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:31,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 42] total 43 [2019-09-07 10:37:31,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:37:31,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:37:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:37:31,061 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 43 states. [2019-09-07 10:37:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:31,404 INFO L93 Difference]: Finished difference Result 170 states and 195 transitions. [2019-09-07 10:37:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:37:31,404 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 73 [2019-09-07 10:37:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:31,405 INFO L225 Difference]: With dead ends: 170 [2019-09-07 10:37:31,405 INFO L226 Difference]: Without dead ends: 139 [2019-09-07 10:37:31,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:37:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-07 10:37:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 79. [2019-09-07 10:37:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 10:37:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-09-07 10:37:31,413 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 73 [2019-09-07 10:37:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:31,413 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-09-07 10:37:31,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:37:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-09-07 10:37:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:37:31,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:31,414 INFO L399 BasicCegarLoop]: trace histogram [40, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:31,415 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1113911654, now seen corresponding path program 39 times [2019-09-07 10:37:31,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:31,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:31,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:37:32,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:32,271 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) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:37:32,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:37:47,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 10:37:47,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:48,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:37:48,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-09-07 10:37:48,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:48,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23] total 44 [2019-09-07 10:37:48,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:37:48,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:37:48,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:37:48,054 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 44 states. [2019-09-07 10:37:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:48,531 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2019-09-07 10:37:48,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:37:48,531 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 75 [2019-09-07 10:37:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:48,532 INFO L225 Difference]: With dead ends: 177 [2019-09-07 10:37:48,532 INFO L226 Difference]: Without dead ends: 145 [2019-09-07 10:37:48,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:37:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-07 10:37:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 82. [2019-09-07 10:37:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 10:37:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-07 10:37:48,540 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 75 [2019-09-07 10:37:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:48,540 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-07 10:37:48,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:37:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-07 10:37:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 10:37:48,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:48,541 INFO L399 BasicCegarLoop]: trace histogram [42, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:48,542 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash -118159063, now seen corresponding path program 40 times [2019-09-07 10:37:48,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:48,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:48,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:48,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-07 10:37:49,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:49,277 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-07 10:37:49,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:37:49,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:37:49,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:49,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:37:49,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:37:49,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:49,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 10:37:49,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:37:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:37:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:37:49,383 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 46 states. [2019-09-07 10:37:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:49,868 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2019-09-07 10:37:49,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:37:49,868 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 78 [2019-09-07 10:37:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:49,869 INFO L225 Difference]: With dead ends: 179 [2019-09-07 10:37:49,870 INFO L226 Difference]: Without dead ends: 146 [2019-09-07 10:37:49,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:37:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-07 10:37:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 83. [2019-09-07 10:37:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 10:37:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-09-07 10:37:49,878 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 78 [2019-09-07 10:37:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:49,879 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-09-07 10:37:49,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:37:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-09-07 10:37:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:37:49,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:49,879 INFO L399 BasicCegarLoop]: trace histogram [43, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:49,880 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1499897989, now seen corresponding path program 41 times [2019-09-07 10:37:49,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:49,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-07 10:37:50,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:50,144 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-07 10:37:50,155 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:39:19,203 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 10:39:19,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:39:19,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:39:19,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:39:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-07 10:39:19,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:39:19,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 46] total 47 [2019-09-07 10:39:19,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:39:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:39:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:39:19,505 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 47 states. [2019-09-07 10:39:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:39:19,875 INFO L93 Difference]: Finished difference Result 184 states and 211 transitions. [2019-09-07 10:39:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:39:19,876 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2019-09-07 10:39:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:39:19,877 INFO L225 Difference]: With dead ends: 184 [2019-09-07 10:39:19,877 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 10:39:19,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:39:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 10:39:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 85. [2019-09-07 10:39:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 10:39:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2019-09-07 10:39:19,884 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 79 [2019-09-07 10:39:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:39:19,885 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2019-09-07 10:39:19,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:39:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2019-09-07 10:39:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 10:39:19,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:39:19,886 INFO L399 BasicCegarLoop]: trace histogram [44, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:39:19,886 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:39:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:39:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1603969734, now seen corresponding path program 42 times [2019-09-07 10:39:19,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:39:19,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:39:19,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:19,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:39:19,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:39:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 10:39:20,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:39:20,689 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-07 10:39:20,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:41:33,944 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-09-07 10:41:33,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:33,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:41:33,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 10:41:34,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:34,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-07 10:41:34,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 10:41:34,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 10:41:34,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:41:34,041 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 48 states. [2019-09-07 10:41:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:34,493 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2019-09-07 10:41:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:41:34,494 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 81 [2019-09-07 10:41:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:34,495 INFO L225 Difference]: With dead ends: 186 [2019-09-07 10:41:34,495 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:41:34,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:41:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:41:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 86. [2019-09-07 10:41:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 10:41:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-07 10:41:34,502 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 81 [2019-09-07 10:41:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:34,502 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-07 10:41:34,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 10:41:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-07 10:41:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 10:41:34,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:34,504 INFO L399 BasicCegarLoop]: trace histogram [45, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:34,504 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1571324438, now seen corresponding path program 43 times [2019-09-07 10:41:34,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:34,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:34,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-09-07 10:41:34,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:34,830 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) [2019-09-07 10:41:34,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:41:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:34,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:41:34,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 10:41:35,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:35,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 48] total 49 [2019-09-07 10:41:35,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:41:35,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:41:35,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:41:35,170 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 49 states. [2019-09-07 10:41:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:35,616 INFO L93 Difference]: Finished difference Result 191 states and 219 transitions. [2019-09-07 10:41:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:41:35,616 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 82 [2019-09-07 10:41:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:35,618 INFO L225 Difference]: With dead ends: 191 [2019-09-07 10:41:35,618 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 10:41:35,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:41:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 10:41:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 88. [2019-09-07 10:41:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:41:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-07 10:41:35,624 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 82 [2019-09-07 10:41:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:35,625 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-07 10:41:35,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:41:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-07 10:41:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 10:41:35,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:35,626 INFO L399 BasicCegarLoop]: trace histogram [46, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:35,626 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1320229943, now seen corresponding path program 44 times [2019-09-07 10:41:35,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:35,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:41:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 10:41:36,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:36,633 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-07 10:41:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:41:36,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:41:36,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:36,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:41:36,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 10:41:36,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:36,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 10:41:36,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:41:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:41:36,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:41:36,744 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 50 states. [2019-09-07 10:41:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:37,206 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2019-09-07 10:41:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:41:37,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 84 [2019-09-07 10:41:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:37,207 INFO L225 Difference]: With dead ends: 193 [2019-09-07 10:41:37,207 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 10:41:37,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:41:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 10:41:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 89. [2019-09-07 10:41:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 10:41:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-09-07 10:41:37,213 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 84 [2019-09-07 10:41:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:37,213 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-09-07 10:41:37,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:41:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-09-07 10:41:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 10:41:37,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:37,214 INFO L399 BasicCegarLoop]: trace histogram [47, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:37,214 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash 145786405, now seen corresponding path program 45 times [2019-09-07 10:41:37,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:37,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-09-07 10:41:37,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:37,716 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-07 10:41:37,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:42:20,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-07 10:42:20,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:20,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:42:20,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-09-07 10:42:20,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:20,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:42:20,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:42:20,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:42:20,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:42:20,715 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 27 states. [2019-09-07 10:42:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:21,070 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2019-09-07 10:42:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:42:21,071 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2019-09-07 10:42:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:21,073 INFO L225 Difference]: With dead ends: 172 [2019-09-07 10:42:21,073 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 10:42:21,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:42:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 10:42:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 90. [2019-09-07 10:42:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-07 10:42:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-07 10:42:21,079 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 85 [2019-09-07 10:42:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:21,079 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-07 10:42:21,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:42:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-07 10:42:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 10:42:21,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:21,080 INFO L399 BasicCegarLoop]: trace histogram [47, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:21,080 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1893449526, now seen corresponding path program 46 times [2019-09-07 10:42:21,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 10:42:22,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:22,016 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-07 10:42:22,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:42:22,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:42:22,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:22,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:42:22,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 10:42:22,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-07 10:42:22,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:42:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:42:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:42:22,123 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 51 states. [2019-09-07 10:42:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:22,675 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2019-09-07 10:42:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 10:42:22,675 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 86 [2019-09-07 10:42:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:22,677 INFO L225 Difference]: With dead ends: 199 [2019-09-07 10:42:22,677 INFO L226 Difference]: Without dead ends: 163 [2019-09-07 10:42:22,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:42:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-07 10:42:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 91. [2019-09-07 10:42:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 10:42:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-09-07 10:42:22,684 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 86 [2019-09-07 10:42:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:22,684 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2019-09-07 10:42:22,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:42:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2019-09-07 10:42:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:42:22,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:22,685 INFO L399 BasicCegarLoop]: trace histogram [48, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:22,685 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1801012186, now seen corresponding path program 47 times [2019-09-07 10:42:22,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:22,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:22,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 10:42:23,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:23,598 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-07 10:42:23,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:44:19,933 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 10:44:19,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:19,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:44:19,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 10:44:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-07 10:44:20,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:44:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:44:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:44:20,044 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 52 states. [2019-09-07 10:44:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:20,721 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2019-09-07 10:44:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:44:20,721 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 87 [2019-09-07 10:44:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:20,722 INFO L225 Difference]: With dead ends: 200 [2019-09-07 10:44:20,722 INFO L226 Difference]: Without dead ends: 164 [2019-09-07 10:44:20,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:44:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-07 10:44:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 92. [2019-09-07 10:44:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-07 10:44:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-07 10:44:20,728 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2019-09-07 10:44:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:20,729 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-07 10:44:20,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:44:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-07 10:44:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 10:44:20,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:20,729 INFO L399 BasicCegarLoop]: trace histogram [49, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:20,730 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1064545354, now seen corresponding path program 48 times [2019-09-07 10:44:20,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:20,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:20,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 10:44:21,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:21,169 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) [2019-09-07 10:44:21,187 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000