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/xor4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:00:49,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:00:49,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:00:49,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:00:49,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:00:49,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:00:49,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:00:49,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:00:49,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:00:49,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:00:49,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:00:49,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:00:49,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:00:49,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:00:49,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:00:49,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:00:49,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:00:49,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:00:49,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:00:49,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:00:49,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:00:49,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:00:49,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:00:49,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:00:49,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:00:49,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:00:49,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:00:49,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:00:49,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:00:49,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:00:49,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:00:49,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:00:49,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:00:49,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:00:49,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:00:49,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:00:49,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:00:49,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:00:49,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:00:49,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:00:49,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:00:49,696 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:49,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:00:49,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:00:49,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:00:49,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:00:49,714 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:00:49,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:00:49,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:00:49,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:00:49,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:00:49,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:00:49,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:00:49,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:00:49,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:00:49,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:00:49,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:00:49,716 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:00:49,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:00:49,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:00:49,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:00:49,717 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:00:49,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:00:49,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:49,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:00:49,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:00:49,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:00:49,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:00:49,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:00:49,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:00:49,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:00:49,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:00:49,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:00:49,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:00:49,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:00:49,776 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:00:49,777 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor4.i [2019-10-01 22:00:49,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1acf7f2/a43ad632f6724b27a0684fd00dc2c6e4/FLAG93d37da05 [2019-10-01 22:00:50,319 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:00:50,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor4.i [2019-10-01 22:00:50,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1acf7f2/a43ad632f6724b27a0684fd00dc2c6e4/FLAG93d37da05 [2019-10-01 22:00:50,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1acf7f2/a43ad632f6724b27a0684fd00dc2c6e4 [2019-10-01 22:00:50,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:00:50,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:00:50,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:50,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:00:50,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:00:50,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:50" (1/1) ... [2019-10-01 22:00:50,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b17c9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:50, skipping insertion in model container [2019-10-01 22:00:50,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:50" (1/1) ... [2019-10-01 22:00:50,696 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:00:50,713 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:00:50,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:50,905 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:00:50,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:50,943 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:00:50,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:50 WrapperNode [2019-10-01 22:00:50,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:50,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:00:50,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:00:50,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:00:51,043 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:50" (1/1) ... [2019-10-01 22:00:51,043 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:50" (1/1) ... [2019-10-01 22:00:51,052 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:50" (1/1) ... [2019-10-01 22:00:51,052 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:50" (1/1) ... [2019-10-01 22:00:51,067 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:50" (1/1) ... [2019-10-01 22:00:51,072 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:50" (1/1) ... [2019-10-01 22:00:51,073 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:50" (1/1) ... [2019-10-01 22:00:51,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:00:51,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:00:51,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:00:51,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:00:51,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:00:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:00:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2019-10-01 22:00:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:00:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:00:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:00:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2019-10-01 22:00:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:00:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:00:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:00:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:00:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:00:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:00:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:00:51,459 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:00:51,460 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:00:51,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:51 BoogieIcfgContainer [2019-10-01 22:00:51,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:00:51,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:00:51,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:00:51,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:00:51,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:00:50" (1/3) ... [2019-10-01 22:00:51,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dac59fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:51, skipping insertion in model container [2019-10-01 22:00:51,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:50" (2/3) ... [2019-10-01 22:00:51,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dac59fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:51, skipping insertion in model container [2019-10-01 22:00:51,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:51" (3/3) ... [2019-10-01 22:00:51,471 INFO L109 eAbstractionObserver]: Analyzing ICFG xor4.i [2019-10-01 22:00:51,482 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:00:51,491 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:00:51,509 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:00:51,567 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:00:51,568 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:00:51,568 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:00:51,568 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:00:51,568 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:00:51,568 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:00:51,568 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:00:51,569 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:00:51,569 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:00:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:00:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:51,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,595 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:51,597 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2019-10-01 22:00:51,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,776 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:51,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:51,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:00:51,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:00:51,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:00:51,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:51,801 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:00:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,828 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 22:00:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:00:51,830 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 22:00:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,840 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:51,840 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:00:51,844 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:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:00:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:00:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:00:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 22:00:51,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 22:00:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,893 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 22:00:51,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:00:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 22:00:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:51,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,897 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:51,897 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2019-10-01 22:00:51,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,017 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:52,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:52,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:52,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:52,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:52,023 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 22:00:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,062 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:00:52,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:52,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 22:00:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,066 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:52,066 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:00:52,068 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:52,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:00:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:00:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:00:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 22:00:52,076 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 22:00:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,076 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 22:00:52,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 22:00:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:00:52,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,078 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:52,079 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,079 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2019-10-01 22:00:52,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:52,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,174 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:52,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,174 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:52,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,310 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:52,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:00:52,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 22:00:52,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:00:52,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:00:52,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:52,325 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 22:00:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,360 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:00:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:52,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 22:00:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,364 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:52,364 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:00:52,365 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:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:00:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 22:00:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:00:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:00:52,371 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 22:00:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,371 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:00:52,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:00:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:00:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 22:00:52,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,373 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:52,374 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2019-10-01 22:00:52,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,469 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:52,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:52,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:52,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:52,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:52,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:52,472 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 22:00:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,499 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 22:00:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:52,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 22:00:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,501 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:00:52,501 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:00:52,502 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:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:00:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 22:00:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:00:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 22:00:52,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 22:00:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,518 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 22:00:52,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 22:00:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:00:52,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,524 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:52,524 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2019-10-01 22:00:52,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,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:52,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,624 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:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,724 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:52,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:00:52,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:00:52,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:00:52,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:52,733 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 22:00:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,761 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 22:00:52,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:00:52,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 22:00:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,763 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:00:52,763 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 22:00:52,764 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:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 22:00:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 22:00:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:00:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 22:00:52,770 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 22:00:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,770 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 22:00:52,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:00:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 22:00:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:00:52,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,772 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:52,773 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2019-10-01 22:00:52,773 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:52,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,903 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:52,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,904 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:52,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:52,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:52,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,995 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:53,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:00:53,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:00:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:00:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:53,004 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 22:00:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,037 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 22:00:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:00:53,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 22:00:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,039 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:53,039 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:00:53,039 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:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:00:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 22:00:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 22:00:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 22:00:53,045 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 22:00:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,046 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 22:00:53,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:00:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 22:00:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:00:53,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,047 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:53,049 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2019-10-01 22:00:53,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,173 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:53,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,174 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:53,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:53,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 22:00:53,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,255 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:53,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:00:53,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:53,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:53,261 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 22:00:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,311 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 22:00:53,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:00:53,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 22:00:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,314 INFO L225 Difference]: With dead ends: 59 [2019-10-01 22:00:53,315 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:00:53,315 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:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:00:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:00:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:00:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 22:00:53,321 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 22:00:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,322 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 22:00:53,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 22:00:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:00:53,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,324 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:53,325 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2019-10-01 22:00:53,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,434 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:53,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,434 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:53,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:53,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:53,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:53,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:00:53,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:53,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:53,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:53,556 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 22:00:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,599 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:00:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:00:53,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 22:00:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,601 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:00:53,601 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:00:53,602 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:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:00:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 22:00:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 22:00:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 22:00:53,608 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 22:00:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,608 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 22:00:53,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 22:00:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 22:00:53,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,610 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:53,611 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash -170213137, now seen corresponding path program 5 times [2019-10-01 22:00:53,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,707 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:53,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,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 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:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:53,779 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:00:53,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 22:00:53,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:00:53,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:53,842 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 22:00:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,927 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 22:00:53,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:53,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 22:00:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,931 INFO L225 Difference]: With dead ends: 67 [2019-10-01 22:00:53,931 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:00:53,932 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:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:00:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 22:00:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:00:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 22:00:53,938 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 22:00:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,938 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 22:00:53,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 22:00:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 22:00:53,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,940 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:53,940 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash 778875311, now seen corresponding path program 6 times [2019-10-01 22:00:53,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,033 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:54,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,034 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:54,061 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:54,107 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 22:00:54,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,186 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:54,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 22:00:54,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:54,191 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 22:00:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,243 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 22:00:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:54,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 22:00:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,245 INFO L225 Difference]: With dead ends: 73 [2019-10-01 22:00:54,245 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:00:54,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:00:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:00:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:00:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 22:00:54,251 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 22:00:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,252 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 22:00:54,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 22:00:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 22:00:54,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,254 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:54,254 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -122717169, now seen corresponding path program 7 times [2019-10-01 22:00:54,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,357 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:54,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,358 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:54,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,453 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:54,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:00:54,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:54,471 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 22:00:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,525 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 22:00:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:00:54,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 22:00:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,526 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:00:54,527 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:00:54,530 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:54,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:00:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 22:00:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 22:00:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 22:00:54,540 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 22:00:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,544 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 22:00:54,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 22:00:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:00:54,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,546 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:54,546 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1588760433, now seen corresponding path program 8 times [2019-10-01 22:00:54,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,689 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:54,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,689 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:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:54,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:54,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,783 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:54,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:00:54,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:00:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:00:54,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:54,799 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 22:00:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,855 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 22:00:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:54,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 22:00:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,860 INFO L225 Difference]: With dead ends: 78 [2019-10-01 22:00:54,861 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 22:00:54,862 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:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 22:00:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 22:00:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:00:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 22:00:54,872 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 22:00:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,873 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 22:00:54,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:00:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 22:00:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:00:54,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,878 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:54,879 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1346261587, now seen corresponding path program 9 times [2019-10-01 22:00:54,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,038 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:55,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,038 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:55,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:55,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:00:55,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:55,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,146 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:55,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 22:00:55,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:00:55,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:00:55,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:55,153 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 22:00:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,227 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 22:00:55,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:00:55,228 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:00:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,229 INFO L225 Difference]: With dead ends: 83 [2019-10-01 22:00:55,229 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:00:55,230 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:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:00:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 22:00:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 22:00:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 22:00:55,243 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 22:00:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,244 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 22:00:55,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:00:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 22:00:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 22:00:55,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,245 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:55,248 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2116910669, now seen corresponding path program 10 times [2019-10-01 22:00:55,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,405 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:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,406 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:55,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:55,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:55,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:55,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:55,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 22:00:55,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:55,537 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 22:00:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,609 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 22:00:55,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:55,611 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 22:00:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,612 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:00:55,612 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:00:55,612 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:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:00:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 22:00:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:00:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 22:00:55,621 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 22:00:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,621 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 22:00:55,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 22:00:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:00:55,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,623 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:55,623 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash 343984243, now seen corresponding path program 11 times [2019-10-01 22:00:55,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:55,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,765 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:55,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,766 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:55,789 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:56,007 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:00:56,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:56,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,096 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:56,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 22:00:56,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:56,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:56,102 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 22:00:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:56,163 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 22:00:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:56,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 22:00:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:56,165 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:00:56,165 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 22:00:56,165 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:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 22:00:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 22:00:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:00:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 22:00:56,171 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 22:00:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:56,171 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 22:00:56,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 22:00:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:00:56,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:56,172 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:56,173 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1658502451, now seen corresponding path program 12 times [2019-10-01 22:00:56,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:56,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:56,325 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:56,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:56,325 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) [2019-10-01 22:00:56,358 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:56,536 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 22:00:56,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:56,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,598 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:56,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 22:00:56,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:56,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:56,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:56,604 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 22:00:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:56,696 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 22:00:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:56,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:00:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:56,698 INFO L225 Difference]: With dead ends: 101 [2019-10-01 22:00:56,698 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:00:56,699 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:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:00:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:00:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:00:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 22:00:56,707 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 22:00:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:56,708 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 22:00:56,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 22:00:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 22:00:56,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:56,710 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:56,710 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:56,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368429, now seen corresponding path program 13 times [2019-10-01 22:00:56,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:56,878 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:56,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:56,878 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:56,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:56,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:56,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:00:56,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:56,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:56,980 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 22:00:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,066 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 22:00:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:00:57,068 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 22:00:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,069 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:00:57,069 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 22:00:57,070 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:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 22:00:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 22:00:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 22:00:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 22:00:57,074 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 22:00:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,076 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 22:00:57,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 22:00:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 22:00:57,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,078 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:57,078 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1574767605, now seen corresponding path program 14 times [2019-10-01 22:00:57,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,296 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:57,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,297 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:57,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:57,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:57,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:57,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:00:57,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:57,416 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): Broken pipe [2019-10-01 22:00:57,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:57,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:00:57,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:00:57,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:00:57,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:57,431 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 22:00:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,507 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 22:00:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:57,507 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 22:00:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,508 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:00:57,508 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:00:57,509 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:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:00:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 22:00:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:00:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 22:00:57,520 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 22:00:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,520 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 22:00:57,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:00:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 22:00:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 22:00:57,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,521 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:57,522 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -459700265, now seen corresponding path program 15 times [2019-10-01 22:00:57,522 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,713 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:57,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,714 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:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:57,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:00:57,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:57,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:57,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:57,887 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:57,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:57,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 22:00:57,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:57,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:57,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:57,892 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 22:00:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:58,009 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 22:00:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:00:58,009 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 22:00:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:58,010 INFO L225 Difference]: With dead ends: 111 [2019-10-01 22:00:58,011 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 22:00:58,011 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:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 22:00:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 22:00:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:00:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 22:00:58,016 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 22:00:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:58,016 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 22:00:58,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 22:00:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:00:58,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:58,017 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:58,018 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -727614313, now seen corresponding path program 16 times [2019-10-01 22:00:58,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:58,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:58,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,216 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:58,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:58,217 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:58,255 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:58,313 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:58,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:58,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:00:58,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:58,356 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:58,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:58,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:00:58,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:00:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:00:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:58,372 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 22:00:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:58,450 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 22:00:58,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:58,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 22:00:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:58,452 INFO L225 Difference]: With dead ends: 114 [2019-10-01 22:00:58,452 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:00:58,453 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:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:00:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 22:00:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:00:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 22:00:58,458 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 22:00:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:58,458 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 22:00:58,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:00:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 22:00:58,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 22:00:58,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:58,461 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:58,462 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1948648953, now seen corresponding path program 17 times [2019-10-01 22:00:58,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:58,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:58,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,764 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:58,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:58,764 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:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:00,142 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:01:00,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:00,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:01:00,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:00,279 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:01:00,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:00,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 22:01:00,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:01:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:01:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:01:00,286 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 22:01:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:00,374 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 22:01:00,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:01:00,374 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 22:01:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:00,375 INFO L225 Difference]: With dead ends: 119 [2019-10-01 22:01:00,375 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 22:01:00,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:01:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 22:01:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 22:01:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 22:01:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 22:01:00,380 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 22:01:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:00,381 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 22:01:00,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:01:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 22:01:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 22:01:00,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:00,382 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:01:00,382 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1322362553, now seen corresponding path program 18 times [2019-10-01 22:01:00,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:00,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:00,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:00,620 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:01:00,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:00,621 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:01:00,647 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:00,950 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:01:00,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:00,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:01:00,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:01,044 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:01:01,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 22:01:01,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:01:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:01:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:01:01,050 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 22:01:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:01,186 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 22:01:01,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:01:01,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 22:01:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:01,191 INFO L225 Difference]: With dead ends: 125 [2019-10-01 22:01:01,191 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 22:01:01,192 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:01:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 22:01:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 22:01:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 22:01:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 22:01:01,199 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 22:01:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:01,200 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 22:01:01,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:01:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 22:01:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 22:01:01,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:01,203 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:01:01,203 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash -321357543, now seen corresponding path program 19 times [2019-10-01 22:01:01,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:01,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:01,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:01,521 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:01:01,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:01,521 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:01:01,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:01,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:01:01,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:01,657 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:01:01,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:01,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:01:01,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:01:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:01:01,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:01:01,672 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 22:01:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:01,743 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 22:01:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:01:01,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 22:01:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:01,745 INFO L225 Difference]: With dead ends: 128 [2019-10-01 22:01:01,745 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:01:01,745 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:01:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:01:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 22:01:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:01:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 22:01:01,752 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 22:01:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:01,753 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 22:01:01,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:01:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 22:01:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 22:01:01,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:01,754 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:01:01,754 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:01,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:01,755 INFO L82 PathProgramCache]: Analyzing trace with hash -415764741, now seen corresponding path program 20 times [2019-10-01 22:01:01,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:01,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:01,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:01,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:01,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:02,057 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:01:02,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:02,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 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:01:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:02,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:02,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:02,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:01:02,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:02,188 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:01:02,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:02,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:01:02,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:01:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:01:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:01:02,194 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 22:01:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:02,259 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 22:01:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:01:02,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 22:01:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:02,260 INFO L225 Difference]: With dead ends: 130 [2019-10-01 22:01:02,260 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 22:01:02,262 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:01:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 22:01:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 22:01:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 22:01:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 22:01:02,270 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 22:01:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:02,271 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 22:01:02,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:01:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 22:01:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:01:02,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:02,273 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:01:02,273 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash -946768803, now seen corresponding path program 21 times [2019-10-01 22:01:02,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:02,604 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:01:02,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:02,604 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:01:02,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:02,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:01:02,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:02,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:01:02,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:02,813 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:01:02,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:02,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 22:01:02,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:01:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:01:02,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:02,817 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 22:01:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:02,941 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 22:01:02,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:01:02,942 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 22:01:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:02,942 INFO L225 Difference]: With dead ends: 135 [2019-10-01 22:01:02,943 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 22:01:02,943 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:01:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 22:01:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 22:01:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:01:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 22:01:02,948 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 22:01:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:02,948 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 22:01:02,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:01:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 22:01:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 22:01:02,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:02,949 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:01:02,950 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:02,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1306006595, now seen corresponding path program 22 times [2019-10-01 22:01:02,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:02,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:03,268 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:01:03,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:03,268 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:01:03,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:03,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:03,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:03,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:01:03,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:01:03,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:03,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:01:03,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:01:03,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:01:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:01:03,412 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 22:01:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:03,490 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 22:01:03,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:01:03,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 22:01:03,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:03,492 INFO L225 Difference]: With dead ends: 138 [2019-10-01 22:01:03,492 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:01:03,493 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:01:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:01:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 22:01:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:01:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 22:01:03,498 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 22:01:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:03,499 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 22:01:03,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:01:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 22:01:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 22:01:03,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:03,500 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:01:03,500 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:03,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:03,500 INFO L82 PathProgramCache]: Analyzing trace with hash 145514399, now seen corresponding path program 23 times [2019-10-01 22:01:03,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:03,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:03,828 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:01:03,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:03,829 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:01:03,862 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:05,967 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 22:01:05,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:05,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:05,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:06,148 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:06,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:06,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 22:01:06,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:01:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:01:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:06,155 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-01 22:01:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:06,272 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 22:01:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:06,273 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-01 22:01:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:06,274 INFO L225 Difference]: With dead ends: 143 [2019-10-01 22:01:06,274 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 22:01:06,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 22:01:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 22:01:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 22:01:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 22:01:06,279 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 22:01:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:06,280 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 22:01:06,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:01:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 22:01:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 22:01:06,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:06,281 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:06,281 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:06,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1666503775, now seen corresponding path program 24 times [2019-10-01 22:01:06,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:06,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:06,629 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:06,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:06,629 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:06,660 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:07,537 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 22:01:07,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:07,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:01:07,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:07,687 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:07,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:07,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-01 22:01:07,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:01:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:01:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:07,698 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-01 22:01:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:07,793 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-01 22:01:07,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:07,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-01 22:01:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:07,794 INFO L225 Difference]: With dead ends: 149 [2019-10-01 22:01:07,794 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 22:01:07,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 22:01:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-01 22:01:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 22:01:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-01 22:01:07,799 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-01 22:01:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:07,799 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-01 22:01:07,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:01:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-01 22:01:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 22:01:07,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:07,800 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:07,801 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash -702773313, now seen corresponding path program 25 times [2019-10-01 22:01:07,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:07,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:07,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:07,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:08,154 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:08,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:08,155 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:08,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:08,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:01:08,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:08,285 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:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:08,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:01:08,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:01:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:01:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:01:08,290 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-01 22:01:08,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:08,389 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 22:01:08,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:01:08,390 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-01 22:01:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:08,391 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:01:08,392 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 22:01:08,392 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:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 22:01:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 22:01:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 22:01:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 22:01:08,397 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-01 22:01:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:08,397 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 22:01:08,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:01:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 22:01:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 22:01:08,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:08,398 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:08,399 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1510967329, now seen corresponding path program 26 times [2019-10-01 22:01:08,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:08,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:08,782 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:08,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:08,783 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:08,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:08,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:08,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:08,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:01:08,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:08,908 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:08,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:08,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:01:08,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:01:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:01:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:08,913 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 22:01:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:09,000 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 22:01:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:01:09,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 22:01:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:09,002 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:01:09,003 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 22:01:09,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 22:01:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 22:01:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:01:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 22:01:09,008 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 22:01:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:09,008 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 22:01:09,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:01:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 22:01:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 22:01:09,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:09,010 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:09,010 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:09,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:09,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1388054525, now seen corresponding path program 27 times [2019-10-01 22:01:09,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:09,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:09,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:09,467 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:09,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:09,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 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:09,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:09,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:01:09,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:09,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:09,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:09,956 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:09,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:09,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-01 22:01:09,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:01:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:01:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:01:09,964 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-01 22:01:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:10,135 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-01 22:01:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:01:10,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-01 22:01:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:10,142 INFO L225 Difference]: With dead ends: 159 [2019-10-01 22:01:10,142 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 22:01:10,143 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:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 22:01:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-01 22:01:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 22:01:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-01 22:01:10,148 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-01 22:01:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:10,149 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-01 22:01:10,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:01:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-01 22:01:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 22:01:10,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:10,150 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:10,150 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash 109793379, now seen corresponding path program 28 times [2019-10-01 22:01:10,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:10,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:10,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:10,650 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:10,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:10,651 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:10,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:10,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:10,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:10,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:10,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:10,935 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:10,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:10,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-01 22:01:10,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:01:10,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:01:10,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:01:10,943 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-01 22:01:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:11,122 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-01 22:01:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:01:11,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-01 22:01:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:11,124 INFO L225 Difference]: With dead ends: 165 [2019-10-01 22:01:11,124 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 22:01:11,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:01:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 22:01:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 22:01:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 22:01:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-01 22:01:11,138 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-01 22:01:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:11,139 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-01 22:01:11,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:01:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-01 22:01:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 22:01:11,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:11,141 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:11,141 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 402103075, now seen corresponding path program 29 times [2019-10-01 22:01:11,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:11,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:11,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:11,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:11,693 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:11,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:11,694 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:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:25,231 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 22:01:25,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:25,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:25,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:25,453 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:25,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:25,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 22:01:25,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:01:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:01:25,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:25,463 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-01 22:01:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:25,647 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-01 22:01:25,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:01:25,648 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-01 22:01:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:25,649 INFO L225 Difference]: With dead ends: 171 [2019-10-01 22:01:25,650 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 22:01:25,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 22:01:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-01 22:01:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 22:01:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-01 22:01:25,658 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-01 22:01:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:25,658 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-01 22:01:25,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:01:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-01 22:01:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 22:01:25,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:25,660 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:25,660 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash -595520541, now seen corresponding path program 30 times [2019-10-01 22:01:25,660 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:25,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:25,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:26,412 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:26,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:26,413 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:26,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:29,565 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:01:29,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:29,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:29,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:29,764 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:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:29,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-01 22:01:29,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:01:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:01:29,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:29,771 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-01 22:01:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:29,929 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-01 22:01:29,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:01:29,930 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-01 22:01:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:29,931 INFO L225 Difference]: With dead ends: 177 [2019-10-01 22:01:29,931 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 22:01:29,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 22:01:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-01 22:01:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 22:01:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 22:01:29,937 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-01 22:01:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:29,938 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 22:01:29,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:01:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 22:01:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 22:01:29,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:29,939 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:29,940 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1949057213, now seen corresponding path program 31 times [2019-10-01 22:01:29,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:29,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:29,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:30,618 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:30,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:30,618 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:30,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:30,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:01:30,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:30,765 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:30,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:30,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:01:30,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:01:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:01:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:30,769 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-01 22:01:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:30,879 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-01 22:01:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:30,882 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-01 22:01:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:30,883 INFO L225 Difference]: With dead ends: 180 [2019-10-01 22:01:30,884 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 22:01:30,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 22:01:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 22:01:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:01:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 22:01:30,889 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-01 22:01:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:30,889 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 22:01:30,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:01:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 22:01:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 22:01:30,890 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:30,890 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:30,891 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1172060325, now seen corresponding path program 32 times [2019-10-01 22:01:30,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:31,390 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:31,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:31,391 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:31,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:31,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:31,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:31,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:01:31,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:31,547 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:31,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:31,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:01:31,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:01:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:01:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:31,553 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 22:01:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:31,659 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 22:01:31,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:31,660 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 22:01:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:31,661 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:01:31,661 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 22:01:31,662 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:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 22:01:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 22:01:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 22:01:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 22:01:31,667 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 22:01:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:31,667 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 22:01:31,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:01:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 22:01:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:01:31,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:31,668 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:31,669 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1616125561, now seen corresponding path program 33 times [2019-10-01 22:01:31,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:31,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:31,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:31,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:31,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:32,244 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:32,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:32,244 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:32,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:32,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 22:01:32,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:32,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:01:32,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:32,748 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:32,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:32,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-01 22:01:32,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:01:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:01:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:01:32,754 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-01 22:01:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:32,944 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-01 22:01:32,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:01:32,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-01 22:01:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:32,951 INFO L225 Difference]: With dead ends: 187 [2019-10-01 22:01:32,952 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 22:01:32,953 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:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 22:01:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-01 22:01:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 22:01:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-01 22:01:32,958 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-01 22:01:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:32,960 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-01 22:01:32,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:01:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-01 22:01:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 22:01:32,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:32,961 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:32,962 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:32,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1166888473, now seen corresponding path program 34 times [2019-10-01 22:01:32,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:32,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:32,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:32,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:32,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:33,638 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:33,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:33,638 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:33,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:33,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:33,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:33,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:01:33,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:34,047 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:34,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:34,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 22:01:34,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:01:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:01:34,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:34,052 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-01 22:01:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:34,294 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-01 22:01:34,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:01:34,294 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-01 22:01:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:34,296 INFO L225 Difference]: With dead ends: 193 [2019-10-01 22:01:34,296 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 22:01:34,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 22:01:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 22:01:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 22:01:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-01 22:01:34,302 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-01 22:01:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:34,302 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-01 22:01:34,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:01:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-01 22:01:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 22:01:34,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:34,303 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:34,303 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash 11282759, now seen corresponding path program 35 times [2019-10-01 22:01:34,304 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:34,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:34,860 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:34,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:34,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 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:34,911 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:02:10,920 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 22:02:10,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:10,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:02:10,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:11,372 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:11,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:11,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-01 22:02:11,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:02:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:02:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:02:11,390 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-01 22:02:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:11,639 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-01 22:02:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:02:11,639 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-01 22:02:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:11,641 INFO L225 Difference]: With dead ends: 199 [2019-10-01 22:02:11,641 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 22:02:11,643 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:02:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 22:02:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-01 22:02:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 22:02:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-01 22:02:11,649 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-01 22:02:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:11,650 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-01 22:02:11,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:02:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-01 22:02:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 22:02:11,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:11,653 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:11,653 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:11,654 INFO L82 PathProgramCache]: Analyzing trace with hash -964866553, now seen corresponding path program 36 times [2019-10-01 22:02:11,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:11,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:11,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:12,541 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:12,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:12,542 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:12,592 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:02:16,893 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 22:02:16,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:16,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:02:16,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:17,147 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:17,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:17,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 22:02:17,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:02:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:02:17,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:02:17,154 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-01 22:02:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:17,379 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-01 22:02:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:02:17,383 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-01 22:02:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:17,384 INFO L225 Difference]: With dead ends: 205 [2019-10-01 22:02:17,384 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 22:02:17,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:02:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 22:02:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-01 22:02:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 22:02:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-01 22:02:17,391 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-01 22:02:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:17,392 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-01 22:02:17,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:02:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-01 22:02:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 22:02:17,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:17,393 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:17,394 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1360846649, now seen corresponding path program 37 times [2019-10-01 22:02:17,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:17,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:18,137 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:18,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:18,137 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:18,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:18,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:02:18,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:18,338 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:18,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:18,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:02:18,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:02:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:02:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:02:18,343 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-01 22:02:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:18,471 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-01 22:02:18,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:02:18,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-01 22:02:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:18,473 INFO L225 Difference]: With dead ends: 208 [2019-10-01 22:02:18,473 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 22:02:18,474 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:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 22:02:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 22:02:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 22:02:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 22:02:18,479 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-01 22:02:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:18,480 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 22:02:18,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:02:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 22:02:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 22:02:18,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:18,481 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:18,481 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:18,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash 545362729, now seen corresponding path program 38 times [2019-10-01 22:02:18,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:18,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:18,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:19,325 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:19,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:19,326 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:19,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:02:19,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:02:19,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:19,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:02:19,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:19,515 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:19,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:19,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:02:19,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:02:19,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:02:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:19,522 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 22:02:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:19,649 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 22:02:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:02:19,650 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-01 22:02:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:19,650 INFO L225 Difference]: With dead ends: 210 [2019-10-01 22:02:19,651 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:02:19,651 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:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:02:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 22:02:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 22:02:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 22:02:19,656 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-01 22:02:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:19,657 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 22:02:19,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:02:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 22:02:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 22:02:19,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:19,658 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:19,658 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1538460405, now seen corresponding path program 39 times [2019-10-01 22:02:19,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:19,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:19,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:20,373 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:20,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:20,373 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:20,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:02:20,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 22:02:20,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:20,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:02:20,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:21,166 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:21,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:21,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 22:02:21,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:02:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:02:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:02:21,172 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-01 22:02:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:21,405 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2019-10-01 22:02:21,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:02:21,410 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-01 22:02:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:21,411 INFO L225 Difference]: With dead ends: 215 [2019-10-01 22:02:21,411 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 22:02:21,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:02:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 22:02:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-01 22:02:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 22:02:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-01 22:02:21,418 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-01 22:02:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:21,418 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-01 22:02:21,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:02:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-01 22:02:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 22:02:21,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:21,420 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:21,420 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1307046347, now seen corresponding path program 40 times [2019-10-01 22:02:21,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:21,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:21,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:21,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:21,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:22,177 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:22,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:22,178 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:22,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:02:22,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:02:22,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:22,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 22:02:22,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:22,409 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:22,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:22,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 22:02:22,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:02:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:02:22,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:02:22,416 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2019-10-01 22:02:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:22,539 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2019-10-01 22:02:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:02:22,540 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2019-10-01 22:02:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:22,542 INFO L225 Difference]: With dead ends: 218 [2019-10-01 22:02:22,542 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 22:02:22,542 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:02:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 22:02:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-01 22:02:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 22:02:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 22:02:22,547 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-01 22:02:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:22,548 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 22:02:22,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:02:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 22:02:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 22:02:22,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:22,549 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:22,549 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -376184531, now seen corresponding path program 41 times [2019-10-01 22:02:22,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:22,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:22,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:23,481 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:23,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:23,482 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:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:03:24,397 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 22:03:24,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:24,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:03:24,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:24,747 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:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:24,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 16] total 58 [2019-10-01 22:03:24,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:03:24,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:03:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:24,766 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 58 states. [2019-10-01 22:03:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:24,972 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2019-10-01 22:03:24,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:03:24,972 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-10-01 22:03:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:24,974 INFO L225 Difference]: With dead ends: 223 [2019-10-01 22:03:24,974 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 22:03:24,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 22:03:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 22:03:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 22:03:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-01 22:03:24,979 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 214 [2019-10-01 22:03:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:24,979 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-01 22:03:24,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:03:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-01 22:03:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 22:03:24,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:24,981 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:24,981 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1065945581, now seen corresponding path program 42 times [2019-10-01 22:03:24,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:24,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:24,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:26,211 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:26,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:26,211 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26,309 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:03:31,477 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:03:31,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:31,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:03:31,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2777 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:03:31,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:31,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 14] total 57 [2019-10-01 22:03:31,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:03:31,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:03:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:03:31,771 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 57 states. [2019-10-01 22:03:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:31,967 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2019-10-01 22:03:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 22:03:31,968 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2019-10-01 22:03:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:31,969 INFO L225 Difference]: With dead ends: 229 [2019-10-01 22:03:31,969 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 22:03:31,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:03:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 22:03:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-01 22:03:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 22:03:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-01 22:03:31,976 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 222 [2019-10-01 22:03:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:31,977 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-01 22:03:31,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:03:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-01 22:03:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-01 22:03:31,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:31,979 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:03:31,979 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -909968051, now seen corresponding path program 43 times [2019-10-01 22:03:31,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:31,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:31,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:32,950 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:03:32,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:32,950 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:03:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:33,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:03:33,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:33,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:33,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 22:03:33,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:03:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:03:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:03:33,176 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 47 states. [2019-10-01 22:03:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:33,319 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2019-10-01 22:03:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:03:33,320 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 226 [2019-10-01 22:03:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:33,321 INFO L225 Difference]: With dead ends: 232 [2019-10-01 22:03:33,321 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 22:03:33,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:03:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 22:03:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-01 22:03:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 22:03:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 22:03:33,326 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 226 [2019-10-01 22:03:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:33,326 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 22:03:33,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:03:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 22:03:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 22:03:33,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:33,328 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:03:33,328 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:33,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1549752623, now seen corresponding path program 44 times [2019-10-01 22:03:33,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:33,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:33,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:33,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:33,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:34,585 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:03:34,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:34,586 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:03:34,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:03:34,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:03:34,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:34,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:03:34,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:34,820 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:03:34,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:34,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:03:34,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:03:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:03:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:34,826 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 22:03:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:34,984 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 22:03:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:03:34,984 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 22:03:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:34,985 INFO L225 Difference]: With dead ends: 234 [2019-10-01 22:03:34,985 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 22:03:34,986 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 22:03:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 22:03:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 22:03:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 22:03:34,990 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 22:03:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:34,990 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 22:03:34,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:03:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 22:03:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 22:03:34,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:34,992 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:03:34,992 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1185659759, now seen corresponding path program 45 times [2019-10-01 22:03:34,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:34,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:34,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:34,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:34,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:35,862 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:03:35,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:35,862 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:03:35,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:03:36,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:03:36,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:36,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:03:36,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [2019-10-01 22:03:36,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:36,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 15] total 61 [2019-10-01 22:03:36,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:03:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:03:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:03:36,710 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 61 states. [2019-10-01 22:03:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:36,991 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2019-10-01 22:03:36,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:03:36,995 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 230 [2019-10-01 22:03:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:36,997 INFO L225 Difference]: With dead ends: 239 [2019-10-01 22:03:36,997 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 22:03:36,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:03:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 22:03:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-10-01 22:03:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 22:03:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-10-01 22:03:37,003 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 230 [2019-10-01 22:03:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:37,003 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-10-01 22:03:37,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:03:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-10-01 22:03:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-01 22:03:37,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:37,005 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 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:03:37,005 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1590649615, now seen corresponding path program 46 times [2019-10-01 22:03:37,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:37,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:37,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:37,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:37,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:37,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:37,899 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:03:37,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:03:38,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:03:38,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:38,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 22:03:38,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:38,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:38,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 22:03:38,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:03:38,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:03:38,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:03:38,130 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 50 states. [2019-10-01 22:03:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:38,421 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 22:03:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:03:38,422 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 234 [2019-10-01 22:03:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:38,423 INFO L225 Difference]: With dead ends: 242 [2019-10-01 22:03:38,424 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 22:03:38,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:03:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 22:03:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 22:03:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 22:03:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 22:03:38,429 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 234 [2019-10-01 22:03:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:38,430 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 22:03:38,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:03:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 22:03:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 22:03:38,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:38,431 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:03:38,432 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash 262928083, now seen corresponding path program 47 times [2019-10-01 22:03:38,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:38,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:38,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:38,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:39,358 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:03:39,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:39,358 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:03:39,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:05:37,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 22:05:37,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:37,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:05:37,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3201 trivial. 0 not checked. [2019-10-01 22:05:38,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:38,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 17] total 65 [2019-10-01 22:05:38,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 22:05:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 22:05:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:05:38,280 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 65 states. [2019-10-01 22:05:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:38,529 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2019-10-01 22:05:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:05:38,529 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 236 [2019-10-01 22:05:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:38,530 INFO L225 Difference]: With dead ends: 247 [2019-10-01 22:05:38,531 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 22:05:38,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:05:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 22:05:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-10-01 22:05:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-01 22:05:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2019-10-01 22:05:38,542 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 236 [2019-10-01 22:05:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:38,543 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2019-10-01 22:05:38,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 22:05:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2019-10-01 22:05:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-01 22:05:38,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:38,546 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 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:05:38,546 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash 528249747, now seen corresponding path program 48 times [2019-10-01 22:05:38,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:38,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:38,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:05:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 22:05:39,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05:39,558 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:05:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:05:47,753 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 22:05:47,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:47,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:05:47,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2019-10-01 22:05:48,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:48,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 16] total 65 [2019-10-01 22:05:48,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 22:05:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 22:05:48,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:05:48,142 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 65 states. [2019-10-01 22:05:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:48,484 INFO L93 Difference]: Finished difference Result 253 states and 262 transitions. [2019-10-01 22:05:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:05:48,485 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 244 [2019-10-01 22:05:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:48,486 INFO L225 Difference]: With dead ends: 253 [2019-10-01 22:05:48,486 INFO L226 Difference]: Without dead ends: 181 [2019-10-01 22:05:48,487 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:05:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-01 22:05:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-10-01 22:05:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-01 22:05:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-10-01 22:05:48,491 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 244 [2019-10-01 22:05:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:48,491 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-10-01 22:05:48,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 22:05:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-10-01 22:05:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-01 22:05:48,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:48,493 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 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:05:48,493 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:48,493 INFO L82 PathProgramCache]: Analyzing trace with hash 916047859, now seen corresponding path program 49 times [2019-10-01 22:05:48,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:48,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:48,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:05:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:05:49,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05:49,529 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:05:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:05:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:49,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:05:49,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 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:05:49,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:49,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 22:05:49,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:05:49,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:05:49,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:05:49,769 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 53 states. [2019-10-01 22:05:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:49,933 INFO L93 Difference]: Finished difference Result 256 states and 264 transitions. [2019-10-01 22:05:49,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 22:05:49,934 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 248 [2019-10-01 22:05:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:49,935 INFO L225 Difference]: With dead ends: 256 [2019-10-01 22:05:49,935 INFO L226 Difference]: Without dead ends: 182 [2019-10-01 22:05:49,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:05:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-01 22:05:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-10-01 22:05:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 22:05:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 22:05:49,941 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 248 [2019-10-01 22:05:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:49,941 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 22:05:49,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:05:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 22:05:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 22:05:49,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:49,943 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:05:49,943 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -847696299, now seen corresponding path program 50 times [2019-10-01 22:05:49,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:49,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:05:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:51,023 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:05:51,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05:51,024 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:05:51,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:05:51,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:05:51,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:51,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 22:05:51,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:51,284 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:05:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 22:05:51,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:05:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:05:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:05:51,291 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 22:05:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:51,471 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 22:05:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:05:51,471 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 22:05:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:51,473 INFO L225 Difference]: With dead ends: 258 [2019-10-01 22:05:51,473 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:05:51,474 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:05:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:05:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 22:05:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 22:05:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 22:05:51,478 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 22:05:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:51,479 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 22:05:51,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:05:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 22:05:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 22:05:51,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:51,480 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:05:51,481 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash 706249783, now seen corresponding path program 51 times [2019-10-01 22:05:51,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:51,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:51,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:51,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:05:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:52,672 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:05:52,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05:52,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 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:05:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:05:53,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:05:53,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:53,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:05:53,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 1071 proven. 196 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2019-10-01 22:05:54,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:54,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 19] total 71 [2019-10-01 22:05:54,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-01 22:05:54,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-01 22:05:54,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1675, Invalid=3295, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 22:05:54,333 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 71 states. [2019-10-01 22:05:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:55,192 INFO L93 Difference]: Finished difference Result 264 states and 274 transitions. [2019-10-01 22:05:55,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-01 22:05:55,193 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 252 [2019-10-01 22:05:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:55,194 INFO L225 Difference]: With dead ends: 264 [2019-10-01 22:05:55,194 INFO L226 Difference]: Without dead ends: 190 [2019-10-01 22:05:55,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1945, Invalid=5365, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:05:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-01 22:05:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-10-01 22:05:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 22:05:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 22:05:55,200 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 252 [2019-10-01 22:05:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:55,201 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 22:05:55,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-01 22:05:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 22:05:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 22:05:55,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:55,202 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:05:55,203 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1563697657, now seen corresponding path program 52 times [2019-10-01 22:05:55,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:55,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:55,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:05:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:56,949 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:05:56,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05:56,950 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:05:57,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:05:57,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:05:57,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:57,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 22:05:57,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:57,200 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:05:57,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:57,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 22:05:57,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:05:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:05:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:05:57,206 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 57 states. [2019-10-01 22:05:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:57,415 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2019-10-01 22:05:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 22:05:57,415 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 258 [2019-10-01 22:05:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:57,416 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:05:57,417 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 22:05:57,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:05:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 22:05:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-10-01 22:05:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 22:05:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-01 22:05:57,431 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 258 [2019-10-01 22:05:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:57,431 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-01 22:05:57,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:05:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-01 22:05:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 22:05:57,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:57,434 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:05:57,434 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1209562587, now seen corresponding path program 53 times [2019-10-01 22:05:57,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:57,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:05:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:05:58,781 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:05:58,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05:58,782 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:05:58,874 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:08:33,045 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-01 22:08:33,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:08:33,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:08:33,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:08:33,548 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:08:33,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:08:33,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 22:08:33,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:08:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:08:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:08:33,571 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 73 states. [2019-10-01 22:08:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:33,923 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-10-01 22:08:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:08:33,923 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 260 [2019-10-01 22:08:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:33,925 INFO L225 Difference]: With dead ends: 273 [2019-10-01 22:08:33,925 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 22:08:33,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:08:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 22:08:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-01 22:08:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 22:08:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-01 22:08:33,930 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 260 [2019-10-01 22:08:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:33,931 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-01 22:08:33,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:08:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-01 22:08:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 22:08:33,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:33,932 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:08:33,932 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1357300891, now seen corresponding path program 54 times [2019-10-01 22:08:33,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:33,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:33,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:08:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:35,199 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:08:35,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:08:35,200 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:08:35,295 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:09:15,671 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 22:09:15,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:15,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:09:15,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:16,167 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:16,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:16,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 18] total 74 [2019-10-01 22:09:16,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-01 22:09:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-01 22:09:16,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=3597, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 22:09:16,179 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 74 states. [2019-10-01 22:09:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:16,552 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2019-10-01 22:09:16,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-01 22:09:16,552 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 268 [2019-10-01 22:09:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:16,553 INFO L225 Difference]: With dead ends: 279 [2019-10-01 22:09:16,553 INFO L226 Difference]: Without dead ends: 201 [2019-10-01 22:09:16,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1805, Invalid=3597, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 22:09:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-01 22:09:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-10-01 22:09:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 22:09:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 22:09:16,559 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 268 [2019-10-01 22:09:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:16,559 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 22:09:16,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-01 22:09:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 22:09:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 22:09:16,561 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:16,561 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:16,561 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash -632850181, now seen corresponding path program 55 times [2019-10-01 22:09:16,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:16,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:17,878 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:17,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:17,878 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:17,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:18,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 22:09:18,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:18,145 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:18,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:18,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 22:09:18,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:09:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:09:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:09:18,151 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 60 states. [2019-10-01 22:09:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:18,354 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2019-10-01 22:09:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:09:18,355 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 272 [2019-10-01 22:09:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:18,356 INFO L225 Difference]: With dead ends: 282 [2019-10-01 22:09:18,356 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 22:09:18,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:09:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 22:09:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 22:09:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 22:09:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 22:09:18,361 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 272 [2019-10-01 22:09:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:18,362 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 22:09:18,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:09:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 22:09:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 22:09:18,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:18,364 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:18,364 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1565677917, now seen corresponding path program 56 times [2019-10-01 22:09:18,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:19,672 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:19,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:19,672 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:19,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:09:19,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:09:19,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:19,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 22:09:19,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:19,956 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:19,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:19,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 22:09:19,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:09:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:09:19,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:09:19,962 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 61 states. [2019-10-01 22:09:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:20,194 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-10-01 22:09:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:09:20,194 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 274 [2019-10-01 22:09:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:20,195 INFO L225 Difference]: With dead ends: 284 [2019-10-01 22:09:20,195 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 22:09:20,196 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:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 22:09:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 22:09:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 22:09:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 22:09:20,202 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 274 [2019-10-01 22:09:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:20,202 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 22:09:20,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:09:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 22:09:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 22:09:20,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:20,205 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:20,205 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1227270463, now seen corresponding path program 57 times [2019-10-01 22:09:20,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:20,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:20,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:21,611 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:21,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:21,611 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:21,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:09:23,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 22:09:23,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:23,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:09:23,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:23,848 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:23,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:23,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 19] total 78 [2019-10-01 22:09:23,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-01 22:09:23,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-01 22:09:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=4006, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 22:09:23,855 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 78 states. [2019-10-01 22:09:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:24,195 INFO L93 Difference]: Finished difference Result 289 states and 301 transitions. [2019-10-01 22:09:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-01 22:09:24,200 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 276 [2019-10-01 22:09:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:24,202 INFO L225 Difference]: With dead ends: 289 [2019-10-01 22:09:24,202 INFO L226 Difference]: Without dead ends: 209 [2019-10-01 22:09:24,203 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:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-01 22:09:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-10-01 22:09:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-01 22:09:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2019-10-01 22:09:24,208 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 276 [2019-10-01 22:09:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:24,208 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2019-10-01 22:09:24,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-01 22:09:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2019-10-01 22:09:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-01 22:09:24,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:24,211 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:24,211 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2123200511, now seen corresponding path program 58 times [2019-10-01 22:09:24,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:24,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:24,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:25,635 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:25,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:25,635 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:25,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:09:25,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:09:25,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:25,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:09:25,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:26,432 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:26,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:26,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 20] total 80 [2019-10-01 22:09:26,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 22:09:26,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 22:09:26,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 22:09:26,438 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand 80 states. [2019-10-01 22:09:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:26,759 INFO L93 Difference]: Finished difference Result 295 states and 307 transitions. [2019-10-01 22:09:26,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-01 22:09:26,760 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 284 [2019-10-01 22:09:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:26,761 INFO L225 Difference]: With dead ends: 295 [2019-10-01 22:09:26,761 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:09:26,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 22:09:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:09:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-01 22:09:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-01 22:09:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2019-10-01 22:09:26,767 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 284 [2019-10-01 22:09:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:26,768 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2019-10-01 22:09:26,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 22:09:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2019-10-01 22:09:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-01 22:09:26,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:26,770 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:26,770 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:26,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1359574207, now seen corresponding path program 59 times [2019-10-01 22:09:26,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:26,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:26,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:28,319 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:28,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:28,320 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:28,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:11:39,661 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-10-01 22:11:39,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:11:39,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:11:39,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:11:40,292 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:11:40,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:11:40,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 21] total 82 [2019-10-01 22:11:40,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:11:40,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:11:40,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2162, Invalid=4480, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:11:40,318 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 82 states. [2019-10-01 22:11:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:11:40,655 INFO L93 Difference]: Finished difference Result 301 states and 313 transitions. [2019-10-01 22:11:40,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:11:40,657 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 292 [2019-10-01 22:11:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:11:40,658 INFO L225 Difference]: With dead ends: 301 [2019-10-01 22:11:40,658 INFO L226 Difference]: Without dead ends: 217 [2019-10-01 22:11:40,659 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:11:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-01 22:11:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-01 22:11:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-01 22:11:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-10-01 22:11:40,665 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 292 [2019-10-01 22:11:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:11:40,665 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-10-01 22:11:40,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:11:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-10-01 22:11:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-01 22:11:40,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:11:40,667 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:11:40,668 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:11:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:11:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash -257843329, now seen corresponding path program 60 times [2019-10-01 22:11:40,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:11:40,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:11:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:11:40,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:11:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:11:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:11:42,116 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:11:42,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:11:42,117 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:11:42,243 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:12:13,994 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:12:13,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:12:14,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:12:14,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7355 backedges. 1651 proven. 256 refuted. 0 times theorem prover too weak. 5448 trivial. 0 not checked. [2019-10-01 22:12:14,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:14,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 21] total 83 [2019-10-01 22:12:14,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 22:12:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 22:12:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2315, Invalid=4491, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 22:12:14,666 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 83 states. [2019-10-01 22:12:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:15,946 INFO L93 Difference]: Finished difference Result 308 states and 318 transitions. [2019-10-01 22:12:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 22:12:15,946 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 300 [2019-10-01 22:12:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:15,948 INFO L225 Difference]: With dead ends: 308 [2019-10-01 22:12:15,948 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 22:12:15,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2655, Invalid=7245, Unknown=0, NotChecked=0, Total=9900 [2019-10-01 22:12:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 22:12:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-10-01 22:12:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:12:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 22:12:15,955 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 300 [2019-10-01 22:12:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:15,955 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 22:12:15,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 22:12:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 22:12:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 22:12:15,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:15,957 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:15,958 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:15,958 INFO L82 PathProgramCache]: Analyzing trace with hash -504065215, now seen corresponding path program 61 times [2019-10-01 22:12:15,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:15,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:15,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:12:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:17,572 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:12:17,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:12:17,572 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:17,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:12:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:17,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 22:12:17,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:17,878 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:12:17,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:17,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 22:12:17,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 22:12:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 22:12:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:12:17,883 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 22:12:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:18,161 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 22:12:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:12:18,162 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 22:12:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:18,163 INFO L225 Difference]: With dead ends: 312 [2019-10-01 22:12:18,163 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:12:18,164 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:12:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:12:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 22:12:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 22:12:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 22:12:18,169 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 22:12:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:18,170 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 22:12:18,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 22:12:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 22:12:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 22:12:18,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:18,172 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:12:18,172 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 692116259, now seen corresponding path program 62 times [2019-10-01 22:12:18,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:18,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:12:18,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:20,024 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:12:20,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:12:20,024 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:12:20,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:12:20,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:12:20,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:12:20,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 22:12:20,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 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:12:20,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:20,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 22:12:20,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:12:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:12:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:12:20,402 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 68 states. [2019-10-01 22:12:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:20,693 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2019-10-01 22:12:20,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 22:12:20,694 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 308 [2019-10-01 22:12:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:20,694 INFO L225 Difference]: With dead ends: 314 [2019-10-01 22:12:20,695 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 22:12:20,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:12:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 22:12:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-01 22:12:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 22:12:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 22:12:20,701 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 308 [2019-10-01 22:12:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:20,701 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 22:12:20,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:12:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 22:12:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 22:12:20,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:20,704 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 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:20,704 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash -828722555, now seen corresponding path program 63 times [2019-10-01 22:12:20,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:20,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:20,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:20,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:12:20,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:12:22,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:12: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 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:12:22,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:12:24,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:12:24,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:12:24,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:12:24,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 6073 trivial. 0 not checked. [2019-10-01 22:12:25,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:25,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 20] total 86 [2019-10-01 22:12:25,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 22:12:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 22:12:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:12:25,123 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 86 states. [2019-10-01 22:12:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:25,557 INFO L93 Difference]: Finished difference Result 319 states and 328 transitions. [2019-10-01 22:12:25,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-01 22:12:25,558 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 310 [2019-10-01 22:12:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:25,559 INFO L225 Difference]: With dead ends: 319 [2019-10-01 22:12:25,560 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 22:12:25,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:12:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 22:12:25,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-10-01 22:12:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 22:12:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 22:12:25,567 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 310 [2019-10-01 22:12:25,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:25,567 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 22:12:25,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 22:12:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 22:12:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-01 22:12:25,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:25,569 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 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:12:25,569 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:25,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1074794011, now seen corresponding path program 64 times [2019-10-01 22:12:25,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:25,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:25,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:12:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 22:12:27,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:12:27,239 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:12:27,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:12:27,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:12:27,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:12:27,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:12:27,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:12:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 6169 trivial. 0 not checked. [2019-10-01 22:12:28,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:12:28,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 22] total 89 [2019-10-01 22:12:28,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 22:12:28,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 22:12:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:12:28,198 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 89 states. [2019-10-01 22:12:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:12:28,578 INFO L93 Difference]: Finished difference Result 325 states and 337 transitions. [2019-10-01 22:12:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-01 22:12:28,578 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 314 [2019-10-01 22:12:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:12:28,581 INFO L225 Difference]: With dead ends: 325 [2019-10-01 22:12:28,581 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 22:12:28,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:12:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 22:12:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-01 22:12:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 22:12:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2019-10-01 22:12:28,588 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 314 [2019-10-01 22:12:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:12:28,588 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2019-10-01 22:12:28,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 22:12:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2019-10-01 22:12:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-01 22:12:28,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:12:28,590 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 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:12:28,591 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:12:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:12:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1514442587, now seen corresponding path program 65 times [2019-10-01 22:12:28,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:12:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:12:28,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:28,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:12:28,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:12:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:12:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8548 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 22:12:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:12:30,379 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:12:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1