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-crafted/mapsum4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:00:45,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:00:45,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:00:45,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:00:45,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:00:45,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:00:45,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:00:45,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:00:45,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:00:45,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:00:45,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:00:45,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:00:45,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:00:45,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:00:45,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:00:45,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:00:45,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:00:45,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:00:45,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:00:45,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:00:45,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:00:45,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:00:45,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:00:45,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:00:45,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:00:45,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:00:45,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:00:45,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:00:45,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:00:45,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:00:45,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:00:45,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:00:45,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:00:45,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:00:45,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:00:45,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:00:45,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:00:45,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:00:45,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:00:45,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:00:45,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:00:45,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:00:45,751 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:00:45,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:00:45,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:00:45,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:00:45,753 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:00:45,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:00:45,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:00:45,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:00:45,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:00:45,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:00:45,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:00:45,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:00:45,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:00:45,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:00:45,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:00:45,757 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:00:45,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:00:45,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:00:45,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:00:45,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:00:45,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:00:45,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:45,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:00:45,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:00:45,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:00:45,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:00:45,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:00:45,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:00:45,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:00:45,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:00:45,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:00:45,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:00:45,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:00:45,839 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:00:45,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum4.i [2019-10-01 22:00:45,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e3be50c/03db956a8d6a4f3b819dcb5a5e46f596/FLAG5a6dc892e [2019-10-01 22:00:46,352 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:00:46,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum4.i [2019-10-01 22:00:46,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e3be50c/03db956a8d6a4f3b819dcb5a5e46f596/FLAG5a6dc892e [2019-10-01 22:00:46,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e3be50c/03db956a8d6a4f3b819dcb5a5e46f596 [2019-10-01 22:00:46,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:00:46,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:00:46,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:46,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:00:46,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:00:46,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:46" (1/1) ... [2019-10-01 22:00:46,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45efd931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:46, skipping insertion in model container [2019-10-01 22:00:46,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:46" (1/1) ... [2019-10-01 22:00:46,737 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:00:46,754 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:00:47,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:47,026 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:00:47,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:47,177 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:00:47,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47 WrapperNode [2019-10-01 22:00:47,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:47,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:00:47,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:00:47,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:00:47,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:00:47,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:00:47,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:00:47,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:00:47,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:47,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:00:47,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:00:47,301 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-10-01 22:00:47,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:00:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:00:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:00:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-10-01 22:00:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:00:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:00:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:00:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:00:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:00:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:00:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:00:47,607 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:00:47,608 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:00:47,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:47 BoogieIcfgContainer [2019-10-01 22:00:47,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:00:47,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:00:47,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:00:47,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:00:47,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:00:46" (1/3) ... [2019-10-01 22:00:47,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acac9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:47, skipping insertion in model container [2019-10-01 22:00:47,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (2/3) ... [2019-10-01 22:00:47,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acac9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:47, skipping insertion in model container [2019-10-01 22:00:47,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:47" (3/3) ... [2019-10-01 22:00:47,617 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum4.i [2019-10-01 22:00:47,630 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:00:47,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:00:47,662 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:00:47,692 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:00:47,693 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:00:47,693 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:00:47,693 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:00:47,693 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:00:47,693 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:00:47,694 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:00:47,694 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:00:47,694 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:00:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:00:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:47,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:47,719 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:47,721 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-10-01 22:00:47,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:47,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:00:47,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:00:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:00:47,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:47,904 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:00:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:47,926 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 22:00:47,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:00:47,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 22:00:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:47,936 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:47,936 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:00:47,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:00:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:00:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:00:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 22:00:47,977 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 22:00:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:47,977 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 22:00:47,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:00:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 22:00:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:47,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:47,980 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:47,981 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-10-01 22:00:47,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:47,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:48,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:48,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:48,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,058 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 22:00:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,080 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:00:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:48,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 22:00:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,083 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:48,083 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:00:48,084 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:00:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:00:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:00:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 22:00:48,092 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 22:00:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,093 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 22:00:48,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 22:00:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:00:48,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,095 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,095 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-10-01 22:00:48,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:00:48,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,193 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:00:48,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:00:48,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 22:00:48,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:00:48,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:00:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:48,325 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 22:00:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,363 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:00:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:48,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 22:00:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,367 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:48,367 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:00:48,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:00:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 22:00:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:00:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:00:48,375 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 22:00:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,376 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:00:48,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:00:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:00:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 22:00:48,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,378 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,378 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-10-01 22:00:48,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:48,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:48,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:48,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:48,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,461 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 22:00:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,483 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 22:00:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:48,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 22:00:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,488 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:00:48,488 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:00:48,489 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:00:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 22:00:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:00:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 22:00:48,501 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 22:00:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,504 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 22:00:48,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 22:00:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:00:48,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,506 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,506 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-10-01 22:00:48,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:48,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,623 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:00:48,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:00:48,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:00:48,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:48,762 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 22:00:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,799 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 22:00:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:00:48,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 22:00:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,803 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:00:48,803 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 22:00:48,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 22:00:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 22:00:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:00:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 22:00:48,811 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 22:00:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,811 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 22:00:48,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:00:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 22:00:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:00:48,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,813 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,814 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-10-01 22:00:48,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:48,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,967 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:48,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:49,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:00:49,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:00:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:00:49,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:49,097 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 22:00:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,133 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 22:00:49,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:00:49,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 22:00:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,134 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:49,135 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:00:49,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:00:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 22:00:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 22:00:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 22:00:49,142 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 22:00:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,142 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 22:00:49,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:00:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 22:00:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:00:49,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,146 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,146 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,147 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2019-10-01 22:00:49,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,267 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:49,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 22:00:49,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:00:49,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:00:49,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:49,349 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 22:00:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,411 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 22:00:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:00:49,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 22:00:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,412 INFO L225 Difference]: With dead ends: 59 [2019-10-01 22:00:49,412 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:00:49,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:00:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:00:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:00:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 22:00:49,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 22:00:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,420 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 22:00:49,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 22:00:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:00:49,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,422 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,422 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2019-10-01 22:00:49,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:49,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,523 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:49,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:49,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:49,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:00:49,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:49,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:49,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:49,650 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 22:00:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,708 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:00:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:00:49,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 22:00:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,709 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:00:49,710 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:00:49,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:00:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 22:00:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 22:00:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 22:00:49,721 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 22:00:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,722 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 22:00:49,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 22:00:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 22:00:49,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,726 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,727 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2019-10-01 22:00:49,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:49,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,860 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,884 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:49,929 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:00:49,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:49,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:00:49,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:49,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:49,991 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 22:00:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,057 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 22:00:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:50,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 22:00:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,058 INFO L225 Difference]: With dead ends: 67 [2019-10-01 22:00:50,058 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:00:50,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:00:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 22:00:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:00:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 22:00:50,065 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 22:00:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,065 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 22:00:50,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 22:00:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 22:00:50,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,067 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,067 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2019-10-01 22:00:50,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 22:00:50,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,162 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:50,234 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 22:00:50,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 22:00:50,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 22:00:50,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:50,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,275 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 22:00:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,325 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 22:00:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:50,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 22:00:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,327 INFO L225 Difference]: With dead ends: 73 [2019-10-01 22:00:50,327 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:00:50,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:00:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:00:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:00:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 22:00:50,335 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 22:00:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,335 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 22:00:50,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 22:00:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 22:00:50,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,337 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,337 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2019-10-01 22:00:50,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:50,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,468 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:50,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:00:50,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:50,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:50,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,589 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 22:00:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,641 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 22:00:50,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:00:50,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 22:00:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,643 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:00:50,643 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:00:50,643 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:00:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 22:00:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 22:00:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 22:00:50,649 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 22:00:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,650 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 22:00:50,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 22:00:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:00:50,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,651 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,652 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2019-10-01 22:00:50,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:50,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:50,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,774 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:50,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:50,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:50,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:00:50,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:00:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:00:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:50,915 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 22:00:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,963 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 22:00:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:50,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 22:00:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,966 INFO L225 Difference]: With dead ends: 78 [2019-10-01 22:00:50,966 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 22:00:50,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 22:00:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 22:00:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:00:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 22:00:50,978 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 22:00:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,981 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 22:00:50,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:00:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 22:00:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:00:50,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,982 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,982 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2019-10-01 22:00:50,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:51,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,140 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:51,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:00:51,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:51,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:51,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 22:00:51,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:00:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:00:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:51,261 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 22:00:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,336 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 22:00:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:00:51,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:00:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,338 INFO L225 Difference]: With dead ends: 83 [2019-10-01 22:00:51,338 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:00:51,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:00:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 22:00:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 22:00:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 22:00:51,347 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 22:00:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,348 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 22:00:51,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:00:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 22:00:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 22:00:51,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,349 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:51,349 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2019-10-01 22:00:51,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 22:00:51,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,485 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:51,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:51,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:51,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 22:00:51,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 22:00:51,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:51,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:51,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:51,631 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 22:00:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,714 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 22:00:51,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:51,718 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 22:00:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,719 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:00:51,719 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:00:51,721 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:00:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 22:00:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:00:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 22:00:51,734 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 22:00:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,734 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 22:00:51,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 22:00:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:00:51,735 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,736 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:51,736 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2019-10-01 22:00:51,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:00:51,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,888 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:51,924 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:52,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:00:52,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-01 22:00:52,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 22:00:52,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:52,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:52,307 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 22:00:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,393 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 22:00:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:52,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 22:00:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,395 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:00:52,395 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 22:00:52,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 22:00:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 22:00:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:00:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 22:00:52,402 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 22:00:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,402 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 22:00:52,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 22:00:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:00:52,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,404 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:52,404 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2019-10-01 22:00:52,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 22:00:52,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,568 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:52,616 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:52,921 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 22:00:52,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 22:00:52,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 22:00:52,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:53,000 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 22:00:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,105 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 22:00:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:53,105 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:00:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,106 INFO L225 Difference]: With dead ends: 101 [2019-10-01 22:00:53,106 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:00:53,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:00:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:00:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:00:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 22:00:53,122 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 22:00:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,122 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 22:00:53,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 22:00:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 22:00:53,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,126 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:53,126 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2019-10-01 22:00:53,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:53,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,327 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:53,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:00:53,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:53,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:53,447 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 22:00:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,522 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 22:00:53,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:00:53,523 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 22:00:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,524 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:00:53,524 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 22:00:53,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 22:00:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 22:00:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 22:00:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 22:00:53,531 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 22:00:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,531 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 22:00:53,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 22:00:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 22:00:53,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,533 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:53,534 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,534 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2019-10-01 22:00:53,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:53,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:53,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,788 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:53,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:53,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:53,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:00:53,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:00:53,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:00:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:00:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:53,988 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 22:00:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,039 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 22:00:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:54,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 22:00:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,041 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:00:54,041 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:00:54,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:00:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 22:00:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:00:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 22:00:54,046 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 22:00:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,046 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 22:00:54,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:00:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 22:00:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 22:00:54,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,048 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:54,048 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2019-10-01 22:00:54,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:54,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,295 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:54,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:54,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:00:54,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 22:00:54,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 22:00:54,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:54,495 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 22:00:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,618 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 22:00:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:00:54,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 22:00:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,619 INFO L225 Difference]: With dead ends: 111 [2019-10-01 22:00:54,620 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 22:00:54,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 22:00:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 22:00:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:00:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 22:00:54,625 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 22:00:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,625 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 22:00:54,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 22:00:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:00:54,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,628 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:54,628 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2019-10-01 22:00:54,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 22:00:54,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,857 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:54,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:54,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:54,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:00:54,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:00:54,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:00:54,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:54,986 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 22:00:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,046 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 22:00:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:55,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 22:00:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,047 INFO L225 Difference]: With dead ends: 114 [2019-10-01 22:00:55,047 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:00:55,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:00:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 22:00:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:00:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 22:00:55,052 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 22:00:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,052 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 22:00:55,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:00:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 22:00:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 22:00:55,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,053 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:55,054 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2019-10-01 22:00:55,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:55,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 22:00:55,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,300 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:55,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:55,844 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:00:55,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:55,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-01 22:00:55,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 22:00:55,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:00:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:00:55,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:55,978 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 22:00:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:56,093 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 22:00:56,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:00:56,094 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 22:00:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:56,095 INFO L225 Difference]: With dead ends: 119 [2019-10-01 22:00:56,095 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 22:00:56,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 22:00:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 22:00:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 22:00:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 22:00:56,100 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 22:00:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:56,100 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 22:00:56,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:00:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 22:00:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 22:00:56,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:56,102 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:56,103 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2019-10-01 22:00:56,103 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:56,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:56,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 22:00:56,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:56,372 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:56,396 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:56,622 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:00:56,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:56,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 22:00:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 22:00:56,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:00:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:00:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:56,752 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 22:00:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:56,869 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 22:00:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:00:56,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 22:00:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:56,870 INFO L225 Difference]: With dead ends: 125 [2019-10-01 22:00:56,871 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 22:00:56,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 22:00:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 22:00:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 22:00:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 22:00:56,877 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 22:00:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:56,877 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 22:00:56,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:00:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 22:00:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 22:00:56,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:56,879 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:56,879 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2019-10-01 22:00:56,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:56,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:56,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:57,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,166 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:57,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:00:57,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:57,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:57,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:00:57,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:00:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:00:57,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:00:57,303 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 22:00:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,367 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 22:00:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:00:57,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 22:00:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,369 INFO L225 Difference]: With dead ends: 128 [2019-10-01 22:00:57,369 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:00:57,369 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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-10-01 22:00:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:00:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 22:00:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:00:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 22:00:57,373 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 22:00:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,374 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 22:00:57,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:00:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 22:00:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 22:00:57,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,375 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:57,376 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2019-10-01 22:00:57,376 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:57,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:57,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,666 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:57,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:57,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:57,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:57,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:00:57,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:57,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:57,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:00:57,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:57,796 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 22:00:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,864 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 22:00:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:00:57,864 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 22:00:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,865 INFO L225 Difference]: With dead ends: 130 [2019-10-01 22:00:57,865 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 22:00:57,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 22:00:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 22:00:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 22:00:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 22:00:57,870 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 22:00:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,870 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 22:00:57,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 22:00:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:00:57,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,872 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:57,873 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2019-10-01 22:00:57,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:57,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:58,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:58,264 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:58,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:58,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:00:58,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:58,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:00:58,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-01 22:00:58,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:58,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 22:00:58,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:00:58,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:00:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:00:58,467 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 22:00:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:58,600 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 22:00:58,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:00:58,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 22:00:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:58,601 INFO L225 Difference]: With dead ends: 135 [2019-10-01 22:00:58,602 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 22:00:58,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:00:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 22:00:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 22:00:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:00:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 22:00:58,607 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 22:00:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:58,607 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 22:00:58,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:00:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 22:00:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 22:00:58,609 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:58,609 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:58,609 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2019-10-01 22:00:58,610 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:58,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:58,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:58,945 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:58,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:59,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:59,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:59,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:00:59,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:59,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:59,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:00:59,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:00:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:00:59,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:59,078 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 22:00:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:59,164 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 22:00:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:00:59,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 22:00:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:59,165 INFO L225 Difference]: With dead ends: 138 [2019-10-01 22:00:59,165 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:00:59,166 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:00:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 22:00:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:00:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 22:00:59,170 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 22:00:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:59,170 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 22:00:59,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:00:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 22:00:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 22:00:59,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:59,172 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:59,172 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2019-10-01 22:00:59,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:59,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:59,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:59,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:59,560 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:59,604 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:01,396 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 22:01:01,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:01,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:01,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-01 22:01:01,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:01,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 22:01:01,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:01:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:01:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:01,548 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-01 22:01:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:01,702 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 22:01:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:01,705 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-01 22:01:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:01,706 INFO L225 Difference]: With dead ends: 143 [2019-10-01 22:01:01,706 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 22:01:01,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 22:01:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 22:01:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 22:01:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 22:01:01,713 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 22:01:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:01,713 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 22:01:01,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:01:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 22:01:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 22:01:01,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:01,714 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:01,715 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2019-10-01 22:01:01,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:01,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:01,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:01:02,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:02,094 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:02,124 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:02,933 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 22:01:02,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:02,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:01:02,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-10-01 22:01:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-01 22:01:03,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:01:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:01:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:03,051 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-01 22:01:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:03,169 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-01 22:01:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:03,169 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-01 22:01:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:03,170 INFO L225 Difference]: With dead ends: 149 [2019-10-01 22:01:03,170 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 22:01:03,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 22:01:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-01 22:01:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 22:01:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-01 22:01:03,179 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-01 22:01:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:03,179 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-01 22:01:03,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:01:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-01 22:01:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 22:01:03,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:03,181 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:03,181 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2019-10-01 22:01:03,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:03,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:03,552 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:03,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:03,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:01:03,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:03,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:03,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:01:03,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:01:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:01:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:01:03,687 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-01 22:01:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:03,771 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 22:01:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:01:03,771 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-01 22:01:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:03,772 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:01:03,773 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 22:01:03,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:01:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 22:01:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 22:01:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 22:01:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 22:01:03,778 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-01 22:01:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:03,778 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 22:01:03,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:01:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 22:01:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 22:01:03,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:03,779 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:03,779 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2019-10-01 22:01:03,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:03,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:04,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:04,339 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:04,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:04,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:04,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:04,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:01:04,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:04,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:04,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:01:04,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:01:04,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:01:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:04,485 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 22:01:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:04,561 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 22:01:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:01:04,563 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 22:01:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:04,564 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:01:04,564 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 22:01:04,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 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-10-01 22:01:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 22:01:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 22:01:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:01:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 22:01:04,570 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 22:01:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:04,570 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 22:01:04,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:01:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 22:01:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 22:01:04,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:04,572 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:04,572 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2019-10-01 22:01:04,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:04,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:05,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:05,032 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:05,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:05,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:01:05,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:05,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:05,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2019-10-01 22:01:05,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:05,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-01 22:01:05,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:01:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:01:05,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:01:05,362 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-01 22:01:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:05,542 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-01 22:01:05,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:01:05,544 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-01 22:01:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:05,546 INFO L225 Difference]: With dead ends: 159 [2019-10-01 22:01:05,546 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 22:01:05,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:01:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 22:01:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-01 22:01:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 22:01:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-01 22:01:05,551 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-01 22:01:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:05,552 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-01 22:01:05,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:01:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-01 22:01:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 22:01:05,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:05,553 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:05,553 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2019-10-01 22:01:05,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:05,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:05,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 22:01:06,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:06,142 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:06,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:06,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:06,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:06,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:06,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-01 22:01:06,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:06,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-01 22:01:06,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:01:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:01:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:01:06,495 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-01 22:01:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:06,623 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-01 22:01:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:01:06,624 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-01 22:01:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:06,626 INFO L225 Difference]: With dead ends: 165 [2019-10-01 22:01:06,627 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 22:01:06,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:01:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 22:01:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 22:01:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 22:01:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-01 22:01:06,636 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-01 22:01:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:06,636 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-01 22:01:06,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:01:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-01 22:01:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 22:01:06,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:06,638 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:06,638 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:06,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2019-10-01 22:01:06,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:06,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 22:01:07,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:07,213 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:07,260 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:21,230 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 22:01:21,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:21,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:21,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-01 22:01:21,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:21,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 22:01:21,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:01:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:01:21,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:21,550 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-01 22:01:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:21,756 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-01 22:01:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:01:21,757 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-01 22:01:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:21,758 INFO L225 Difference]: With dead ends: 171 [2019-10-01 22:01:21,758 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 22:01:21,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 22:01:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-01 22:01:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 22:01:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-01 22:01:21,767 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-01 22:01:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:21,767 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-01 22:01:21,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:01:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-01 22:01:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 22:01:21,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:21,770 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:21,770 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2019-10-01 22:01:21,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:21,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:21,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 22:01:22,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:22,385 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:22,427 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:26,430 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:01:26,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:26,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:01:26,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-01 22:01:26,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:26,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-01 22:01:26,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:01:26,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:01:26,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:26,651 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-01 22:01:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:26,853 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-01 22:01:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:01:26,853 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-01 22:01:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:26,854 INFO L225 Difference]: With dead ends: 177 [2019-10-01 22:01:26,854 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 22:01:26,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 22:01:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-01 22:01:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 22:01:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 22:01:26,860 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-01 22:01:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:26,861 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 22:01:26,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:01:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 22:01:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 22:01:26,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:26,862 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:26,862 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:26,863 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2019-10-01 22:01:26,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:26,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:26,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:26,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:26,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:27,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:27,410 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:27,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:27,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:01:27,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:27,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:27,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:01:27,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:01:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:01:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:27,593 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-01 22:01:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:27,736 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-01 22:01:27,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:27,737 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-01 22:01:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:27,740 INFO L225 Difference]: With dead ends: 180 [2019-10-01 22:01:27,740 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 22:01:27,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 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-10-01 22:01:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 22:01:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 22:01:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:01:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 22:01:27,750 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-01 22:01:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:27,750 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 22:01:27,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:01:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 22:01:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 22:01:27,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:27,752 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:27,753 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2019-10-01 22:01:27,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:27,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:27,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:28,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:28,299 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:28,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:28,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:28,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:01:28,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:01:28,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:01:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:01:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:28,499 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 22:01:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:28,620 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 22:01:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:28,622 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 22:01:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:28,623 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:01:28,623 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 22:01:28,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 22:01:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 22:01:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 22:01:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 22:01:28,629 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 22:01:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:28,629 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 22:01:28,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:01:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 22:01:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:01:28,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:28,631 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:28,631 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2019-10-01 22:01:28,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:28,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:28,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:29,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:29,225 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:29,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:29,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 22:01:29,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:29,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:29,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2019-10-01 22:01:29,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:29,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-01 22:01:29,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:01:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:01:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:01:29,659 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-01 22:01:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:29,848 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-01 22:01:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:01:29,849 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-01 22:01:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:29,850 INFO L225 Difference]: With dead ends: 187 [2019-10-01 22:01:29,850 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 22:01:29,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:01:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 22:01:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-01 22:01:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 22:01:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-01 22:01:29,855 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-01 22:01:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:29,855 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-01 22:01:29,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:01:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-01 22:01:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 22:01:29,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:29,857 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:29,857 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2019-10-01 22:01:29,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:29,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:29,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-10-01 22:01:30,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:30,941 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:30,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:31,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:31,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:31,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:01:31,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-01 22:01:31,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:31,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 22:01:31,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:01:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:01:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:31,395 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-01 22:01:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:31,661 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-01 22:01:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:01:31,661 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-01 22:01:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:31,663 INFO L225 Difference]: With dead ends: 193 [2019-10-01 22:01:31,663 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 22:01:31,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 22:01:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 22:01:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 22:01:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-01 22:01:31,677 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-01 22:01:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:31,678 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-01 22:01:31,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:01:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-01 22:01:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 22:01:31,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:31,689 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:31,689 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2019-10-01 22:01:31,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:31,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:31,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:31,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:31,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-10-01 22:01:32,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:32,519 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:32,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:02:27,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 22:02:27,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:27,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:02:27,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-10-01 22:02:27,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:27,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-01 22:02:27,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:02:27,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:02:27,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:02:27,779 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-01 22:02:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:27,994 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-01 22:02:27,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:02:27,995 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-01 22:02:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:27,997 INFO L225 Difference]: With dead ends: 199 [2019-10-01 22:02:27,997 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 22:02:27,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:02:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 22:02:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-01 22:02:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 22:02:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-01 22:02:28,005 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-01 22:02:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:28,005 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-01 22:02:28,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:02:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-01 22:02:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 22:02:28,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:28,009 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:28,009 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:28,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2019-10-01 22:02:28,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:28,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-10-01 22:02:28,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:28,846 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:28,898 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:02:37,164 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 22:02:37,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:37,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:02:37,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-10-01 22:02:37,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:37,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 22:02:37,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:02:37,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:02:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:02:37,431 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-01 22:02:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:37,670 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-01 22:02:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:02:37,671 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-01 22:02:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:37,673 INFO L225 Difference]: With dead ends: 205 [2019-10-01 22:02:37,673 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 22:02:37,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:02:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 22:02:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-01 22:02:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 22:02:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-01 22:02:37,681 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-01 22:02:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:37,681 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-01 22:02:37,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:02:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-01 22:02:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 22:02:37,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:37,683 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:37,683 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:37,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2019-10-01 22:02:37,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:37,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:37,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:38,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:38,407 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:38,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:38,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:02:38,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:02:38,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:38,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:02:38,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:02:38,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:02:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:02:38,608 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-01 22:02:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:38,728 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-01 22:02:38,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:02:38,729 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-01 22:02:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:38,730 INFO L225 Difference]: With dead ends: 208 [2019-10-01 22:02:38,730 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 22:02:38,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:02:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 22:02:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 22:02:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 22:02:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 22:02:38,735 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-01 22:02:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:38,735 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 22:02:38,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:02:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 22:02:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 22:02:38,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:38,737 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:38,737 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2019-10-01 22:02:38,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:38,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:38,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:39,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:39,535 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:39,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:02:39,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:02:39,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:39,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:02:39,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:39,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:39,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:02:39,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:02:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:02:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:39,740 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 22:02:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:39,892 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 22:02:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:02:39,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-01 22:02:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:39,893 INFO L225 Difference]: With dead ends: 210 [2019-10-01 22:02:39,893 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:02:39,894 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:02:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 22:02:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 22:02:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 22:02:39,898 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-01 22:02:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:39,898 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 22:02:39,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:02:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 22:02:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 22:02:39,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:39,900 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:39,900 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2019-10-01 22:02:39,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:39,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:40,747 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:40,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:02:41,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 22:02:41,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:41,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:02:41,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2019-10-01 22:02:41,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:41,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 22:02:41,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:02:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:02:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:02:41,355 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-01 22:02:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:41,562 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2019-10-01 22:02:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:02:41,566 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-01 22:02:41,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:41,568 INFO L225 Difference]: With dead ends: 215 [2019-10-01 22:02:41,568 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 22:02:41,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:02:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 22:02:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-01 22:02:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 22:02:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-01 22:02:41,573 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-01 22:02:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:41,574 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-01 22:02:41,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:02:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-01 22:02:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 22:02:41,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:41,575 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:41,576 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2019-10-01 22:02:41,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:41,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:41,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:42,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:42,566 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:42,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:02:42,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:02:42,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:42,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 22:02:42,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:42,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:42,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 22:02:42,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:02:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:02:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:02:42,811 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2019-10-01 22:02:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:42,935 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2019-10-01 22:02:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:02:42,935 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2019-10-01 22:02:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:42,936 INFO L225 Difference]: With dead ends: 218 [2019-10-01 22:02:42,936 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 22:02:42,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:02:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 22:02:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-01 22:02:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 22:02:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 22:02:42,944 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-01 22:02:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:42,945 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 22:02:42,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:02:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 22:02:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 22:02:42,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:42,946 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:42,946 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2019-10-01 22:02:42,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:42,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:42,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:43,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:43,680 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:43,742 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:03:54,495 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 22:03:54,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:54,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:03:54,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2515 trivial. 0 not checked. [2019-10-01 22:03:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 16] total 58 [2019-10-01 22:03:54,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:03:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:03:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:54,878 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 58 states. [2019-10-01 22:03:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:55,095 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2019-10-01 22:03:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:03:55,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-10-01 22:03:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:55,097 INFO L225 Difference]: With dead ends: 223 [2019-10-01 22:03:55,097 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 22:03:55,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 22:03:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 22:03:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 22:03:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-01 22:03:55,102 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 214 [2019-10-01 22:03:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:55,103 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-01 22:03:55,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:03:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-01 22:03:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 22:03:55,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:55,104 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:55,104 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1200258067, now seen corresponding path program 42 times [2019-10-01 22:03:55,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:55,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:55,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 22:03:55,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:55,905 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:55,971 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:04:05,023 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:04:05,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:04:05,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:04:05,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:04:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2777 trivial. 0 not checked. [2019-10-01 22:04:05,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:04:05,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 14] total 57 [2019-10-01 22:04:05,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:04:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:04:05,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:04:05,386 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 57 states. [2019-10-01 22:04:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:04:05,564 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2019-10-01 22:04:05,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 22:04:05,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2019-10-01 22:04:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:04:05,566 INFO L225 Difference]: With dead ends: 229 [2019-10-01 22:04:05,566 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 22:04:05,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:04:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 22:04:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-01 22:04:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 22:04:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-01 22:04:05,572 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 222 [2019-10-01 22:04:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:04:05,572 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-01 22:04:05,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:04:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-01 22:04:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-01 22:04:05,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:04:05,574 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:04:05,574 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:04:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:04:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 320829261, now seen corresponding path program 43 times [2019-10-01 22:04:05,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:04:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:04:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:05,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:04:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:04:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:04:06,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:04:06,441 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:04:06,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:04:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:04:06,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:04:06,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:04:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:04:06,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:04:06,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 22:04:06,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:04:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:04:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:04:06,674 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 47 states. [2019-10-01 22:04:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:04:06,812 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2019-10-01 22:04:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:04:06,812 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 226 [2019-10-01 22:04:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:04:06,813 INFO L225 Difference]: With dead ends: 232 [2019-10-01 22:04:06,813 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 22:04:06,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:04:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 22:04:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-01 22:04:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 22:04:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 22:04:06,820 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 226 [2019-10-01 22:04:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:04:06,821 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 22:04:06,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:04:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 22:04:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 22:04:06,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:04:06,822 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:04:06,822 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:04:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:04:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1514417361, now seen corresponding path program 44 times [2019-10-01 22:04:06,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:04:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:04:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:04:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:04:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:04:07,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:04:07,673 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:04:07,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:04:07,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:04:07,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:04:07,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:04:07,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:04:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:04:07,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:04:07,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:04:07,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:04:07,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:04:07,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:04:07,915 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 22:04:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:04:08,071 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 22:04:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:04:08,071 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 22:04:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:04:08,072 INFO L225 Difference]: With dead ends: 234 [2019-10-01 22:04:08,072 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 22:04:08,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:04:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 22:04:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 22:04:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 22:04:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 22:04:08,078 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 22:04:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:04:08,078 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 22:04:08,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:04:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 22:04:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 22:04:08,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:04:08,080 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:04:08,080 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:04:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:04:08,080 INFO L82 PathProgramCache]: Analyzing trace with hash 45137553, now seen corresponding path program 45 times [2019-10-01 22:04:08,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:04:08,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:04:08,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:08,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:04:08,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:04:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:04:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:04:08,982 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:04:09,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:04:09,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:04:09,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:04:09,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:04:09,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:04:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 939 proven. 144 refuted. 0 times theorem prover too weak. 2949 trivial. 0 not checked. [2019-10-01 22:04:09,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:04:09,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 17] total 63 [2019-10-01 22:04:09,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-01 22:04:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-01 22:04:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=2577, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 22:04:09,916 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 63 states. [2019-10-01 22:04:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:04:10,605 INFO L93 Difference]: Finished difference Result 240 states and 250 transitions. [2019-10-01 22:04:10,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-01 22:04:10,605 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 230 [2019-10-01 22:04:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:04:10,607 INFO L225 Difference]: With dead ends: 240 [2019-10-01 22:04:10,607 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 22:04:10,608 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1537, Invalid=4163, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 22:04:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 22:04:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 22:04:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 22:04:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 22:04:10,615 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 230 [2019-10-01 22:04:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:04:10,616 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 22:04:10,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-01 22:04:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 22:04:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 22:04:10,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:04:10,619 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:04:10,620 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:04:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:04:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash -847744813, now seen corresponding path program 46 times [2019-10-01 22:04:10,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:04:10,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:04:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:10,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:04:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:04:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:04:11,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:04:11,858 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:04:11,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:04:12,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:04:12,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:04:12,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 22:04:12,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:04:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:04:12,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:04:12,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 22:04:12,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:04:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:04:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:04:12,110 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 51 states. [2019-10-01 22:04:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:04:12,275 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2019-10-01 22:04:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:04:12,275 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 236 [2019-10-01 22:04:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:04:12,277 INFO L225 Difference]: With dead ends: 244 [2019-10-01 22:04:12,277 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 22:04:12,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:04:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 22:04:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 22:04:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 22:04:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-10-01 22:04:12,283 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 236 [2019-10-01 22:04:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:04:12,283 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-10-01 22:04:12,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:04:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-10-01 22:04:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 22:04:12,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:04:12,285 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:04:12,285 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:04:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:04:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1971004875, now seen corresponding path program 47 times [2019-10-01 22:04:12,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:04:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:04:12,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:12,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:04:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:04:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:04:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:04:13,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:04:13,425 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:04:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:06:17,786 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 22:06:17,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:17,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:06:17,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3296 trivial. 0 not checked. [2019-10-01 22:06:18,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:18,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 17] total 66 [2019-10-01 22:06:18,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:06:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:06:18,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:06:18,358 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 66 states. [2019-10-01 22:06:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:18,687 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2019-10-01 22:06:18,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:06:18,688 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 238 [2019-10-01 22:06:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:18,689 INFO L225 Difference]: With dead ends: 249 [2019-10-01 22:06:18,689 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 22:06:18,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:06:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 22:06:18,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-01 22:06:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 22:06:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-01 22:06:18,695 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 238 [2019-10-01 22:06:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:18,695 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-01 22:06:18,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:06:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-01 22:06:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 22:06:18,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:18,697 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:18,697 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1090633579, now seen corresponding path program 48 times [2019-10-01 22:06:18,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:18,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:18,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 22:06:19,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:19,851 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:19,925 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:06:29,024 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 22:06:29,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:29,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:06:29,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3561 trivial. 0 not checked. [2019-10-01 22:06:29,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:29,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 16] total 66 [2019-10-01 22:06:29,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:06:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:06:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:06:29,604 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 66 states. [2019-10-01 22:06:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:29,924 INFO L93 Difference]: Finished difference Result 255 states and 264 transitions. [2019-10-01 22:06:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:06:29,924 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 246 [2019-10-01 22:06:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:29,925 INFO L225 Difference]: With dead ends: 255 [2019-10-01 22:06:29,926 INFO L226 Difference]: Without dead ends: 183 [2019-10-01 22:06:29,927 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:06:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-01 22:06:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-10-01 22:06:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 22:06:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 22:06:29,939 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 246 [2019-10-01 22:06:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:29,939 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 22:06:29,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:06:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 22:06:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 22:06:29,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:29,941 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:29,944 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1139151861, now seen corresponding path program 49 times [2019-10-01 22:06:29,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:29,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:29,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:29,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:31,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:31,016 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:31,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:31,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 22:06:31,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:06:31,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:31,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 22:06:31,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:06:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:06:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:06:31,275 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 22:06:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:31,489 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 22:06:31,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:06:31,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 22:06:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:31,490 INFO L225 Difference]: With dead ends: 258 [2019-10-01 22:06:31,491 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:06:31,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:06:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:06:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 22:06:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 22:06:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 22:06:31,496 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 22:06:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:31,497 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 22:06:31,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:06:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 22:06:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 22:06:31,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:31,498 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:31,499 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1601869353, now seen corresponding path program 50 times [2019-10-01 22:06:31,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:31,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:31,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:31,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:32,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:32,607 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:32,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:06:32,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:06:32,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:32,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:06:32,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:32,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:32,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 22:06:32,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:06:32,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:06:32,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:06:32,887 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 55 states. [2019-10-01 22:06:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:33,027 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 22:06:33,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:06:33,027 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 252 [2019-10-01 22:06:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:33,029 INFO L225 Difference]: With dead ends: 260 [2019-10-01 22:06:33,029 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 22:06:33,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:06:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 22:06:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-10-01 22:06:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 22:06:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-01 22:06:33,036 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 252 [2019-10-01 22:06:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:33,036 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-01 22:06:33,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:06:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-01 22:06:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 22:06:33,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:33,038 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:33,038 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:33,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:33,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1386663737, now seen corresponding path program 51 times [2019-10-01 22:06:33,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:33,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:33,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:33,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:33,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:34,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:34,229 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:06:35,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:06:35,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:35,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:06:35,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2019-10-01 22:06:35,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:35,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 17] total 70 [2019-10-01 22:06:35,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:06:35,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:06:35,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:06:35,459 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 70 states. [2019-10-01 22:06:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:35,846 INFO L93 Difference]: Finished difference Result 265 states and 274 transitions. [2019-10-01 22:06:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 22:06:35,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 254 [2019-10-01 22:06:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:35,848 INFO L225 Difference]: With dead ends: 265 [2019-10-01 22:06:35,848 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 22:06:35,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:06:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 22:06:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2019-10-01 22:06:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 22:06:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 22:06:35,854 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 254 [2019-10-01 22:06:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:35,854 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 22:06:35,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:06:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 22:06:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 22:06:35,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:35,856 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:35,856 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:35,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1192363929, now seen corresponding path program 52 times [2019-10-01 22:06:35,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:35,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:35,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:35,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:35,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:37,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:37,005 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:06:37,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:06:37,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:37,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 22:06:37,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:37,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:37,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 22:06:37,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:06:37,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:06:37,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:06:37,268 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 57 states. [2019-10-01 22:06:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:37,505 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2019-10-01 22:06:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 22:06:37,506 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 258 [2019-10-01 22:06:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:37,507 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:06:37,507 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 22:06:37,507 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:06:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 22:06:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-10-01 22:06:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 22:06:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-01 22:06:37,513 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 258 [2019-10-01 22:06:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:37,513 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-01 22:06:37,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:06:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-01 22:06:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 22:06:37,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:37,515 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:37,515 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash 838228859, now seen corresponding path program 53 times [2019-10-01 22:06:37,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:37,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:37,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:37,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:37,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:38,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:38,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:38,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:09:12,766 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-01 22:09:12,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:12,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:09:12,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-10-01 22:09:13,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:13,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 22:09:13,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:09:13,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:09:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:09:13,289 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 73 states. [2019-10-01 22:09:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:13,663 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-10-01 22:09:13,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:09:13,664 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 260 [2019-10-01 22:09:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:13,665 INFO L225 Difference]: With dead ends: 273 [2019-10-01 22:09:13,665 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 22:09:13,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:09:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 22:09:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-01 22:09:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 22:09:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-01 22:09:13,673 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 260 [2019-10-01 22:09:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:13,673 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-01 22:09:13,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:09:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-01 22:09:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 22:09:13,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:13,675 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:13,675 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1877138907, now seen corresponding path program 54 times [2019-10-01 22:09:13,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:13,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:13,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 22:09:14,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:14,921 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:15,014 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:09:26,894 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 22:09:26,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:26,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:09:26,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 1098 proven. 225 refuted. 0 times theorem prover too weak. 4342 trivial. 0 not checked. [2019-10-01 22:09:27,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:27,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 18] total 74 [2019-10-01 22:09:27,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-01 22:09:27,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-01 22:09:27,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=3597, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 22:09:27,366 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 74 states. [2019-10-01 22:09:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:27,753 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2019-10-01 22:09:27,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-01 22:09:27,754 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 268 [2019-10-01 22:09:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:27,755 INFO L225 Difference]: With dead ends: 279 [2019-10-01 22:09:27,755 INFO L226 Difference]: Without dead ends: 201 [2019-10-01 22:09:27,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1805, Invalid=3597, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 22:09:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-01 22:09:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-10-01 22:09:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 22:09:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 22:09:27,761 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 268 [2019-10-01 22:09:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:27,761 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 22:09:27,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-01 22:09:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 22:09:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 22:09:27,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:27,763 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:27,763 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -513174981, now seen corresponding path program 55 times [2019-10-01 22:09:27,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:27,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:27,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:29,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:29,058 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:29,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:29,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 22:09:29,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:29,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:29,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 22:09:29,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:09:29,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:09:29,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:09:29,332 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 60 states. [2019-10-01 22:09:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:29,548 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2019-10-01 22:09:29,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:09:29,553 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 272 [2019-10-01 22:09:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:29,555 INFO L225 Difference]: With dead ends: 282 [2019-10-01 22:09:29,555 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 22:09:29,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:09:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 22:09:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 22:09:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 22:09:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 22:09:29,561 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 272 [2019-10-01 22:09:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:29,561 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 22:09:29,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:09:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 22:09:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 22:09:29,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:29,563 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:29,563 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1685353117, now seen corresponding path program 56 times [2019-10-01 22:09:29,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:29,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:30,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:30,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:30,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:09:31,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:09:31,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:31,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 22:09:31,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:31,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 22:09:31,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:09:31,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:09:31,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:09:31,172 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 61 states. [2019-10-01 22:09:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:31,383 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-10-01 22:09:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:09:31,384 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 274 [2019-10-01 22:09:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:31,384 INFO L225 Difference]: With dead ends: 284 [2019-10-01 22:09:31,385 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 22:09:31,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:09:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 22:09:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 22:09:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 22:09:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 22:09:31,390 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 274 [2019-10-01 22:09:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:31,391 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 22:09:31,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:09:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 22:09:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 22:09:31,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:31,393 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:31,393 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1346945663, now seen corresponding path program 57 times [2019-10-01 22:09:31,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:31,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:31,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:32,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:32,755 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:32,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:09:34,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 22:09:34,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:34,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:09:34,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2019-10-01 22:09:34,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:34,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 19] total 78 [2019-10-01 22:09:34,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-01 22:09:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-01 22:09:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=4006, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 22:09:34,805 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 78 states. [2019-10-01 22:09:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:35,210 INFO L93 Difference]: Finished difference Result 289 states and 301 transitions. [2019-10-01 22:09:35,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-01 22:09:35,215 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 276 [2019-10-01 22:09:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:35,217 INFO L225 Difference]: With dead ends: 289 [2019-10-01 22:09:35,217 INFO L226 Difference]: Without dead ends: 209 [2019-10-01 22:09:35,218 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2000, Invalid=4006, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 22:09:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-01 22:09:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-10-01 22:09:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-01 22:09:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2019-10-01 22:09:35,222 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 276 [2019-10-01 22:09:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:35,223 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2019-10-01 22:09:35,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-01 22:09:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2019-10-01 22:09:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-01 22:09:35,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:35,225 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:35,225 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1886024481, now seen corresponding path program 58 times [2019-10-01 22:09:35,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:35,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:35,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6455 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 22:09:36,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:36,607 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:36,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:09:36,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:09:36,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:36,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:09:36,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6455 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 4934 trivial. 0 not checked. [2019-10-01 22:09:37,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:37,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 20] total 80 [2019-10-01 22:09:37,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 22:09:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 22:09:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 22:09:37,393 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand 80 states. [2019-10-01 22:09:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:37,783 INFO L93 Difference]: Finished difference Result 295 states and 307 transitions. [2019-10-01 22:09:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-01 22:09:37,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 284 [2019-10-01 22:09:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:37,786 INFO L225 Difference]: With dead ends: 295 [2019-10-01 22:09:37,786 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:09:37,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 22:09:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:09:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-01 22:09:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-01 22:09:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2019-10-01 22:09:37,792 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 284 [2019-10-01 22:09:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:37,792 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2019-10-01 22:09:37,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 22:09:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2019-10-01 22:09:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-01 22:09:37,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:37,794 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:37,795 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash -805548737, now seen corresponding path program 59 times [2019-10-01 22:09:37,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:37,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:37,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 22:09:39,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:39,275 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:39,384 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:12:42,811 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-10-01 22:12:42,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:12:42,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:12:42,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5199 trivial. 0 not checked. [2019-10-01 22:12:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:43,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 21] total 82 [2019-10-01 22:12:43,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:12:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:12:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2162, Invalid=4480, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:12:43,503 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 82 states. [2019-10-01 22:12:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:43,916 INFO L93 Difference]: Finished difference Result 301 states and 313 transitions. [2019-10-01 22:12:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:12:43,916 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 292 [2019-10-01 22:12:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:43,918 INFO L225 Difference]: With dead ends: 301 [2019-10-01 22:12:43,918 INFO L226 Difference]: Without dead ends: 217 [2019-10-01 22:12:43,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2162, Invalid=4480, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:12:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-01 22:12:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-01 22:12:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-01 22:12:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-10-01 22:12:43,924 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 292 [2019-10-01 22:12:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:43,924 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-10-01 22:12:43,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:12:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-10-01 22:12:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-01 22:12:43,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:43,926 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:12:43,926 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1036647521, now seen corresponding path program 60 times [2019-10-01 22:12:43,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:43,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:43,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:43,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:12:43,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7355 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 22:12:45,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:12:45,436 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:12:45,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:12:56,143 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:12:56,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:12:56,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:12:56,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7355 backedges. 1530 proven. 256 refuted. 0 times theorem prover too weak. 5569 trivial. 0 not checked. [2019-10-01 22:12:56,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:56,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 19] total 81 [2019-10-01 22:12:56,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 22:12:56,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 22:12:56,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2186, Invalid=4294, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 22:12:56,665 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 81 states. [2019-10-01 22:12:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:57,033 INFO L93 Difference]: Finished difference Result 307 states and 316 transitions. [2019-10-01 22:12:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 22:12:57,033 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 300 [2019-10-01 22:12:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:57,035 INFO L225 Difference]: With dead ends: 307 [2019-10-01 22:12:57,035 INFO L226 Difference]: Without dead ends: 221 [2019-10-01 22:12:57,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2186, Invalid=4294, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 22:12:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-01 22:12:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2019-10-01 22:12:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-01 22:12:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-10-01 22:12:57,043 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 300 [2019-10-01 22:12:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:57,043 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-10-01 22:12:57,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 22:12:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-10-01 22:12:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-01 22:12:57,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:57,045 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:12:57,045 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash -597352705, now seen corresponding path program 61 times [2019-10-01 22:12:57,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:57,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:57,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:12:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7511 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:12:58,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:12:58,639 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:12:58,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:12:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:58,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-01 22:12:58,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7511 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:12:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:59,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-10-01 22:12:59,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:12:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:12:59,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:12:59,026 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 66 states. [2019-10-01 22:12:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:59,239 INFO L93 Difference]: Finished difference Result 310 states and 318 transitions. [2019-10-01 22:12:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:12:59,240 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 304 [2019-10-01 22:12:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:59,241 INFO L225 Difference]: With dead ends: 310 [2019-10-01 22:12:59,241 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 22:12:59,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:12:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 22:12:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-10-01 22:12:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:12:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 22:12:59,248 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 304 [2019-10-01 22:12:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:59,248 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 22:12:59,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:12:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 22:12:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 22:12:59,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:59,250 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:12:59,250 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1467615391, now seen corresponding path program 62 times [2019-10-01 22:12:59,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:59,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:59,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:59,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:12:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:13:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:13:00,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:13:00,910 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:13:01,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:13:01,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:13:01,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:13:01,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 22:13:01,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:13:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:13:01,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:13:01,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 22:13:01,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 22:13:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 22:13:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:13:01,258 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 22:13:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:13:01,518 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 22:13:01,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:13:01,519 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 22:13:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:13:01,520 INFO L225 Difference]: With dead ends: 312 [2019-10-01 22:13:01,520 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:13:01,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:13:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:13:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 22:13:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 22:13:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 22:13:01,526 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 22:13:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:13:01,526 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 22:13:01,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 22:13:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 22:13:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 22:13:01,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:13:01,528 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:13:01,529 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:13:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:13:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash -271433917, now seen corresponding path program 63 times [2019-10-01 22:13:01,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:13:01,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:13:01,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:01,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:13:01,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:13:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:13:03,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:13:03,134 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:13:03,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:13:05,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:13:05,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:13:05,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:13:05,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:13:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 5944 trivial. 0 not checked. [2019-10-01 22:13:06,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:13:06,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 20] total 85 [2019-10-01 22:13:06,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-01 22:13:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-01 22:13:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=4740, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:13:06,569 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 85 states. [2019-10-01 22:13:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:13:06,995 INFO L93 Difference]: Finished difference Result 317 states and 326 transitions. [2019-10-01 22:13:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-01 22:13:06,996 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 308 [2019-10-01 22:13:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:13:06,997 INFO L225 Difference]: With dead ends: 317 [2019-10-01 22:13:06,997 INFO L226 Difference]: Without dead ends: 229 [2019-10-01 22:13:06,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2400, Invalid=4740, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:13:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-01 22:13:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-10-01 22:13:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-01 22:13:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2019-10-01 22:13:07,004 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 308 [2019-10-01 22:13:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:13:07,004 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2019-10-01 22:13:07,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-01 22:13:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2019-10-01 22:13:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-01 22:13:07,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:13:07,006 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 57, 57, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:13:07,006 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:13:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:13:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash 71499683, now seen corresponding path program 64 times [2019-10-01 22:13:07,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:13:07,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:13:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:07,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:13:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:13:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7927 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 22:13:08,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:13:08,697 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:13:08,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:13:08,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:13:08,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:13:08,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:13:08,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:13:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7927 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 6038 trivial. 0 not checked. [2019-10-01 22:13:09,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:13:09,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 22] total 88 [2019-10-01 22:13:09,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-01 22:13:09,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-01 22:13:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2508, Invalid=5148, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 22:13:09,637 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 88 states. [2019-10-01 22:13:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:13:09,979 INFO L93 Difference]: Finished difference Result 323 states and 335 transitions. [2019-10-01 22:13:09,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-01 22:13:09,980 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 312 [2019-10-01 22:13:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:13:09,981 INFO L225 Difference]: With dead ends: 323 [2019-10-01 22:13:09,981 INFO L226 Difference]: Without dead ends: 233 [2019-10-01 22:13:09,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2508, Invalid=5148, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 22:13:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-01 22:13:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2019-10-01 22:13:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-01 22:13:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2019-10-01 22:13:09,988 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 312 [2019-10-01 22:13:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:13:09,988 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2019-10-01 22:13:09,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-01 22:13:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2019-10-01 22:13:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-01 22:13:09,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:13:09,990 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 60, 60, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:13:09,990 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:13:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:13:09,991 INFO L82 PathProgramCache]: Analyzing trace with hash 501634051, now seen corresponding path program 65 times [2019-10-01 22:13:09,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:13:09,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:13:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:09,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:13:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:13:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8415 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 22:13:11,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:13:11,737 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:13:11,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1