java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy6_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:43:08,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:43:08,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:43:08,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:43:08,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:43:08,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:43:08,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:43:08,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:43:08,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:43:08,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:43:08,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:43:08,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:43:08,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:43:08,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:43:08,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:43:08,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:43:08,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:43:08,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:43:08,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:43:08,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:43:08,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:43:08,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:43:08,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:43:08,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:43:08,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:43:08,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:43:08,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:43:08,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:43:08,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:43:08,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:43:08,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:43:08,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:43:08,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:43:08,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:43:08,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:43:08,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:43:08,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:43:08,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:43:08,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:43:08,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:43:08,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:43:08,656 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:43:08,686 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:43:08,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:43:08,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:43:08,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:43:08,688 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:43:08,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:43:08,689 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:43:08,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:43:08,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:43:08,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:43:08,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:43:08,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:43:08,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:43:08,690 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:43:08,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:43:08,690 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:43:08,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:43:08,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:43:08,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:43:08,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:43:08,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:43:08,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:43:08,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:43:08,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:43:08,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:43:08,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:43:08,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:43:08,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:43:08,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:43:08,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:43:08,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:43:08,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:43:08,743 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:43:08,744 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:43:08,745 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy6_ground-2.i [2019-10-01 22:43:08,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd9ebb92/70122076d1d441fa8ce83a26debb2e37/FLAG2fe695a9b [2019-10-01 22:43:09,295 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:43:09,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy6_ground-2.i [2019-10-01 22:43:09,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd9ebb92/70122076d1d441fa8ce83a26debb2e37/FLAG2fe695a9b [2019-10-01 22:43:09,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd9ebb92/70122076d1d441fa8ce83a26debb2e37 [2019-10-01 22:43:09,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:43:09,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:43:09,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:43:09,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:43:09,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:43:09,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:09,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa71a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09, skipping insertion in model container [2019-10-01 22:43:09,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:09,705 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:43:09,724 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:43:09,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:43:09,938 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:43:09,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:43:09,983 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:43:09,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09 WrapperNode [2019-10-01 22:43:09,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:43:09,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:43:09,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:43:09,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:43:10,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:10,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:10,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:10,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:10,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:10,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:10,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (1/1) ... [2019-10-01 22:43:10,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:43:10,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:43:10,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:43:10,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:43:10,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (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:43:10,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:43:10,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:43:10,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:43:10,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:43:10,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:43:10,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:43:10,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:43:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:43:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:43:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:43:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:43:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:43:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:43:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:43:10,557 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:43:10,558 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-01 22:43:10,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:43:10 BoogieIcfgContainer [2019-10-01 22:43:10,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:43:10,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:43:10,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:43:10,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:43:10,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:43:09" (1/3) ... [2019-10-01 22:43:10,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f6516b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:43:10, skipping insertion in model container [2019-10-01 22:43:10,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:43:09" (2/3) ... [2019-10-01 22:43:10,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f6516b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:43:10, skipping insertion in model container [2019-10-01 22:43:10,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:43:10" (3/3) ... [2019-10-01 22:43:10,579 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy6_ground-2.i [2019-10-01 22:43:10,590 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:43:10,597 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:43:10,613 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:43:10,637 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:43:10,638 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:43:10,638 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:43:10,638 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:43:10,639 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:43:10,639 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:43:10,639 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:43:10,639 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:43:10,639 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:43:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-01 22:43:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:43:10,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:10,662 INFO L411 BasicCegarLoop]: trace histogram [1, 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:43:10,664 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash 772526198, now seen corresponding path program 1 times [2019-10-01 22:43:10,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:10,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:10,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:43:10,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:43:10,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:43:10,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:43:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:43:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:43:10,856 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2019-10-01 22:43:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:10,885 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2019-10-01 22:43:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:43:10,886 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2019-10-01 22:43:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:10,895 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:43:10,896 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 22:43:10,899 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:43:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 22:43:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-01 22:43:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:43:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-01 22:43:10,938 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2019-10-01 22:43:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:10,938 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-01 22:43:10,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:43:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-01 22:43:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:43:10,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:10,940 INFO L411 BasicCegarLoop]: trace histogram [1, 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:43:10,941 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:10,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:10,941 INFO L82 PathProgramCache]: Analyzing trace with hash 514335338, now seen corresponding path program 1 times [2019-10-01 22:43:10,942 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:10,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:10,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:43:11,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:43:11,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:43:11,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:43:11,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:43:11,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:43:11,036 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 3 states. [2019-10-01 22:43:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:11,074 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-10-01 22:43:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:43:11,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-01 22:43:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:11,076 INFO L225 Difference]: With dead ends: 68 [2019-10-01 22:43:11,077 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:43:11,078 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:43:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:43:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-10-01 22:43:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-01 22:43:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-01 22:43:11,086 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 25 [2019-10-01 22:43:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:11,087 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-01 22:43:11,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:43:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-01 22:43:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:43:11,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:11,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 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:43:11,089 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1148318088, now seen corresponding path program 1 times [2019-10-01 22:43:11,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:11,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:11,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:11,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:11,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:43:11,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:43:11,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:43:11,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:43:11,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:43:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:43:11,171 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2019-10-01 22:43:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:11,291 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-10-01 22:43:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:43:11,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-01 22:43:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:11,294 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:43:11,295 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:43:11,296 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:43:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:43:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-10-01 22:43:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:43:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-10-01 22:43:11,313 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 27 [2019-10-01 22:43:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:11,314 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-10-01 22:43:11,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:43:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-10-01 22:43:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:43:11,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:11,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:11,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:11,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash 342802812, now seen corresponding path program 1 times [2019-10-01 22:43:11,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:11,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:11,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:11,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:43:11,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:11,420 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:43:11,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:11,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:43:11,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:43:11,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:11,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:43:11,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:43:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:43:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:43:11,543 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 5 states. [2019-10-01 22:43:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:11,609 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2019-10-01 22:43:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:43:11,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-01 22:43:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:11,612 INFO L225 Difference]: With dead ends: 82 [2019-10-01 22:43:11,612 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 22:43:11,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:43:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 22:43:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-01 22:43:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 22:43:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-10-01 22:43:11,622 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 39 [2019-10-01 22:43:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:11,623 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-10-01 22:43:11,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:43:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-10-01 22:43:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 22:43:11,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:11,625 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:11,625 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:11,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash -652688358, now seen corresponding path program 2 times [2019-10-01 22:43:11,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:11,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:11,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:11,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:43:11,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:11,744 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:43:11,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:43:11,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:43:11,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:11,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:43:11,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:43:11,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:11,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-01 22:43:11,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:43:11,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:43:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:43:11,849 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2019-10-01 22:43:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:12,053 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2019-10-01 22:43:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:43:12,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-01 22:43:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:12,055 INFO L225 Difference]: With dead ends: 102 [2019-10-01 22:43:12,057 INFO L226 Difference]: Without dead ends: 67 [2019-10-01 22:43:12,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:43:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-01 22:43:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-10-01 22:43:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 22:43:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2019-10-01 22:43:12,075 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 41 [2019-10-01 22:43:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:12,075 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2019-10-01 22:43:12,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:43:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2019-10-01 22:43:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:43:12,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:12,077 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:43:12,078 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1846488876, now seen corresponding path program 3 times [2019-10-01 22:43:12,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:12,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:12,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 22:43:12,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:12,235 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:43:12,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:43:12,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:43:12,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:12,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:43:12,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:43:12,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:12,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 22:43:12,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:43:12,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:43:12,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:43:12,353 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 9 states. [2019-10-01 22:43:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:12,559 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2019-10-01 22:43:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:43:12,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-01 22:43:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:12,561 INFO L225 Difference]: With dead ends: 128 [2019-10-01 22:43:12,562 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 22:43:12,562 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:43:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 22:43:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2019-10-01 22:43:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 22:43:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-10-01 22:43:12,572 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 55 [2019-10-01 22:43:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:12,572 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-10-01 22:43:12,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:43:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-10-01 22:43:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 22:43:12,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:12,574 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1] [2019-10-01 22:43:12,575 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash -588229954, now seen corresponding path program 4 times [2019-10-01 22:43:12,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:12,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:12,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-01 22:43:12,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:12,713 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:43:12,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:12,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:43:12,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:12,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:43:12,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:43:12,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:12,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:43:12,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:43:12,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:43:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:43:12,826 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 8 states. [2019-10-01 22:43:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:12,883 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-10-01 22:43:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:43:12,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-10-01 22:43:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:12,885 INFO L225 Difference]: With dead ends: 136 [2019-10-01 22:43:12,885 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 22:43:12,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 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:43:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 22:43:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-10-01 22:43:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-01 22:43:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-10-01 22:43:12,897 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 69 [2019-10-01 22:43:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:12,897 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-10-01 22:43:12,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:43:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-10-01 22:43:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 22:43:12,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:12,899 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 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, 1, 1, 1] [2019-10-01 22:43:12,903 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1431727324, now seen corresponding path program 5 times [2019-10-01 22:43:12,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:12,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:12,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:12,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-01 22:43:13,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:13,054 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:43:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:43:15,925 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:43:15,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:15,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:43:15,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-01 22:43:16,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:16,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-01 22:43:16,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:43:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:43:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:43:16,006 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 12 states. [2019-10-01 22:43:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:16,240 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2019-10-01 22:43:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:43:16,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-10-01 22:43:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:16,243 INFO L225 Difference]: With dead ends: 156 [2019-10-01 22:43:16,244 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 22:43:16,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:43:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 22:43:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2019-10-01 22:43:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-01 22:43:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-10-01 22:43:16,266 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 71 [2019-10-01 22:43:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:16,272 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-10-01 22:43:16,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:43:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-10-01 22:43:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 22:43:16,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:16,274 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 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:43:16,274 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash 868637806, now seen corresponding path program 6 times [2019-10-01 22:43:16,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:16,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:16,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:16,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:16,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-01 22:43:16,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:16,446 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) [2019-10-01 22:43:16,478 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:16,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:43:16,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:16,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:43:16,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-01 22:43:16,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:16,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-10-01 22:43:16,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:43:16,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:43:16,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:43:16,923 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 14 states. [2019-10-01 22:43:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:17,136 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2019-10-01 22:43:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:43:17,136 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2019-10-01 22:43:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:17,137 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:43:17,138 INFO L226 Difference]: Without dead ends: 111 [2019-10-01 22:43:17,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:43:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-01 22:43:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2019-10-01 22:43:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 22:43:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-10-01 22:43:17,148 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 85 [2019-10-01 22:43:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:17,148 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-10-01 22:43:17,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:43:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-10-01 22:43:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 22:43:17,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:17,151 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 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:43:17,151 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash -419486592, now seen corresponding path program 7 times [2019-10-01 22:43:17,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:17,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:17,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-01 22:43:17,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:17,259 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) [2019-10-01 22:43:17,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:17,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:43:17,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-01 22:43:17,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:17,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:43:17,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:43:17,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:43:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:43:17,406 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 11 states. [2019-10-01 22:43:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:17,443 INFO L93 Difference]: Finished difference Result 190 states and 204 transitions. [2019-10-01 22:43:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:43:17,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-10-01 22:43:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:17,445 INFO L225 Difference]: With dead ends: 190 [2019-10-01 22:43:17,445 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 22:43:17,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 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:43:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 22:43:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-10-01 22:43:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 22:43:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-10-01 22:43:17,471 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 99 [2019-10-01 22:43:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:17,472 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-10-01 22:43:17,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:43:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-10-01 22:43:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 22:43:17,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:17,477 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 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:43:17,477 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1082340894, now seen corresponding path program 8 times [2019-10-01 22:43:17,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:17,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-01 22:43:17,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:17,637 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:43:17,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:43:17,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:43:17,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:17,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:43:17,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-01 22:43:17,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:17,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:43:17,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:43:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:43:17,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:43:17,760 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 12 states. [2019-10-01 22:43:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:17,825 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2019-10-01 22:43:17,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:43:17,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-01 22:43:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:17,829 INFO L225 Difference]: With dead ends: 192 [2019-10-01 22:43:17,829 INFO L226 Difference]: Without dead ends: 109 [2019-10-01 22:43:17,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 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:43:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-01 22:43:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-10-01 22:43:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-01 22:43:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-10-01 22:43:17,852 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 101 [2019-10-01 22:43:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:17,853 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-10-01 22:43:17,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:43:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-10-01 22:43:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 22:43:17,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:17,859 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 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:43:17,859 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1229543484, now seen corresponding path program 9 times [2019-10-01 22:43:17,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:17,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:17,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-01 22:43:17,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:17,998 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) [2019-10-01 22:43:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:19,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:43:19,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:19,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:43:19,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 26 proven. 25 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-01 22:43:19,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:19,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-10-01 22:43:19,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:43:19,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:43:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:43:19,731 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 22 states. [2019-10-01 22:43:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:20,154 INFO L93 Difference]: Finished difference Result 219 states and 246 transitions. [2019-10-01 22:43:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:43:20,155 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2019-10-01 22:43:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:20,156 INFO L225 Difference]: With dead ends: 219 [2019-10-01 22:43:20,156 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 22:43:20,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:43:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 22:43:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-10-01 22:43:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-01 22:43:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2019-10-01 22:43:20,167 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 103 [2019-10-01 22:43:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:20,168 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2019-10-01 22:43:20,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:43:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2019-10-01 22:43:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 22:43:20,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:20,170 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 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:43:20,171 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:20,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:20,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2013577248, now seen corresponding path program 10 times [2019-10-01 22:43:20,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:20,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:20,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-01 22:43:20,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:20,380 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:43:20,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:43:20,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:43:20,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:20,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:43:20,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-01 22:43:20,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:20,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:43:20,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:43:20,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:43:20,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:43:20,525 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand 15 states. [2019-10-01 22:43:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:20,576 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2019-10-01 22:43:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:43:20,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 131 [2019-10-01 22:43:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:20,578 INFO L225 Difference]: With dead ends: 246 [2019-10-01 22:43:20,578 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 22:43:20,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:43:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 22:43:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-10-01 22:43:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-01 22:43:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2019-10-01 22:43:20,587 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 131 [2019-10-01 22:43:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:20,588 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2019-10-01 22:43:20,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:43:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2019-10-01 22:43:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-01 22:43:20,589 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:20,589 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 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:43:20,590 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash -803120770, now seen corresponding path program 11 times [2019-10-01 22:43:20,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:20,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:20,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:20,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-01 22:43:20,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:20,781 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:43:20,805 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:44:17,921 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 22:44:17,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:17,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:44:17,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-10-01 22:44:18,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:18,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2019-10-01 22:44:18,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:44:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:44:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:44:18,127 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 23 states. [2019-10-01 22:44:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:18,410 INFO L93 Difference]: Finished difference Result 266 states and 286 transitions. [2019-10-01 22:44:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:44:18,411 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-10-01 22:44:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:18,412 INFO L225 Difference]: With dead ends: 266 [2019-10-01 22:44:18,413 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 22:44:18,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:44:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 22:44:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2019-10-01 22:44:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-01 22:44:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2019-10-01 22:44:18,420 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 133 [2019-10-01 22:44:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:18,421 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2019-10-01 22:44:18,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:44:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2019-10-01 22:44:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 22:44:18,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:18,423 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 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:44:18,423 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:18,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:18,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1324382832, now seen corresponding path program 12 times [2019-10-01 22:44:18,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:18,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:18,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-10-01 22:44:18,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:18,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:44:18,634 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:54,777 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-10-01 22:44:54,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:54,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:44:54,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 55 proven. 64 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-10-01 22:44:55,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:55,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-10-01 22:44:55,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:44:55,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:44:55,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:44:55,029 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 29 states. [2019-10-01 22:44:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:55,640 INFO L93 Difference]: Finished difference Result 299 states and 326 transitions. [2019-10-01 22:44:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:44:55,640 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 147 [2019-10-01 22:44:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:55,642 INFO L225 Difference]: With dead ends: 299 [2019-10-01 22:44:55,642 INFO L226 Difference]: Without dead ends: 180 [2019-10-01 22:44:55,643 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:44:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-01 22:44:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-10-01 22:44:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-01 22:44:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2019-10-01 22:44:55,651 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 147 [2019-10-01 22:44:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:55,652 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2019-10-01 22:44:55,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:44:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2019-10-01 22:44:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-01 22:44:55,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:55,654 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 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:44:55,654 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:55,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -183638220, now seen corresponding path program 13 times [2019-10-01 22:44:55,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:55,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:55,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-01 22:44:55,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:55,917 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:55,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:56,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:44:56,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-01 22:44:56,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:56,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:44:56,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:44:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:44:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:44:56,133 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand 19 states. [2019-10-01 22:44:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:56,261 INFO L93 Difference]: Finished difference Result 326 states and 340 transitions. [2019-10-01 22:44:56,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:44:56,262 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 175 [2019-10-01 22:44:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:56,263 INFO L225 Difference]: With dead ends: 326 [2019-10-01 22:44:56,263 INFO L226 Difference]: Without dead ends: 183 [2019-10-01 22:44:56,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:44:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-01 22:44:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-10-01 22:44:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-01 22:44:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions. [2019-10-01 22:44:56,273 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 175 [2019-10-01 22:44:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:56,274 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions. [2019-10-01 22:44:56,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:44:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions. [2019-10-01 22:44:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-01 22:44:56,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:56,276 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 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:44:56,276 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1047170002, now seen corresponding path program 14 times [2019-10-01 22:44:56,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:56,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:56,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:56,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:56,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-01 22:44:56,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:56,581 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:44:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:44:56,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:44:56,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:56,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:44:56,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-01 22:44:56,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:56,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:44:56,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:44:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:44:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:44:56,743 INFO L87 Difference]: Start difference. First operand 182 states and 189 transitions. Second operand 20 states. [2019-10-01 22:44:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:56,806 INFO L93 Difference]: Finished difference Result 328 states and 342 transitions. [2019-10-01 22:44:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:44:56,810 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 177 [2019-10-01 22:44:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:56,811 INFO L225 Difference]: With dead ends: 328 [2019-10-01 22:44:56,811 INFO L226 Difference]: Without dead ends: 185 [2019-10-01 22:44:56,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 177 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:44:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-01 22:44:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-10-01 22:44:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-01 22:44:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 191 transitions. [2019-10-01 22:44:56,820 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 191 transitions. Word has length 177 [2019-10-01 22:44:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:56,820 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 191 transitions. [2019-10-01 22:44:56,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:44:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 191 transitions. [2019-10-01 22:44:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-01 22:44:56,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:56,822 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 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:44:56,822 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1557102352, now seen corresponding path program 15 times [2019-10-01 22:44:56,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:56,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:56,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-01 22:44:57,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:57,084 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:44:57,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:45:40,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 22:45:40,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:45:40,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:45:40,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 128 proven. 100 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2019-10-01 22:45:40,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:40,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-10-01 22:45:40,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:45:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:45:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=855, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:45:40,902 INFO L87 Difference]: Start difference. First operand 184 states and 191 transitions. Second operand 35 states. [2019-10-01 22:45:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:41,696 INFO L93 Difference]: Finished difference Result 355 states and 382 transitions. [2019-10-01 22:45:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:45:41,696 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 179 [2019-10-01 22:45:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:41,697 INFO L225 Difference]: With dead ends: 355 [2019-10-01 22:45:41,697 INFO L226 Difference]: Without dead ends: 212 [2019-10-01 22:45:41,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:45:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-01 22:45:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-10-01 22:45:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-01 22:45:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 219 transitions. [2019-10-01 22:45:41,709 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 219 transitions. Word has length 179 [2019-10-01 22:45:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:41,710 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 219 transitions. [2019-10-01 22:45:41,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:45:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 219 transitions. [2019-10-01 22:45:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-01 22:45:41,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:41,712 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 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:45:41,713 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash 113250964, now seen corresponding path program 16 times [2019-10-01 22:45:41,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:41,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:41,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:45:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-01 22:45:42,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:42,066 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:45:42,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:45:42,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:45:42,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:45:42,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:45:42,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-01 22:45:42,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:42,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:45:42,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:45:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:45:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:45:42,231 INFO L87 Difference]: Start difference. First operand 212 states and 219 transitions. Second operand 23 states. [2019-10-01 22:45:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:42,331 INFO L93 Difference]: Finished difference Result 382 states and 396 transitions. [2019-10-01 22:45:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:45:42,332 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 207 [2019-10-01 22:45:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:42,333 INFO L225 Difference]: With dead ends: 382 [2019-10-01 22:45:42,333 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 22:45:42,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:45:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 22:45:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-10-01 22:45:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-01 22:45:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 221 transitions. [2019-10-01 22:45:42,344 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 221 transitions. Word has length 207 [2019-10-01 22:45:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:42,344 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 221 transitions. [2019-10-01 22:45:42,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:45:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 221 transitions. [2019-10-01 22:45:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-01 22:45:42,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:42,346 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 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:45:42,346 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1078804686, now seen corresponding path program 17 times [2019-10-01 22:45:42,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:42,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:42,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:45:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-01 22:45:42,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:42,814 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:45:42,860 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:47:35,267 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-01 22:47:35,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:47:35,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:47:35,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:47:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2019-10-01 22:47:35,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:47:35,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 36 [2019-10-01 22:47:35,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:47:35,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:47:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:47:35,724 INFO L87 Difference]: Start difference. First operand 214 states and 221 transitions. Second operand 36 states. [2019-10-01 22:47:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:47:36,387 INFO L93 Difference]: Finished difference Result 402 states and 422 transitions. [2019-10-01 22:47:36,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:47:36,388 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 209 [2019-10-01 22:47:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:47:36,390 INFO L225 Difference]: With dead ends: 402 [2019-10-01 22:47:36,390 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 22:47:36,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:47:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 22:47:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 228. [2019-10-01 22:47:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-01 22:47:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 235 transitions. [2019-10-01 22:47:36,405 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 235 transitions. Word has length 209 [2019-10-01 22:47:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:47:36,405 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 235 transitions. [2019-10-01 22:47:36,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:47:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 235 transitions. [2019-10-01 22:47:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-01 22:47:36,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:47:36,408 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 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:47:36,408 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:47:36,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:47:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 477716548, now seen corresponding path program 18 times [2019-10-01 22:47:36,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:47:36,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:47:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:36,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:47:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:47:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-10-01 22:47:36,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:47:36,869 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:47:36,910 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:49:43,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-10-01 22:49:43,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:49:43,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:49:43,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:49:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1286 trivial. 0 not checked. [2019-10-01 22:49:43,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:49:43,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2019-10-01 22:49:43,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:49:43,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:49:43,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:49:43,766 INFO L87 Difference]: Start difference. First operand 228 states and 235 transitions. Second operand 38 states. [2019-10-01 22:49:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:49:44,350 INFO L93 Difference]: Finished difference Result 428 states and 448 transitions. [2019-10-01 22:49:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:49:44,351 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 223 [2019-10-01 22:49:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:49:44,353 INFO L225 Difference]: With dead ends: 428 [2019-10-01 22:49:44,353 INFO L226 Difference]: Without dead ends: 249 [2019-10-01 22:49:44,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:49:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-01 22:49:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 242. [2019-10-01 22:49:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-01 22:49:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 249 transitions. [2019-10-01 22:49:44,363 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 249 transitions. Word has length 223 [2019-10-01 22:49:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:49:44,364 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 249 transitions. [2019-10-01 22:49:44,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:49:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 249 transitions. [2019-10-01 22:49:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-01 22:49:44,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:49:44,366 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 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:49:44,366 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:49:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:49:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1094990294, now seen corresponding path program 19 times [2019-10-01 22:49:44,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:49:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:49:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:44,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:49:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:49:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-10-01 22:49:44,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:49:44,824 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:49:44,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:49:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:49:44,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:49:44,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:49:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-10-01 22:49:45,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:49:45,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:49:45,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:49:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:49:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:49:45,077 INFO L87 Difference]: Start difference. First operand 242 states and 249 transitions. Second operand 26 states. [2019-10-01 22:49:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:49:45,182 INFO L93 Difference]: Finished difference Result 436 states and 450 transitions. [2019-10-01 22:49:45,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:49:45,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 237 [2019-10-01 22:49:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:49:45,184 INFO L225 Difference]: With dead ends: 436 [2019-10-01 22:49:45,184 INFO L226 Difference]: Without dead ends: 245 [2019-10-01 22:49:45,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:49:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-01 22:49:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-10-01 22:49:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-01 22:49:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 251 transitions. [2019-10-01 22:49:45,196 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 251 transitions. Word has length 237 [2019-10-01 22:49:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:49:45,196 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 251 transitions. [2019-10-01 22:49:45,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:49:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-10-01 22:49:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-01 22:49:45,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:49:45,199 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 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:49:45,199 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:49:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:49:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1796375052, now seen corresponding path program 20 times [2019-10-01 22:49:45,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:49:45,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:49:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:45,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:49:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:49:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-10-01 22:49:45,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:49:45,612 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:49:45,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:49:45,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:49:45,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:49:45,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:49:45,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:49:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-10-01 22:49:45,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:49:45,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 22:49:45,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:49:45,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:49:45,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:49:45,830 INFO L87 Difference]: Start difference. First operand 244 states and 251 transitions. Second operand 27 states. [2019-10-01 22:49:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:49:45,919 INFO L93 Difference]: Finished difference Result 438 states and 452 transitions. [2019-10-01 22:49:45,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:49:45,919 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 239 [2019-10-01 22:49:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:49:45,921 INFO L225 Difference]: With dead ends: 438 [2019-10-01 22:49:45,921 INFO L226 Difference]: Without dead ends: 247 [2019-10-01 22:49:45,922 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:49:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-01 22:49:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2019-10-01 22:49:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-01 22:49:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 253 transitions. [2019-10-01 22:49:45,932 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 253 transitions. Word has length 239 [2019-10-01 22:49:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:49:45,932 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 253 transitions. [2019-10-01 22:49:45,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:49:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 253 transitions. [2019-10-01 22:49:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-01 22:49:45,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:49:45,934 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 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:49:45,934 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:49:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:49:45,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1554632046, now seen corresponding path program 21 times [2019-10-01 22:49:45,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:49:45,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:49:45,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:45,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:49:45,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:49:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-10-01 22:49:46,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:49:46,578 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:49:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:51:19,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 22:51:19,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:51:19,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:51:19,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 54 proven. 196 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2019-10-01 22:51:20,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:20,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 44 [2019-10-01 22:51:20,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:51:20,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:51:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=1371, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:51:20,317 INFO L87 Difference]: Start difference. First operand 246 states and 253 transitions. Second operand 44 states. [2019-10-01 22:51:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:21,190 INFO L93 Difference]: Finished difference Result 464 states and 490 transitions. [2019-10-01 22:51:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 22:51:21,190 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 241 [2019-10-01 22:51:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:21,193 INFO L225 Difference]: With dead ends: 464 [2019-10-01 22:51:21,193 INFO L226 Difference]: Without dead ends: 273 [2019-10-01 22:51:21,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=521, Invalid=1371, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:51:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-01 22:51:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2019-10-01 22:51:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-01 22:51:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 279 transitions. [2019-10-01 22:51:21,204 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 279 transitions. Word has length 241 [2019-10-01 22:51:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:21,204 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 279 transitions. [2019-10-01 22:51:21,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:51:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 279 transitions. [2019-10-01 22:51:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-01 22:51:21,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:21,206 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 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:51:21,206 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:21,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1556930152, now seen corresponding path program 22 times [2019-10-01 22:51:21,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:21,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:21,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:51:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2161 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2019-10-01 22:51:21,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:21,688 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:51:21,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:51:21,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:51:21,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:51:21,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:51:21,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2161 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 1905 trivial. 0 not checked. [2019-10-01 22:51:22,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:22,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 45 [2019-10-01 22:51:22,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:51:22,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:51:22,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=1432, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:51:22,282 INFO L87 Difference]: Start difference. First operand 272 states and 279 transitions. Second operand 45 states. [2019-10-01 22:51:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:23,002 INFO L93 Difference]: Finished difference Result 508 states and 528 transitions. [2019-10-01 22:51:23,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:51:23,002 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 267 [2019-10-01 22:51:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:23,003 INFO L225 Difference]: With dead ends: 508 [2019-10-01 22:51:23,004 INFO L226 Difference]: Without dead ends: 293 [2019-10-01 22:51:23,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=548, Invalid=1432, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:51:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-01 22:51:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 286. [2019-10-01 22:51:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-01 22:51:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 293 transitions. [2019-10-01 22:51:23,014 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 293 transitions. Word has length 267 [2019-10-01 22:51:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:23,015 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 293 transitions. [2019-10-01 22:51:23,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:51:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 293 transitions. [2019-10-01 22:51:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-01 22:51:23,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:23,017 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 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:51:23,017 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:23,018 INFO L82 PathProgramCache]: Analyzing trace with hash -343631830, now seen corresponding path program 23 times [2019-10-01 22:51:23,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:23,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:23,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:51:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2410 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1734 trivial. 0 not checked. [2019-10-01 22:51:23,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:23,576 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:51:23,622 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:54:27,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-01 22:54:27,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:54:27,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:54:27,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:54:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2410 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2121 trivial. 0 not checked. [2019-10-01 22:54:28,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:54:28,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20] total 47 [2019-10-01 22:54:28,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:54:28,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:54:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1567, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:54:28,277 INFO L87 Difference]: Start difference. First operand 286 states and 293 transitions. Second operand 47 states. [2019-10-01 22:54:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:54:29,115 INFO L93 Difference]: Finished difference Result 534 states and 554 transitions. [2019-10-01 22:54:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:54:29,115 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 281 [2019-10-01 22:54:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:54:29,117 INFO L225 Difference]: With dead ends: 534 [2019-10-01 22:54:29,117 INFO L226 Difference]: Without dead ends: 307 [2019-10-01 22:54:29,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=1567, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:54:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-01 22:54:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 300. [2019-10-01 22:54:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-01 22:54:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 307 transitions. [2019-10-01 22:54:29,128 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 307 transitions. Word has length 281 [2019-10-01 22:54:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:54:29,128 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 307 transitions. [2019-10-01 22:54:29,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:54:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 307 transitions. [2019-10-01 22:54:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-01 22:54:29,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:54:29,131 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 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:54:29,131 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:54:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:54:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash 599172924, now seen corresponding path program 24 times [2019-10-01 22:54:29,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:54:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:54:29,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:29,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:54:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:54:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2019-10-01 22:54:30,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:54:30,263 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:54:30,312 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:57:42,723 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-10-01 22:57:42,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:42,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 22:57:42,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 158 proven. 324 refuted. 0 times theorem prover too weak. 2191 trivial. 0 not checked. [2019-10-01 22:57:43,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 53 [2019-10-01 22:57:43,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:57:43,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:57:43,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=2008, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:57:43,374 INFO L87 Difference]: Start difference. First operand 300 states and 307 transitions. Second operand 53 states.