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_palindrome_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:15:24,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:15:24,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:15:24,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:15:24,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:15:24,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:15:24,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:15:24,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:15:24,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:15:24,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:15:24,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:15:24,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:15:24,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:15:24,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:15:24,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:15:24,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:15:24,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:15:24,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:15:24,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:15:24,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:15:24,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:15:24,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:15:24,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:15:24,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:15:24,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:15:24,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:15:24,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:15:24,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:15:24,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:15:24,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:15:24,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:15:24,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:15:24,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:15:24,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:15:24,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:15:24,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:15:24,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:15:24,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:15:24,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:15:24,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:15:24,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:15:24,780 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:15:24,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:15:24,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:15:24,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:15:24,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:15:24,822 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:15:24,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:15:24,823 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:15:24,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:15:24,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:15:24,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:15:24,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:15:24,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:15:24,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:15:24,826 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:15:24,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:15:24,826 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:15:24,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:15:24,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:15:24,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:15:24,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:15:24,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:15:24,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:15:24,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:15:24,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:15:24,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:15:24,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:15:24,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:15:24,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:15:24,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:15:24,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:15:24,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:15:24,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:15:24,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:15:24,892 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:15:24,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_palindrome_ground.i [2019-09-07 10:15:24,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112ccd7ab/f8350f61df1d413c85da4e5a4f0fb7f1/FLAGb7417395e [2019-09-07 10:15:25,379 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:15:25,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_palindrome_ground.i [2019-09-07 10:15:25,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112ccd7ab/f8350f61df1d413c85da4e5a4f0fb7f1/FLAGb7417395e [2019-09-07 10:15:25,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112ccd7ab/f8350f61df1d413c85da4e5a4f0fb7f1 [2019-09-07 10:15:25,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:15:25,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:15:25,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:15:25,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:15:25,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:15:25,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:15:25" (1/1) ... [2019-09-07 10:15:25,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19027eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:25, skipping insertion in model container [2019-09-07 10:15:25,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:15:25" (1/1) ... [2019-09-07 10:15:25,825 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:15:25,842 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:15:26,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:15:26,051 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:15:26,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:15:26,109 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:15:26,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26 WrapperNode [2019-09-07 10:15:26,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:15:26,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:15:26,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:15:26,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:15:26,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (1/1) ... [2019-09-07 10:15:26,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (1/1) ... [2019-09-07 10:15:26,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (1/1) ... [2019-09-07 10:15:26,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (1/1) ... [2019-09-07 10:15:26,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (1/1) ... [2019-09-07 10:15:26,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (1/1) ... [2019-09-07 10:15:26,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (1/1) ... [2019-09-07 10:15:26,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:15:26,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:15:26,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:15:26,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:15:26,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (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:15:26,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:15:26,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:15:26,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:15:26,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:15:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:15:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:15:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:15:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:15:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:15:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:15:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:15:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:15:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:15:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:15:26,596 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:15:26,597 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:15:26,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:15:26 BoogieIcfgContainer [2019-09-07 10:15:26,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:15:26,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:15:26,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:15:26,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:15:26,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:15:25" (1/3) ... [2019-09-07 10:15:26,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df71d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:15:26, skipping insertion in model container [2019-09-07 10:15:26,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:15:26" (2/3) ... [2019-09-07 10:15:26,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df71d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:15:26, skipping insertion in model container [2019-09-07 10:15:26,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:15:26" (3/3) ... [2019-09-07 10:15:26,615 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_palindrome_ground.i [2019-09-07 10:15:26,627 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:15:26,634 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:15:26,651 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:15:26,683 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:15:26,683 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:15:26,684 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:15:26,684 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:15:26,684 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:15:26,684 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:15:26,684 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:15:26,685 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:15:26,685 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:15:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 10:15:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:15:26,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:26,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:26,710 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-09-07 10:15:26,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:26,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:26,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:26,861 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:15:26,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:15:26,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:15:26,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:15:26,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:15:26,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:15:26,886 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 10:15:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:26,908 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-09-07 10:15:26,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:15:26,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:15:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:26,916 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:15:26,916 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 10:15:26,920 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:15:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 10:15:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 10:15:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:15:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 10:15:26,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-09-07 10:15:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:26,958 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 10:15:26,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:15:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 10:15:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:15:26,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:26,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:26,960 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-09-07 10:15:26,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:26,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:27,014 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:15:27,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:15:27,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:15:27,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:15:27,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:15:27,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:15:27,018 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-09-07 10:15:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:27,087 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-09-07 10:15:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:15:27,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:15:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:27,095 INFO L225 Difference]: With dead ends: 40 [2019-09-07 10:15:27,095 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 10:15:27,096 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:15:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 10:15:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-09-07 10:15:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:15:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 10:15:27,103 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2019-09-07 10:15:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:27,104 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 10:15:27,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:15:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 10:15:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:15:27,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:27,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:27,105 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-09-07 10:15:27,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:27,190 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:15:27,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:27,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:27,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:27,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:15:27,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:27,296 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:15:27,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:27,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:15:27,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:15:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:15:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:15:27,313 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-09-07 10:15:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:27,387 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-07 10:15:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:15:27,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 10:15:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:27,391 INFO L225 Difference]: With dead ends: 45 [2019-09-07 10:15:27,391 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 10:15:27,392 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:15:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 10:15:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-09-07 10:15:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:15:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-07 10:15:27,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-09-07 10:15:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:27,406 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-07 10:15:27,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:15:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-07 10:15:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:15:27,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:27,409 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:27,410 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-09-07 10:15:27,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:27,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:15:27,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:27,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:27,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:15:27,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:27,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:27,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:15:27,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:15:27,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:27,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:15:27,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:15:27,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:15:27,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:15:27,603 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-09-07 10:15:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:27,665 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-07 10:15:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:15:27,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-07 10:15:27,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:27,667 INFO L225 Difference]: With dead ends: 51 [2019-09-07 10:15:27,667 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 10:15:27,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:15:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 10:15:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-07 10:15:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:15:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-07 10:15:27,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2019-09-07 10:15:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:27,676 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-07 10:15:27,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:15:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-07 10:15:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:15:27,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:27,678 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:27,678 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2019-09-07 10:15:27,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:27,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:27,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:27,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:27,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:15:27,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:27,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:27,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:15:27,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:27,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:15:27,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:15:27,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:27,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:15:27,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:15:27,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:15:27,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:15:27,885 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2019-09-07 10:15:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:27,970 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-09-07 10:15:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:15:27,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-07 10:15:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:27,972 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:15:27,972 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 10:15:27,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:15:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 10:15:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-09-07 10:15:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 10:15:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-07 10:15:27,980 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2019-09-07 10:15:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:27,980 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-07 10:15:27,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:15:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-07 10:15:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 10:15:27,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:27,982 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:27,982 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:27,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 702132246, now seen corresponding path program 4 times [2019-09-07 10:15:27,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:27,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:27,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:27,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:27,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:15:28,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:28,051 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:15:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:15:28,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:28,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:28,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:15:28,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:15:28,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:28,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:15:28,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:15:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:15:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:15:28,125 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2019-09-07 10:15:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:28,223 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-09-07 10:15:28,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:15:28,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-07 10:15:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:28,228 INFO L225 Difference]: With dead ends: 63 [2019-09-07 10:15:28,228 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:15:28,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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:15:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:15:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-07 10:15:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:15:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-07 10:15:28,240 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2019-09-07 10:15:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:28,241 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-07 10:15:28,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:15:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-07 10:15:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:15:28,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:28,244 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:28,244 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -294189934, now seen corresponding path program 5 times [2019-09-07 10:15:28,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:28,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:28,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:15:28,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:28,353 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:15:28,369 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:15:28,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 10:15:28,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:28,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:15:28,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:15:28,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:28,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:15:28,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:15:28,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:15:28,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:15:28,535 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 9 states. [2019-09-07 10:15:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:28,608 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-09-07 10:15:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:15:28,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-09-07 10:15:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:28,610 INFO L225 Difference]: With dead ends: 69 [2019-09-07 10:15:28,610 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 10:15:28,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 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:15:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 10:15:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-07 10:15:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:15:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-07 10:15:28,618 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 35 [2019-09-07 10:15:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:28,618 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-07 10:15:28,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:15:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-07 10:15:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:15:28,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:28,620 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:28,620 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1966517006, now seen corresponding path program 6 times [2019-09-07 10:15:28,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:28,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:28,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:15:28,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:28,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 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:15:28,740 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:15:28,846 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:15:28,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:28,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:15:28,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:15:28,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:28,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:15:28,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:15:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:15:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:15:28,876 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 10 states. [2019-09-07 10:15:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:28,967 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-07 10:15:28,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:15:28,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-07 10:15:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:28,968 INFO L225 Difference]: With dead ends: 75 [2019-09-07 10:15:28,969 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 10:15:28,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 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:15:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 10:15:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-09-07 10:15:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:15:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-07 10:15:28,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 39 [2019-09-07 10:15:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:28,976 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-07 10:15:28,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:15:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-07 10:15:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:15:28,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:28,978 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:28,978 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:28,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1042523018, now seen corresponding path program 7 times [2019-09-07 10:15:28,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:28,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:28,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:15:29,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:29,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:29,162 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:15:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:29,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:15:29,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:15:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:15:29,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:15:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:15:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:15:29,243 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 11 states. [2019-09-07 10:15:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:29,370 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-09-07 10:15:29,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:15:29,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-09-07 10:15:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:29,371 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:15:29,371 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 10:15:29,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 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:15:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 10:15:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-09-07 10:15:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:15:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-07 10:15:29,378 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 43 [2019-09-07 10:15:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:29,378 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-07 10:15:29,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:15:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-07 10:15:29,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:15:29,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:29,380 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:29,380 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:29,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2059988486, now seen corresponding path program 8 times [2019-09-07 10:15:29,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:29,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:29,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:29,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:15:29,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:29,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:29,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:29,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:29,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:29,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:15:29,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:15:29,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:29,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:15:29,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:15:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:15:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:15:29,581 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 12 states. [2019-09-07 10:15:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:29,683 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-09-07 10:15:29,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:15:29,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-09-07 10:15:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:29,685 INFO L225 Difference]: With dead ends: 87 [2019-09-07 10:15:29,685 INFO L226 Difference]: Without dead ends: 58 [2019-09-07 10:15:29,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:15:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-07 10:15:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-09-07 10:15:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:15:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-07 10:15:29,698 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 47 [2019-09-07 10:15:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:29,699 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-07 10:15:29,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:15:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-07 10:15:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:15:29,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:29,703 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:29,704 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1909355902, now seen corresponding path program 9 times [2019-09-07 10:15:29,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:29,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:29,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:29,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:15:29,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:29,852 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:15:29,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:30,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:15:30,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:30,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:15:30,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:15:30,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:30,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:15:30,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:15:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:15:30,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:15:30,601 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 13 states. [2019-09-07 10:15:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:30,724 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-09-07 10:15:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:15:30,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-09-07 10:15:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:30,726 INFO L225 Difference]: With dead ends: 93 [2019-09-07 10:15:30,726 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 10:15:30,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:15:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 10:15:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-09-07 10:15:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 10:15:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-07 10:15:30,743 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 51 [2019-09-07 10:15:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:30,744 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-07 10:15:30,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:15:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-07 10:15:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 10:15:30,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:30,745 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:30,745 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1930921730, now seen corresponding path program 10 times [2019-09-07 10:15:30,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:30,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:30,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:30,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:30,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:15:30,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:30,911 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:15:30,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:15:30,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:30,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:30,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:15:30,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:15:31,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:31,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:15:31,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:15:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:15:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:15:31,008 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 14 states. [2019-09-07 10:15:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:31,098 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-09-07 10:15:31,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:15:31,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-09-07 10:15:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:31,100 INFO L225 Difference]: With dead ends: 99 [2019-09-07 10:15:31,100 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 10:15:31,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 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:15:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 10:15:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-07 10:15:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:15:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-07 10:15:31,106 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2019-09-07 10:15:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:31,107 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-07 10:15:31,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:15:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-07 10:15:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:15:31,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:31,109 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:31,109 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:31,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1124550278, now seen corresponding path program 11 times [2019-09-07 10:15:31,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:31,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:31,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:31,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:15:31,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:31,267 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:15:31,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:15:32,394 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-07 10:15:32,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:32,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:15:32,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:15:32,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:32,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:15:32,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:15:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:15:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:15:32,436 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 15 states. [2019-09-07 10:15:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:32,562 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2019-09-07 10:15:32,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:15:32,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-09-07 10:15:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:32,564 INFO L225 Difference]: With dead ends: 105 [2019-09-07 10:15:32,564 INFO L226 Difference]: Without dead ends: 70 [2019-09-07 10:15:32,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 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:15:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-07 10:15:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-07 10:15:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 10:15:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-07 10:15:32,571 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 59 [2019-09-07 10:15:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:32,572 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-07 10:15:32,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:15:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-07 10:15:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:15:32,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:32,573 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:32,573 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:32,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash 367873014, now seen corresponding path program 12 times [2019-09-07 10:15:32,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:32,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:32,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:15:32,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:32,705 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:15:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:15:34,780 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:15:34,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:34,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:15:34,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:15:34,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:34,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:15:34,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:15:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:15:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:15:34,822 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 16 states. [2019-09-07 10:15:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:34,934 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-09-07 10:15:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:15:34,934 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-09-07 10:15:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:34,935 INFO L225 Difference]: With dead ends: 111 [2019-09-07 10:15:34,935 INFO L226 Difference]: Without dead ends: 74 [2019-09-07 10:15:34,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 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:15:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-07 10:15:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-09-07 10:15:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 10:15:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-07 10:15:34,951 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 63 [2019-09-07 10:15:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:34,951 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-07 10:15:34,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:15:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-07 10:15:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:15:34,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:34,953 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:34,953 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1060032398, now seen corresponding path program 13 times [2019-09-07 10:15:34,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:34,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:34,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:34,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:34,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 10:15:35,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:35,100 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) [2019-09-07 10:15:35,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:35,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:15:35,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:15:35,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:35,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:15:35,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:15:35,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:15:35,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:15:35,194 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 17 states. [2019-09-07 10:15:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:35,296 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-09-07 10:15:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:15:35,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-07 10:15:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:35,299 INFO L225 Difference]: With dead ends: 117 [2019-09-07 10:15:35,299 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:15:35,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:15:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:15:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-07 10:15:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:15:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-07 10:15:35,306 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 67 [2019-09-07 10:15:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:35,306 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-07 10:15:35,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:15:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-07 10:15:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:15:35,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:35,308 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:35,308 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:35,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1741723922, now seen corresponding path program 14 times [2019-09-07 10:15:35,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:35,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:15:35,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:35,479 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:15:35,501 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:15:35,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:35,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:35,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:15:35,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:15:35,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:35,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:15:35,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:15:35,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:15:35,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:15:35,601 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 18 states. [2019-09-07 10:15:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:35,741 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-09-07 10:15:35,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:15:35,742 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2019-09-07 10:15:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:35,743 INFO L225 Difference]: With dead ends: 123 [2019-09-07 10:15:35,743 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 10:15:35,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:15:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 10:15:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-09-07 10:15:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 10:15:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-09-07 10:15:35,750 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 71 [2019-09-07 10:15:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:35,750 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-09-07 10:15:35,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:15:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-09-07 10:15:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:15:35,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:35,752 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:35,752 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1475154070, now seen corresponding path program 15 times [2019-09-07 10:15:35,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:35,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:35,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 10:15:35,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:35,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:36,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:41,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 10:15:41,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:41,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:15:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 10:15:41,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:41,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:15:41,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:15:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:15:41,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:15:41,687 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 19 states. [2019-09-07 10:15:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:41,821 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-09-07 10:15:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:15:41,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-09-07 10:15:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:41,823 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:15:41,823 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 10:15:41,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:15:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 10:15:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-09-07 10:15:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 10:15:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-07 10:15:41,829 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 75 [2019-09-07 10:15:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:41,829 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-07 10:15:41,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:15:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-07 10:15:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:15:41,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:41,830 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:41,830 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1375286810, now seen corresponding path program 16 times [2019-09-07 10:15:41,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:41,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:41,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:41,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:41,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 10:15:42,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:42,044 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:15:42,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:15:42,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:42,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:42,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:15:42,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 10:15:42,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:42,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:15:42,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:15:42,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:15:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:15:42,144 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 20 states. [2019-09-07 10:15:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:42,296 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-09-07 10:15:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:15:42,296 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2019-09-07 10:15:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:42,297 INFO L225 Difference]: With dead ends: 135 [2019-09-07 10:15:42,298 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 10:15:42,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 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:15:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 10:15:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-07 10:15:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:15:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-07 10:15:42,303 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 79 [2019-09-07 10:15:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:42,303 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-07 10:15:42,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:15:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-07 10:15:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:15:42,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:42,305 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:42,305 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:42,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1726613918, now seen corresponding path program 17 times [2019-09-07 10:15:42,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:42,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:42,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 10:15:42,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:42,520 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) [2019-09-07 10:15:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:47,580 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-07 10:15:47,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:47,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:15:47,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 10:15:47,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:47,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:15:47,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:15:47,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:15:47,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:15:47,627 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 21 states. [2019-09-07 10:15:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:47,756 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2019-09-07 10:15:47,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:15:47,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2019-09-07 10:15:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:47,757 INFO L225 Difference]: With dead ends: 141 [2019-09-07 10:15:47,757 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 10:15:47,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:15:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 10:15:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-09-07 10:15:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-07 10:15:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-07 10:15:47,762 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 83 [2019-09-07 10:15:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:47,762 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-07 10:15:47,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:15:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-07 10:15:47,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:15:47,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:47,763 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:47,764 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:47,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:47,764 INFO L82 PathProgramCache]: Analyzing trace with hash 164328670, now seen corresponding path program 18 times [2019-09-07 10:15:47,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:47,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:47,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:47,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:47,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 10:15:47,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:47,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:47,978 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:16:23,153 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:16:23,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:23,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:16:23,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 10:16:23,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:23,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:16:23,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:16:23,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:16:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:16:23,232 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 22 states. [2019-09-07 10:16:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:23,397 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2019-09-07 10:16:23,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:16:23,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-07 10:16:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:23,398 INFO L225 Difference]: With dead ends: 147 [2019-09-07 10:16:23,399 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 10:16:23,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:16:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 10:16:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-09-07 10:16:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:16:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-07 10:16:23,402 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 87 [2019-09-07 10:16:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:23,402 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-07 10:16:23,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:16:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-07 10:16:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:16:23,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:23,404 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:23,404 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash -768457382, now seen corresponding path program 19 times [2019-09-07 10:16:23,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:23,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:23,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:23,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:23,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 10:16:23,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:23,680 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:16:23,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:16:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:23,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:16:23,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:16:23,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:23,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:16:23,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:16:23,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:16:23,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:16:23,765 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 23 states. [2019-09-07 10:16:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:23,958 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2019-09-07 10:16:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:16:23,961 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2019-09-07 10:16:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:23,962 INFO L225 Difference]: With dead ends: 153 [2019-09-07 10:16:23,962 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 10:16:23,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:16:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 10:16:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-09-07 10:16:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 10:16:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-09-07 10:16:23,966 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 91 [2019-09-07 10:16:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:23,967 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-09-07 10:16:23,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:16:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-09-07 10:16:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:16:23,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:23,968 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:23,968 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1976920022, now seen corresponding path program 20 times [2019-09-07 10:16:23,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:23,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:23,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:16:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 10:16:24,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:24,218 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:16:24,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:16:24,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:16:24,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:24,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:16:24,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 10:16:24,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:24,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:16:24,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:16:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:16:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:16:24,323 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 24 states. [2019-09-07 10:16:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:24,492 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2019-09-07 10:16:24,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:16:24,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2019-09-07 10:16:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:24,496 INFO L225 Difference]: With dead ends: 159 [2019-09-07 10:16:24,497 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 10:16:24,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 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:16:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 10:16:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-09-07 10:16:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 10:16:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-07 10:16:24,503 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 95 [2019-09-07 10:16:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:24,503 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-07 10:16:24,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:16:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-07 10:16:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:16:24,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:24,504 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:24,505 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1447044014, now seen corresponding path program 21 times [2019-09-07 10:16:24,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:24,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:24,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:24,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:16:24,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:24,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:24,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:17:01,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-07 10:17:01,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:01,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:17:01,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:17:01,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:01,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:17:01,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:17:01,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:17:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:17:01,333 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 25 states. [2019-09-07 10:17:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:01,522 INFO L93 Difference]: Finished difference Result 165 states and 170 transitions. [2019-09-07 10:17:01,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:17:01,522 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2019-09-07 10:17:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:01,523 INFO L225 Difference]: With dead ends: 165 [2019-09-07 10:17:01,523 INFO L226 Difference]: Without dead ends: 110 [2019-09-07 10:17:01,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 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:17:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-07 10:17:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-09-07 10:17:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-07 10:17:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-07 10:17:01,529 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 99 [2019-09-07 10:17:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:01,529 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-07 10:17:01,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:17:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-07 10:17:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 10:17:01,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:01,530 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:01,531 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:01,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:01,531 INFO L82 PathProgramCache]: Analyzing trace with hash -730029362, now seen corresponding path program 22 times [2019-09-07 10:17:01,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:01,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:01,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:01,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:01,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 10:17:01,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:01,879 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:17:01,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:17:01,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:17:01,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:01,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:17:01,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:17:01,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:01,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:17:01,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:17:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:17:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:17:01,980 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 26 states. [2019-09-07 10:17:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:02,157 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2019-09-07 10:17:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:17:02,157 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2019-09-07 10:17:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:02,158 INFO L225 Difference]: With dead ends: 171 [2019-09-07 10:17:02,159 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 10:17:02,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 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:17:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 10:17:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-07 10:17:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 10:17:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-07 10:17:02,164 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 103 [2019-09-07 10:17:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:02,165 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-07 10:17:02,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:17:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-07 10:17:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:17:02,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:02,166 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:02,166 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:02,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:02,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1911112886, now seen corresponding path program 23 times [2019-09-07 10:17:02,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:02,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:02,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:02,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:02,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 10:17:02,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:02,465 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:17:02,476 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:18:20,742 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-07 10:18:20,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:20,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:18:20,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 10:18:20,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:20,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:18:20,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:18:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:18:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:18:20,837 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 27 states. [2019-09-07 10:18:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:21,022 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2019-09-07 10:18:21,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:18:21,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2019-09-07 10:18:21,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:21,028 INFO L225 Difference]: With dead ends: 177 [2019-09-07 10:18:21,028 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 10:18:21,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 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:18:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 10:18:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-09-07 10:18:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 10:18:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-07 10:18:21,033 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 107 [2019-09-07 10:18:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:21,033 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-07 10:18:21,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:18:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-07 10:18:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:18:21,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:21,034 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:21,035 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash 538518982, now seen corresponding path program 24 times [2019-09-07 10:18:21,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:21,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:21,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:21,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:18:21,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 10:18:21,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:21,470 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) [2019-09-07 10:18:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:20:10,091 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 10:20:10,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:10,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:20:10,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 10:20:10,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:10,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:20:10,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:20:10,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:20:10,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:20:10,179 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 28 states. [2019-09-07 10:20:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:10,340 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2019-09-07 10:20:10,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:20:10,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2019-09-07 10:20:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:10,342 INFO L225 Difference]: With dead ends: 183 [2019-09-07 10:20:10,342 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 10:20:10,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:20:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 10:20:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-09-07 10:20:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 10:20:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-09-07 10:20:10,348 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 111 [2019-09-07 10:20:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:10,348 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-09-07 10:20:10,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:20:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-09-07 10:20:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 10:20:10,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:10,349 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:10,350 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:10,350 INFO L82 PathProgramCache]: Analyzing trace with hash 93250114, now seen corresponding path program 25 times [2019-09-07 10:20:10,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:10,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:10,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 10:20:10,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:10,857 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) [2019-09-07 10:20:10,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:20:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:10,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:20:10,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 10:20:10,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:10,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:20:10,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:20:10,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:20:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:20:10,991 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 29 states. [2019-09-07 10:20:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:11,257 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2019-09-07 10:20:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:20:11,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2019-09-07 10:20:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:11,259 INFO L225 Difference]: With dead ends: 189 [2019-09-07 10:20:11,259 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 10:20:11,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:20:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 10:20:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-09-07 10:20:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 10:20:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-07 10:20:11,269 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 115 [2019-09-07 10:20:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:11,269 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-07 10:20:11,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:20:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-07 10:20:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 10:20:11,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:11,271 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:11,272 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1795354814, now seen corresponding path program 26 times [2019-09-07 10:20:11,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:11,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:11,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:20:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 10:20:11,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:11,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:20:11,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:20:11,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:20:11,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:11,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:20:11,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 10:20:11,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:11,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:20:11,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:20:11,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:20:11,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:20:11,931 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 30 states. [2019-09-07 10:20:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:12,168 INFO L93 Difference]: Finished difference Result 195 states and 200 transitions. [2019-09-07 10:20:12,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:20:12,169 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2019-09-07 10:20:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:12,170 INFO L225 Difference]: With dead ends: 195 [2019-09-07 10:20:12,170 INFO L226 Difference]: Without dead ends: 130 [2019-09-07 10:20:12,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:20:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-07 10:20:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-09-07 10:20:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 10:20:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-09-07 10:20:12,179 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 119 [2019-09-07 10:20:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:12,180 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-09-07 10:20:12,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:20:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-09-07 10:20:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 10:20:12,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:12,182 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:12,182 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1367322310, now seen corresponding path program 27 times [2019-09-07 10:20:12,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:12,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:12,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:12,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:12,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 10:20:12,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:12,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:20:12,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:21:40,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-07 10:21:40,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:41,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:21:41,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 10:21:41,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:41,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:21:41,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:21:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:21:41,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:21:41,058 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 31 states. [2019-09-07 10:21:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:41,252 INFO L93 Difference]: Finished difference Result 201 states and 206 transitions. [2019-09-07 10:21:41,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:21:41,252 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2019-09-07 10:21:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:41,253 INFO L225 Difference]: With dead ends: 201 [2019-09-07 10:21:41,253 INFO L226 Difference]: Without dead ends: 134 [2019-09-07 10:21:41,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:21:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-07 10:21:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-09-07 10:21:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-07 10:21:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2019-09-07 10:21:41,264 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 123 [2019-09-07 10:21:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:41,264 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2019-09-07 10:21:41,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:21:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2019-09-07 10:21:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 10:21:41,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:41,266 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:41,266 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -544078922, now seen corresponding path program 28 times [2019-09-07 10:21:41,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:41,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:41,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 10:21:41,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:41,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:21:41,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:41,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:21:41,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:41,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:21:41,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 10:21:41,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:41,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:21:41,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:21:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:21:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:21:41,873 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 32 states. [2019-09-07 10:21:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:42,084 INFO L93 Difference]: Finished difference Result 207 states and 212 transitions. [2019-09-07 10:21:42,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:21:42,085 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-07 10:21:42,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:42,086 INFO L225 Difference]: With dead ends: 207 [2019-09-07 10:21:42,087 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 10:21:42,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:21:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 10:21:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-07 10:21:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-07 10:21:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-09-07 10:21:42,092 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 127 [2019-09-07 10:21:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:42,093 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-09-07 10:21:42,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:21:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-09-07 10:21:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:21:42,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:42,094 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:42,094 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:42,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1061357618, now seen corresponding path program 29 times [2019-09-07 10:21:42,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:42,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:42,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:42,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 10:21:42,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:42,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:21:42,783 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:23:57,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-07 10:23:57,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:23:57,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:23:57,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:23:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 10:23:57,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:23:57,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:23:57,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:23:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:23:57,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:23:57,203 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 33 states. [2019-09-07 10:23:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:23:57,448 INFO L93 Difference]: Finished difference Result 213 states and 218 transitions. [2019-09-07 10:23:57,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:23:57,449 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2019-09-07 10:23:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:23:57,450 INFO L225 Difference]: With dead ends: 213 [2019-09-07 10:23:57,451 INFO L226 Difference]: Without dead ends: 142 [2019-09-07 10:23:57,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:23:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-07 10:23:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-09-07 10:23:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-07 10:23:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-09-07 10:23:57,466 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 131 [2019-09-07 10:23:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:23:57,467 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-09-07 10:23:57,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:23:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-09-07 10:23:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 10:23:57,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:23:57,470 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:23:57,471 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:23:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:23:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1071751506, now seen corresponding path program 30 times [2019-09-07 10:23:57,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:23:57,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:23:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:57,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:23:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:23:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 10:23:58,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:23:58,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:23:58,259 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:54,455 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 10:26:54,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:54,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:26:54,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 10:26:54,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:54,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:26:54,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:26:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:26:54,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:26:54,560 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 34 states. [2019-09-07 10:26:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:54,746 INFO L93 Difference]: Finished difference Result 219 states and 224 transitions. [2019-09-07 10:26:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:26:54,747 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-09-07 10:26:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:54,748 INFO L225 Difference]: With dead ends: 219 [2019-09-07 10:26:54,748 INFO L226 Difference]: Without dead ends: 146 [2019-09-07 10:26:54,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:26:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-07 10:26:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-09-07 10:26:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-07 10:26:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-09-07 10:26:54,754 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 135 [2019-09-07 10:26:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:54,755 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-09-07 10:26:54,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:26:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-09-07 10:26:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 10:26:54,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:54,756 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:54,756 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2043738326, now seen corresponding path program 31 times [2019-09-07 10:26:54,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:54,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:54,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 10:26:55,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:55,318 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:55,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:26:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:55,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:26:55,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 10:26:55,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:55,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:26:55,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:26:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:26:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:26:55,432 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 35 states. [2019-09-07 10:26:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:55,673 INFO L93 Difference]: Finished difference Result 225 states and 230 transitions. [2019-09-07 10:26:55,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:26:55,674 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2019-09-07 10:26:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:55,675 INFO L225 Difference]: With dead ends: 225 [2019-09-07 10:26:55,675 INFO L226 Difference]: Without dead ends: 150 [2019-09-07 10:26:55,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:26:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-07 10:26:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-07 10:26:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-07 10:26:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-09-07 10:26:55,681 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 139 [2019-09-07 10:26:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:55,681 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-09-07 10:26:55,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:26:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-09-07 10:26:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 10:26:55,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:55,683 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:55,683 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1728053670, now seen corresponding path program 32 times [2019-09-07 10:26:55,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:55,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:55,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:55,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:26:55,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 10:26:56,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:56,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:56,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:26:56,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:26:56,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:56,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:26:56,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 10:26:56,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:56,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:26:56,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:26:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:26:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:26:56,441 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 36 states. [2019-09-07 10:26:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:56,706 INFO L93 Difference]: Finished difference Result 231 states and 236 transitions. [2019-09-07 10:26:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:26:56,707 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2019-09-07 10:26:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:56,708 INFO L225 Difference]: With dead ends: 231 [2019-09-07 10:26:56,708 INFO L226 Difference]: Without dead ends: 154 [2019-09-07 10:26:56,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:26:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-07 10:26:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-09-07 10:26:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 10:26:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2019-09-07 10:26:56,715 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 143 [2019-09-07 10:26:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:56,716 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2019-09-07 10:26:56,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:26:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2019-09-07 10:26:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 10:26:56,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:56,717 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:56,718 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1771851298, now seen corresponding path program 33 times [2019-09-07 10:26:56,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:56,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:56,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-07 10:26:57,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:57,255 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:26:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:29:44,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-07 10:29:44,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:44,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:29:44,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-07 10:29:44,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 10:29:44,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:29:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:29:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:29:44,291 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 37 states. [2019-09-07 10:29:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:44,581 INFO L93 Difference]: Finished difference Result 237 states and 242 transitions. [2019-09-07 10:29:44,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:29:44,582 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2019-09-07 10:29:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:44,583 INFO L225 Difference]: With dead ends: 237 [2019-09-07 10:29:44,583 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 10:29:44,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:29:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 10:29:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-09-07 10:29:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-07 10:29:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2019-09-07 10:29:44,592 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 147 [2019-09-07 10:29:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:44,593 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2019-09-07 10:29:44,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:29:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2019-09-07 10:29:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 10:29:44,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:44,595 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:44,595 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1183771806, now seen corresponding path program 34 times [2019-09-07 10:29:44,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:44,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:44,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 10:29:45,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:45,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:45,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:29:45,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:29:45,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:45,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:29:45,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 10:29:45,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:45,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:29:45,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:29:45,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:29:45,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:29:45,639 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 38 states. [2019-09-07 10:29:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:46,026 INFO L93 Difference]: Finished difference Result 243 states and 248 transitions. [2019-09-07 10:29:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:29:46,027 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2019-09-07 10:29:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:46,029 INFO L225 Difference]: With dead ends: 243 [2019-09-07 10:29:46,029 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 10:29:46,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:29:46,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 10:29:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-07 10:29:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-07 10:29:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2019-09-07 10:29:46,038 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 151 [2019-09-07 10:29:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:46,039 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2019-09-07 10:29:46,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:29:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2019-09-07 10:29:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 10:29:46,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:46,043 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:46,043 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:46,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash -404562662, now seen corresponding path program 35 times [2019-09-07 10:29:46,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:46,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:46,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 10:29:47,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:47,170 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:29:47,194 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1