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/reducercommutativity/sep40-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:16:14,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:16:14,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:16:14,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:16:14,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:16:14,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:16:14,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:16:14,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:16:14,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:16:14,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:16:14,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:16:14,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:16:14,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:16:14,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:16:14,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:16:14,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:16:14,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:16:14,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:16:14,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:16:14,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:16:14,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:16:14,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:16:14,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:16:14,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:16:14,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:16:14,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:16:14,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:16:14,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:16:14,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:16:14,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:16:14,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:16:14,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:16:14,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:16:14,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:16:14,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:16:14,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:16:14,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:16:14,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:16:14,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:16:14,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:16:14,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:16:14,072 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:16:14,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:16:14,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:16:14,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:16:14,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:16:14,101 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:16:14,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:16:14,101 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:16:14,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:16:14,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:16:14,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:16:14,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:16:14,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:16:14,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:16:14,104 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:16:14,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:16:14,104 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:16:14,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:16:14,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:16:14,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:16:14,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:16:14,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:16:14,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:16:14,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:16:14,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:16:14,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:16:14,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:16:14,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:16:14,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:16:14,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:16:14,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:16:14,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:16:14,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:16:14,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:16:14,167 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:16:14,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep40-1.i [2019-09-07 11:16:14,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972364b35/6118c1d8525f49ee90f9a6e9e1ec678b/FLAGf0ac402a1 [2019-09-07 11:16:14,743 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:16:14,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep40-1.i [2019-09-07 11:16:14,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972364b35/6118c1d8525f49ee90f9a6e9e1ec678b/FLAGf0ac402a1 [2019-09-07 11:16:15,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972364b35/6118c1d8525f49ee90f9a6e9e1ec678b [2019-09-07 11:16:15,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:16:15,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:16:15,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:16:15,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:16:15,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:16:15,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6dcc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15, skipping insertion in model container [2019-09-07 11:16:15,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,118 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:16:15,135 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:16:15,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:16:15,310 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:16:15,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:16:15,355 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:16:15,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15 WrapperNode [2019-09-07 11:16:15,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:16:15,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:16:15,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:16:15,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:16:15,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... [2019-09-07 11:16:15,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:16:15,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:16:15,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:16:15,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:16:15,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:16:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:16:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:16:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-09-07 11:16:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:16:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:16:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:16:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-09-07 11:16:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:16:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:16:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:16:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:16:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:16:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:16:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:16:15,906 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:16:15,906 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:16:15,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:16:15 BoogieIcfgContainer [2019-09-07 11:16:15,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:16:15,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:16:15,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:16:15,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:16:15,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:16:15" (1/3) ... [2019-09-07 11:16:15,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89e41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:16:15, skipping insertion in model container [2019-09-07 11:16:15,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:16:15" (2/3) ... [2019-09-07 11:16:15,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89e41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:16:15, skipping insertion in model container [2019-09-07 11:16:15,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:16:15" (3/3) ... [2019-09-07 11:16:15,925 INFO L109 eAbstractionObserver]: Analyzing ICFG sep40-1.i [2019-09-07 11:16:15,935 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:16:15,946 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:16:15,961 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:16:15,992 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:16:15,993 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:16:15,993 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:16:15,993 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:16:15,993 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:16:15,993 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:16:15,994 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:16:15,994 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:16:15,994 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:16:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-07 11:16:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:16:16,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:16,018 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:16,020 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2019-09-07 11:16:16,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:16,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:16,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:16:16,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:16:16,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:16:16,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:16:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:16:16,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:16:16,206 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-07 11:16:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:16,230 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-09-07 11:16:16,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:16:16,231 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-07 11:16:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:16,240 INFO L225 Difference]: With dead ends: 56 [2019-09-07 11:16:16,241 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 11:16:16,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:16:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 11:16:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-07 11:16:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 11:16:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-09-07 11:16:16,290 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2019-09-07 11:16:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:16,291 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-09-07 11:16:16,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:16:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-09-07 11:16:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:16:16,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:16,294 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:16,294 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2019-09-07 11:16:16,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:16,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:16:16,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:16:16,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:16:16,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:16:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:16:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:16:16,371 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-09-07 11:16:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:16,399 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-09-07 11:16:16,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:16:16,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 11:16:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:16,401 INFO L225 Difference]: With dead ends: 48 [2019-09-07 11:16:16,401 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 11:16:16,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:16:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 11:16:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 11:16:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 11:16:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-07 11:16:16,411 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2019-09-07 11:16:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:16,411 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-07 11:16:16,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:16:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-07 11:16:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:16:16,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:16,414 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:16,414 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:16,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2019-09-07 11:16:16,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:16,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:16:16,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:16,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:16,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:16,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:16:16,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:16:16,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:16:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 11:16:16,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:16:16,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:16:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:16:16,639 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-09-07 11:16:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:16,670 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-09-07 11:16:16,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:16:16,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 11:16:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:16,672 INFO L225 Difference]: With dead ends: 49 [2019-09-07 11:16:16,673 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 11:16:16,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:16:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 11:16:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-07 11:16:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 11:16:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-09-07 11:16:16,680 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2019-09-07 11:16:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:16,681 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-09-07 11:16:16,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:16:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-09-07 11:16:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 11:16:16,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:16,683 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:16,684 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2019-09-07 11:16:16,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:16,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:16,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:16:16,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:16:16,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:16:16,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:16:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:16:16,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:16:16,798 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-09-07 11:16:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:16,824 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-09-07 11:16:16,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:16:16,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-07 11:16:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:16,827 INFO L225 Difference]: With dead ends: 45 [2019-09-07 11:16:16,827 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 11:16:16,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:16:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 11:16:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-07 11:16:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 11:16:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-07 11:16:16,843 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2019-09-07 11:16:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:16,847 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-07 11:16:16,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:16:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-07 11:16:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 11:16:16,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:16,852 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 11:16:16,853 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2019-09-07 11:16:16,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:16,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:16:16,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:16,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:16,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:17,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:16:17,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:16:17,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:17,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 11:16:17,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:16:17,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:16:17,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:16:17,079 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-09-07 11:16:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:17,106 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-09-07 11:16:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:16:17,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 11:16:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:17,107 INFO L225 Difference]: With dead ends: 54 [2019-09-07 11:16:17,108 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 11:16:17,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:16:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 11:16:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 11:16:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 11:16:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-07 11:16:17,117 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2019-09-07 11:16:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:17,117 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-07 11:16:17,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:16:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-07 11:16:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 11:16:17,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:17,122 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:17,122 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2019-09-07 11:16:17,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:17,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 11:16:17,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:17,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:17,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:16:17,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:16:17,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:17,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:16:17,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:16:17,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:17,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 11:16:17,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:16:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:16:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:17,378 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2019-09-07 11:16:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:17,446 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-09-07 11:16:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:16:17,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-09-07 11:16:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:17,448 INFO L225 Difference]: With dead ends: 61 [2019-09-07 11:16:17,448 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 11:16:17,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 11:16:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-09-07 11:16:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 11:16:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-09-07 11:16:17,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 47 [2019-09-07 11:16:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:17,456 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-09-07 11:16:17,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:16:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-09-07 11:16:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 11:16:17,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:17,458 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:17,458 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1057089466, now seen corresponding path program 3 times [2019-09-07 11:16:17,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:17,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-07 11:16:17,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:17,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:17,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:16:17,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:16:17,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:17,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:16:17,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 11:16:17,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:17,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-07 11:16:17,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:16:17,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:16:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:17,640 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 7 states. [2019-09-07 11:16:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:17,706 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-09-07 11:16:17,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:16:17,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-07 11:16:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:17,708 INFO L225 Difference]: With dead ends: 68 [2019-09-07 11:16:17,708 INFO L226 Difference]: Without dead ends: 45 [2019-09-07 11:16:17,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 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-09-07 11:16:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-07 11:16:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-09-07 11:16:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 11:16:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-09-07 11:16:17,720 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 58 [2019-09-07 11:16:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:17,720 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-09-07 11:16:17,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:16:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-09-07 11:16:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 11:16:17,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:17,722 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:17,722 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:17,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash -515095459, now seen corresponding path program 4 times [2019-09-07 11:16:17,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:17,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:17,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:17,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-07 11:16:17,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:17,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:17,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:17,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:16:17,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:17,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:16:17,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-07 11:16:17,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:17,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:16:17,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:16:17,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:16:17,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:17,984 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2019-09-07 11:16:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:18,029 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-09-07 11:16:18,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:16:18,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-07 11:16:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:18,032 INFO L225 Difference]: With dead ends: 74 [2019-09-07 11:16:18,034 INFO L226 Difference]: Without dead ends: 45 [2019-09-07 11:16:18,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-07 11:16:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-07 11:16:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 11:16:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-09-07 11:16:18,049 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 69 [2019-09-07 11:16:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:18,049 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-09-07 11:16:18,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:16:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-09-07 11:16:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 11:16:18,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:18,054 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:18,054 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:18,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:18,055 INFO L82 PathProgramCache]: Analyzing trace with hash 926983675, now seen corresponding path program 5 times [2019-09-07 11:16:18,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:18,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:18,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:16:18,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:18,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:18,239 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:16:18,387 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 11:16:18,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:18,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:16:18,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:16:18,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:18,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:16:18,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:16:18,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:16:18,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:18,427 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2019-09-07 11:16:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:18,466 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2019-09-07 11:16:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:16:18,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-07 11:16:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:18,468 INFO L225 Difference]: With dead ends: 77 [2019-09-07 11:16:18,468 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 11:16:18,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 11:16:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-07 11:16:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:16:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-09-07 11:16:18,475 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 71 [2019-09-07 11:16:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:18,475 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-09-07 11:16:18,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:16:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-09-07 11:16:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 11:16:18,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:18,478 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:18,478 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:18,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1632310970, now seen corresponding path program 6 times [2019-09-07 11:16:18,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:18,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:18,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:18,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:18,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-07 11:16:18,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:18,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:18,583 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:18,660 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 11:16:18,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:18,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:16:18,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-09-07 11:16:18,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:18,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 11:16:18,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:16:18,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:16:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:16:18,705 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 6 states. [2019-09-07 11:16:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:18,745 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2019-09-07 11:16:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:16:18,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-07 11:16:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:18,749 INFO L225 Difference]: With dead ends: 73 [2019-09-07 11:16:18,749 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 11:16:18,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:16:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 11:16:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-07 11:16:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 11:16:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-09-07 11:16:18,760 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 80 [2019-09-07 11:16:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:18,761 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-09-07 11:16:18,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:16:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-09-07 11:16:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 11:16:18,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:18,763 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:18,763 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash -144412808, now seen corresponding path program 7 times [2019-09-07 11:16:18,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:18,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:18,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:18,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:18,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-07 11:16:18,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:18,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:18,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:18,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:16:18,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-07 11:16:18,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 11:16:18,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:16:18,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:16:18,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:16:18,963 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 8 states. [2019-09-07 11:16:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:19,003 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-09-07 11:16:19,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:16:19,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-07 11:16:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:19,005 INFO L225 Difference]: With dead ends: 86 [2019-09-07 11:16:19,005 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 11:16:19,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:16:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 11:16:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-07 11:16:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 11:16:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-09-07 11:16:19,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 82 [2019-09-07 11:16:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:19,013 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-09-07 11:16:19,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:16:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-09-07 11:16:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 11:16:19,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:19,015 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:19,015 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1580736154, now seen corresponding path program 8 times [2019-09-07 11:16:19,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:19,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:19,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-07 11:16:19,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:19,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:19,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:19,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:16:19,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:19,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:16:19,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-07 11:16:19,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:19,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 11:16:19,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:16:19,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:16:19,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:16:19,307 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 13 states. [2019-09-07 11:16:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:19,377 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-09-07 11:16:19,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:16:19,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2019-09-07 11:16:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:19,379 INFO L225 Difference]: With dead ends: 93 [2019-09-07 11:16:19,379 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 11:16:19,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:16:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 11:16:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-09-07 11:16:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 11:16:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-09-07 11:16:19,386 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 84 [2019-09-07 11:16:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:19,386 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-09-07 11:16:19,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:16:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-09-07 11:16:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 11:16:19,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:19,388 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:19,388 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:19,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2119079065, now seen corresponding path program 9 times [2019-09-07 11:16:19,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:19,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:19,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-09-07 11:16:19,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:19,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:16:19,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 11:16:19,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:19,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:16:19,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-07 11:16:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:16:19,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:16:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:16:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:19,589 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 7 states. [2019-09-07 11:16:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:19,616 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-09-07 11:16:19,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:16:19,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-07 11:16:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:19,618 INFO L225 Difference]: With dead ends: 85 [2019-09-07 11:16:19,618 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 11:16:19,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:16:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 11:16:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-07 11:16:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 11:16:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-09-07 11:16:19,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 95 [2019-09-07 11:16:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:19,625 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-09-07 11:16:19,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:16:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2019-09-07 11:16:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 11:16:19,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:19,627 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:19,627 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2094467301, now seen corresponding path program 10 times [2019-09-07 11:16:19,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:19,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:19,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-09-07 11:16:19,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:19,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:19,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:16:19,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:16:19,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:19,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:16:19,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 11:16:19,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:19,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 11:16:19,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:16:19,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:16:19,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:16:19,926 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 15 states. [2019-09-07 11:16:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:20,008 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2019-09-07 11:16:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:16:20,008 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-09-07 11:16:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:20,009 INFO L225 Difference]: With dead ends: 105 [2019-09-07 11:16:20,010 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 11:16:20,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:16:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 11:16:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-07 11:16:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 11:16:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-09-07 11:16:20,021 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 97 [2019-09-07 11:16:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:20,023 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-09-07 11:16:20,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:16:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-09-07 11:16:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 11:16:20,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:20,025 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 7, 7, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:20,025 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash -127140932, now seen corresponding path program 11 times [2019-09-07 11:16:20,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:20,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:20,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:20,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:20,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2019-09-07 11:16:20,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:20,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:20,204 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:20,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-07 11:16:20,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:20,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:16:20,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-09-07 11:16:20,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:20,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-07 11:16:20,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:16:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:16:20,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:16:20,604 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 14 states. [2019-09-07 11:16:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:20,663 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2019-09-07 11:16:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:16:20,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2019-09-07 11:16:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:20,665 INFO L225 Difference]: With dead ends: 112 [2019-09-07 11:16:20,665 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 11:16:20,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:16:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 11:16:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-09-07 11:16:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 11:16:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2019-09-07 11:16:20,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 108 [2019-09-07 11:16:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:20,679 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2019-09-07 11:16:20,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:16:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2019-09-07 11:16:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 11:16:20,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:20,685 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 7, 7, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:20,687 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2132592357, now seen corresponding path program 12 times [2019-09-07 11:16:20,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:20,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:20,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:20,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:20,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 11:16:20,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:20,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:20,844 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:21,046 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 11:16:21,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:21,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:16:21,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 332 proven. 25 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-07 11:16:21,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:21,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 11:16:21,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:16:21,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:16:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:16:21,092 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 9 states. [2019-09-07 11:16:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:21,121 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-09-07 11:16:21,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:16:21,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-07 11:16:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:21,123 INFO L225 Difference]: With dead ends: 103 [2019-09-07 11:16:21,123 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 11:16:21,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:16:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 11:16:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-07 11:16:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 11:16:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-09-07 11:16:21,137 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 119 [2019-09-07 11:16:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:21,137 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-09-07 11:16:21,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:16:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-09-07 11:16:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 11:16:21,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:21,140 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 7, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:21,140 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:21,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1943588451, now seen corresponding path program 13 times [2019-09-07 11:16:21,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:21,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:21,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-09-07 11:16:21,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:21,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:21,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:21,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:16:21,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:16:21,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:21,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 11:16:21,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:16:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:16:21,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:16:21,462 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 11 states. [2019-09-07 11:16:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:21,500 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2019-09-07 11:16:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:16:21,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2019-09-07 11:16:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:21,502 INFO L225 Difference]: With dead ends: 122 [2019-09-07 11:16:21,502 INFO L226 Difference]: Without dead ends: 73 [2019-09-07 11:16:21,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:16:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-07 11:16:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-09-07 11:16:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 11:16:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-09-07 11:16:21,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 121 [2019-09-07 11:16:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:21,514 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-09-07 11:16:21,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:16:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-09-07 11:16:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 11:16:21,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:21,516 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 8, 8, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:21,516 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash -141123525, now seen corresponding path program 14 times [2019-09-07 11:16:21,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:21,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:21,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:21,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:21,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 11:16:21,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:21,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:21,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:16:21,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:16:21,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:21,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:16:21,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-09-07 11:16:21,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:21,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 11:16:21,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:16:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:16:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:16:21,979 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 19 states. [2019-09-07 11:16:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:22,075 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2019-09-07 11:16:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:16:22,075 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 123 [2019-09-07 11:16:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:22,076 INFO L225 Difference]: With dead ends: 129 [2019-09-07 11:16:22,076 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 11:16:22,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:16:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 11:16:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-09-07 11:16:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 11:16:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-09-07 11:16:22,084 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 123 [2019-09-07 11:16:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:22,085 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-09-07 11:16:22,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:16:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-09-07 11:16:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 11:16:22,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:22,087 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:22,087 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash 40278300, now seen corresponding path program 15 times [2019-09-07 11:16:22,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:22,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:22,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-09-07 11:16:22,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:22,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:22,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:16:22,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:16:22,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:22,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:16:22,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 426 proven. 36 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-07 11:16:22,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:22,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 11:16:22,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:16:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:16:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:16:22,487 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 10 states. [2019-09-07 11:16:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:22,526 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2019-09-07 11:16:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:16:22,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2019-09-07 11:16:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:22,528 INFO L225 Difference]: With dead ends: 115 [2019-09-07 11:16:22,528 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 11:16:22,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:16:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 11:16:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-07 11:16:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 11:16:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2019-09-07 11:16:22,537 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 134 [2019-09-07 11:16:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:22,538 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2019-09-07 11:16:22,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:16:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2019-09-07 11:16:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 11:16:22,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:22,542 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 9, 9, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:22,542 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1272808538, now seen corresponding path program 16 times [2019-09-07 11:16:22,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:22,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:22,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 11:16:22,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:22,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:22,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:22,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:16:22,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:22,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:16:22,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 424 proven. 92 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 11:16:22,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:22,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 11:16:22,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 11:16:22,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 11:16:22,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:16:22,935 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 12 states. [2019-09-07 11:16:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:22,994 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2019-09-07 11:16:22,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:16:22,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 136 [2019-09-07 11:16:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:22,995 INFO L225 Difference]: With dead ends: 137 [2019-09-07 11:16:22,996 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 11:16:22,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:16:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 11:16:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-09-07 11:16:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 11:16:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2019-09-07 11:16:23,001 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 136 [2019-09-07 11:16:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:23,001 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2019-09-07 11:16:23,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 11:16:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2019-09-07 11:16:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-07 11:16:23,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:23,003 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 9, 9, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:23,004 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash 773987643, now seen corresponding path program 17 times [2019-09-07 11:16:23,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:23,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:23,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1230 trivial. 0 not checked. [2019-09-07 11:16:23,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:23,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:23,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:24,252 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 11:16:24,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:24,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:16:24,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 526 proven. 117 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2019-09-07 11:16:24,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:16:24,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:16:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:16:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:16:24,454 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand 20 states. [2019-09-07 11:16:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:24,532 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2019-09-07 11:16:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:16:24,533 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 145 [2019-09-07 11:16:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:24,534 INFO L225 Difference]: With dead ends: 146 [2019-09-07 11:16:24,534 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 11:16:24,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:16:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 11:16:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-09-07 11:16:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 11:16:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-09-07 11:16:24,543 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 145 [2019-09-07 11:16:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:24,544 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-09-07 11:16:24,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:16:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-09-07 11:16:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 11:16:24,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:24,547 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 9, 9, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:24,547 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:24,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1848547912, now seen corresponding path program 18 times [2019-09-07 11:16:24,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:24,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:24,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:24,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:24,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2019-09-07 11:16:24,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:24,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:25,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 11:16:25,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:25,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:16:25,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 11:16:25,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:25,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-09-07 11:16:25,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:16:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:16:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:16:25,385 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 21 states. [2019-09-07 11:16:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:25,490 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-09-07 11:16:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:16:25,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 156 [2019-09-07 11:16:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:25,493 INFO L225 Difference]: With dead ends: 155 [2019-09-07 11:16:25,493 INFO L226 Difference]: Without dead ends: 93 [2019-09-07 11:16:25,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:16:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-07 11:16:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-09-07 11:16:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 11:16:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-09-07 11:16:25,499 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 156 [2019-09-07 11:16:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:25,499 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-09-07 11:16:25,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:16:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-09-07 11:16:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 11:16:25,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:25,501 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:25,501 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1889351576, now seen corresponding path program 19 times [2019-09-07 11:16:25,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:25,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:25,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2019-09-07 11:16:25,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:25,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:25,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:25,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:16:25,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2019-09-07 11:16:25,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:25,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 11:16:25,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:16:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:16:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:16:25,821 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 14 states. [2019-09-07 11:16:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:25,871 INFO L93 Difference]: Finished difference Result 158 states and 186 transitions. [2019-09-07 11:16:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:16:25,878 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 160 [2019-09-07 11:16:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:25,879 INFO L225 Difference]: With dead ends: 158 [2019-09-07 11:16:25,879 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 11:16:25,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:16:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 11:16:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-07 11:16:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-07 11:16:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-09-07 11:16:25,887 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 160 [2019-09-07 11:16:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:25,888 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-09-07 11:16:25,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:16:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-09-07 11:16:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-07 11:16:25,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:25,890 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 11, 11, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:25,891 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1203195078, now seen corresponding path program 20 times [2019-09-07 11:16:25,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:25,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:25,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:25,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:25,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-09-07 11:16:26,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:26,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:26,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:26,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:16:26,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:26,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:16:26,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:16:26,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:26,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 11:16:26,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:16:26,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:16:26,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:16:26,421 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 25 states. [2019-09-07 11:16:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:26,531 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2019-09-07 11:16:26,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:16:26,532 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 162 [2019-09-07 11:16:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:26,533 INFO L225 Difference]: With dead ends: 165 [2019-09-07 11:16:26,533 INFO L226 Difference]: Without dead ends: 101 [2019-09-07 11:16:26,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:16:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-07 11:16:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-09-07 11:16:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 11:16:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2019-09-07 11:16:26,539 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 162 [2019-09-07 11:16:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:26,539 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2019-09-07 11:16:26,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:16:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2019-09-07 11:16:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-07 11:16:26,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:26,540 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 12, 12, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:26,541 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash 228631673, now seen corresponding path program 21 times [2019-09-07 11:16:26,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:26,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:26,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2019-09-07 11:16:26,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:26,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:26,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:16:26,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 11:16:26,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:26,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:16:26,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 780 proven. 81 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2019-09-07 11:16:26,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:26,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 11:16:26,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:16:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:16:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:16:26,976 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand 13 states. [2019-09-07 11:16:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:27,027 INFO L93 Difference]: Finished difference Result 145 states and 172 transitions. [2019-09-07 11:16:27,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:16:27,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-09-07 11:16:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:27,029 INFO L225 Difference]: With dead ends: 145 [2019-09-07 11:16:27,029 INFO L226 Difference]: Without dead ends: 101 [2019-09-07 11:16:27,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:16:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-07 11:16:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-07 11:16:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 11:16:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2019-09-07 11:16:27,034 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 173 [2019-09-07 11:16:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:27,034 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2019-09-07 11:16:27,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:16:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2019-09-07 11:16:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-07 11:16:27,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:27,035 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 12, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:27,036 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1870005637, now seen corresponding path program 22 times [2019-09-07 11:16:27,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:27,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:27,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2019-09-07 11:16:27,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:27,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:27,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:27,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:16:27,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:27,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:16:27,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2019-09-07 11:16:27,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:27,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-09-07 11:16:27,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:16:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:16:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:16:27,737 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand 27 states. [2019-09-07 11:16:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:27,888 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2019-09-07 11:16:27,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:16:27,888 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 175 [2019-09-07 11:16:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:27,890 INFO L225 Difference]: With dead ends: 177 [2019-09-07 11:16:27,890 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 11:16:27,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:16:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 11:16:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2019-09-07 11:16:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-07 11:16:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-09-07 11:16:27,899 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 175 [2019-09-07 11:16:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:27,899 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-09-07 11:16:27,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:16:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-09-07 11:16:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 11:16:27,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:27,902 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 13, 13, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:27,902 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash -963892260, now seen corresponding path program 23 times [2019-09-07 11:16:27,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:27,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2019-09-07 11:16:28,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:28,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:16:30,848 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 11:16:30,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:30,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:16:30,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 916 proven. 210 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:16:31,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:31,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 11:16:31,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:16:31,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:16:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:16:31,065 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 26 states. [2019-09-07 11:16:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:31,178 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2019-09-07 11:16:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:16:31,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 186 [2019-09-07 11:16:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:31,179 INFO L225 Difference]: With dead ends: 184 [2019-09-07 11:16:31,180 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 11:16:31,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:16:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 11:16:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-09-07 11:16:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 11:16:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2019-09-07 11:16:31,185 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 186 [2019-09-07 11:16:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:31,185 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2019-09-07 11:16:31,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:16:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2019-09-07 11:16:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-07 11:16:31,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:31,187 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 13, 13, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:31,187 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 622062971, now seen corresponding path program 24 times [2019-09-07 11:16:31,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:31,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:31,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2645 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 2524 trivial. 0 not checked. [2019-09-07 11:16:31,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:31,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:31,416 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:32,218 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 11:16:32,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:32,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:16:32,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2645 backedges. 1076 proven. 121 refuted. 0 times theorem prover too weak. 1448 trivial. 0 not checked. [2019-09-07 11:16:32,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:32,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 11:16:32,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:16:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:16:32,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:16:32,282 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 15 states. [2019-09-07 11:16:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:32,326 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2019-09-07 11:16:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:16:32,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 197 [2019-09-07 11:16:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:32,328 INFO L225 Difference]: With dead ends: 163 [2019-09-07 11:16:32,328 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 11:16:32,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 197 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-09-07 11:16:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 11:16:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-09-07 11:16:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 11:16:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2019-09-07 11:16:32,333 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 197 [2019-09-07 11:16:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:32,333 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2019-09-07 11:16:32,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:16:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2019-09-07 11:16:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-07 11:16:32,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:32,335 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 13, 13, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:32,335 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1425086845, now seen corresponding path program 25 times [2019-09-07 11:16:32,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:32,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:32,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:32,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:32,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2668 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [2019-09-07 11:16:32,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:32,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:32,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:16:32,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2668 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:16:32,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:32,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 11:16:32,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 11:16:32,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 11:16:32,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:16:32,704 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand 17 states. [2019-09-07 11:16:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:32,776 INFO L93 Difference]: Finished difference Result 194 states and 228 transitions. [2019-09-07 11:16:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:16:32,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 199 [2019-09-07 11:16:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:32,777 INFO L225 Difference]: With dead ends: 194 [2019-09-07 11:16:32,778 INFO L226 Difference]: Without dead ends: 115 [2019-09-07 11:16:32,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:16:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-07 11:16:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-09-07 11:16:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-07 11:16:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2019-09-07 11:16:32,785 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 199 [2019-09-07 11:16:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:32,785 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2019-09-07 11:16:32,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 11:16:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2019-09-07 11:16:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-07 11:16:32,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:32,787 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 14, 14, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:32,787 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:32,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:32,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1768707173, now seen corresponding path program 26 times [2019-09-07 11:16:32,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:32,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:32,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 0 proven. 1321 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2019-09-07 11:16:33,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:33,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:33,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:16:33,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:16:33,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:33,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:16:33,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [2019-09-07 11:16:33,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:33,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 11:16:33,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:16:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:16:33,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:16:33,446 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 31 states. [2019-09-07 11:16:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:33,564 INFO L93 Difference]: Finished difference Result 201 states and 241 transitions. [2019-09-07 11:16:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:16:33,565 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 201 [2019-09-07 11:16:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:33,567 INFO L225 Difference]: With dead ends: 201 [2019-09-07 11:16:33,567 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 11:16:33,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:16:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 11:16:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-09-07 11:16:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-07 11:16:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2019-09-07 11:16:33,573 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 201 [2019-09-07 11:16:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:33,573 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2019-09-07 11:16:33,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:16:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2019-09-07 11:16:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-07 11:16:33,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:33,575 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 15, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:33,575 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2114134332, now seen corresponding path program 27 times [2019-09-07 11:16:33,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:33,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:33,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:33,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:33,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3093 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 2949 trivial. 0 not checked. [2019-09-07 11:16:33,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:33,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:33,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:35,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 11:16:35,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:35,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:16:35,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3093 backedges. 1242 proven. 144 refuted. 0 times theorem prover too weak. 1707 trivial. 0 not checked. [2019-09-07 11:16:35,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:35,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 11:16:35,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:16:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:16:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:16:35,344 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 16 states. [2019-09-07 11:16:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:35,390 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2019-09-07 11:16:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:16:35,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 212 [2019-09-07 11:16:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:35,393 INFO L225 Difference]: With dead ends: 175 [2019-09-07 11:16:35,393 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 11:16:35,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:16:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 11:16:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-07 11:16:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-07 11:16:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-09-07 11:16:35,399 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 212 [2019-09-07 11:16:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:35,399 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-09-07 11:16:35,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:16:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-09-07 11:16:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-07 11:16:35,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:35,401 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 15, 15, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:35,401 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:35,401 INFO L82 PathProgramCache]: Analyzing trace with hash 210110714, now seen corresponding path program 28 times [2019-09-07 11:16:35,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:35,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:35,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3118 backedges. 0 proven. 1527 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2019-09-07 11:16:35,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:35,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:35,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:35,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:16:35,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:35,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:16:35,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3118 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 2893 trivial. 0 not checked. [2019-09-07 11:16:36,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:36,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 11:16:36,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:16:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:16:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:16:36,086 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 33 states. [2019-09-07 11:16:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:36,198 INFO L93 Difference]: Finished difference Result 213 states and 255 transitions. [2019-09-07 11:16:36,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:16:36,199 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 214 [2019-09-07 11:16:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:36,200 INFO L225 Difference]: With dead ends: 213 [2019-09-07 11:16:36,200 INFO L226 Difference]: Without dead ends: 129 [2019-09-07 11:16:36,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:16:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-07 11:16:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-09-07 11:16:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-07 11:16:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2019-09-07 11:16:36,206 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 214 [2019-09-07 11:16:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:36,206 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2019-09-07 11:16:36,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:16:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2019-09-07 11:16:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-07 11:16:36,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:36,208 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 16, 16, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:36,209 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash -740265543, now seen corresponding path program 29 times [2019-09-07 11:16:36,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:36,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:36,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3545 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2019-09-07 11:16:36,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:36,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:36,445 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:16:46,611 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-07 11:16:46,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:46,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:16:46,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3545 backedges. 1414 proven. 330 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-09-07 11:16:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:46,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-07 11:16:46,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:16:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:16:46,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:16:46,954 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand 32 states. [2019-09-07 11:16:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:47,111 INFO L93 Difference]: Finished difference Result 220 states and 263 transitions. [2019-09-07 11:16:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:16:47,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 225 [2019-09-07 11:16:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:47,114 INFO L225 Difference]: With dead ends: 220 [2019-09-07 11:16:47,114 INFO L226 Difference]: Without dead ends: 134 [2019-09-07 11:16:47,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:16:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-07 11:16:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-09-07 11:16:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-07 11:16:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2019-09-07 11:16:47,120 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 225 [2019-09-07 11:16:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:47,121 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2019-09-07 11:16:47,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:16:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2019-09-07 11:16:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 11:16:47,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:47,123 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 16, 16, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:47,123 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1692019206, now seen corresponding path program 30 times [2019-09-07 11:16:47,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:47,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:47,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:47,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3995 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3799 trivial. 0 not checked. [2019-09-07 11:16:47,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:47,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:47,413 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:48,831 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 11:16:48,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:48,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:16:48,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3995 backedges. 1610 proven. 196 refuted. 0 times theorem prover too weak. 2189 trivial. 0 not checked. [2019-09-07 11:16:48,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:48,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 11:16:48,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:16:48,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:16:48,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:16:48,899 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 18 states. [2019-09-07 11:16:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:48,943 INFO L93 Difference]: Finished difference Result 193 states and 230 transitions. [2019-09-07 11:16:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 11:16:48,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 236 [2019-09-07 11:16:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:48,946 INFO L225 Difference]: With dead ends: 193 [2019-09-07 11:16:48,946 INFO L226 Difference]: Without dead ends: 134 [2019-09-07 11:16:48,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:16:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-07 11:16:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-07 11:16:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-07 11:16:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-09-07 11:16:48,952 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 236 [2019-09-07 11:16:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:48,953 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-09-07 11:16:48,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:16:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-09-07 11:16:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 11:16:48,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:48,954 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 16, 16, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:48,955 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash -296433736, now seen corresponding path program 31 times [2019-09-07 11:16:48,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:48,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:48,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4024 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 3768 trivial. 0 not checked. [2019-09-07 11:16:49,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:49,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:49,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:49,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:16:49,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4024 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 3768 trivial. 0 not checked. [2019-09-07 11:16:49,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:49,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 11:16:49,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:16:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:16:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:16:49,483 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 20 states. [2019-09-07 11:16:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:49,539 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2019-09-07 11:16:49,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:16:49,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 238 [2019-09-07 11:16:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:49,542 INFO L225 Difference]: With dead ends: 230 [2019-09-07 11:16:49,542 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 11:16:49,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:16:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 11:16:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-07 11:16:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-07 11:16:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2019-09-07 11:16:49,547 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 238 [2019-09-07 11:16:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:49,548 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2019-09-07 11:16:49,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:16:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2019-09-07 11:16:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 11:16:49,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:49,550 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 17, 17, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:49,550 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1129590746, now seen corresponding path program 32 times [2019-09-07 11:16:49,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:49,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:49,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 2073 trivial. 0 not checked. [2019-09-07 11:16:49,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:49,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:49,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:49,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:16:49,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:49,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:16:49,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 3768 trivial. 0 not checked. [2019-09-07 11:16:50,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:50,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 11:16:50,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:16:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:16:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:16:50,417 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 37 states. [2019-09-07 11:16:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:50,563 INFO L93 Difference]: Finished difference Result 237 states and 283 transitions. [2019-09-07 11:16:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:16:50,564 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 240 [2019-09-07 11:16:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:50,564 INFO L225 Difference]: With dead ends: 237 [2019-09-07 11:16:50,565 INFO L226 Difference]: Without dead ends: 143 [2019-09-07 11:16:50,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:16:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-07 11:16:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-09-07 11:16:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-07 11:16:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2019-09-07 11:16:50,572 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 240 [2019-09-07 11:16:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:50,572 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2019-09-07 11:16:50,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:16:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2019-09-07 11:16:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-07 11:16:50,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:50,574 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 18, 18, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:50,574 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1674924967, now seen corresponding path program 33 times [2019-09-07 11:16:50,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:50,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:50,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:50,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:50,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4542 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 4317 trivial. 0 not checked. [2019-09-07 11:16:50,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:50,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:50,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:54,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 11:16:54,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:54,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:16:54,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4542 backedges. 1812 proven. 225 refuted. 0 times theorem prover too weak. 2505 trivial. 0 not checked. [2019-09-07 11:16:54,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:54,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 11:16:54,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:16:54,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:16:54,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:16:54,153 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 19 states. [2019-09-07 11:16:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:54,230 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2019-09-07 11:16:54,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:16:54,233 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 251 [2019-09-07 11:16:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:54,235 INFO L225 Difference]: With dead ends: 205 [2019-09-07 11:16:54,235 INFO L226 Difference]: Without dead ends: 143 [2019-09-07 11:16:54,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:16:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-07 11:16:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-07 11:16:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-07 11:16:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2019-09-07 11:16:54,241 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 251 [2019-09-07 11:16:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:54,243 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2019-09-07 11:16:54,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:16:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2019-09-07 11:16:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-07 11:16:54,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:54,245 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 18, 18, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:54,246 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -330230309, now seen corresponding path program 34 times [2019-09-07 11:16:54,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:54,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:54,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:54,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:54,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4573 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked. [2019-09-07 11:16:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:54,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:54,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:16:54,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:16:54,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:54,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:16:54,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4573 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 4249 trivial. 0 not checked. [2019-09-07 11:16:55,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:55,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 11:16:55,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 11:16:55,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 11:16:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:16:55,057 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 39 states. [2019-09-07 11:16:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:55,225 INFO L93 Difference]: Finished difference Result 249 states and 297 transitions. [2019-09-07 11:16:55,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 11:16:55,225 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 253 [2019-09-07 11:16:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:55,226 INFO L225 Difference]: With dead ends: 249 [2019-09-07 11:16:55,226 INFO L226 Difference]: Without dead ends: 150 [2019-09-07 11:16:55,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:16:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-07 11:16:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-09-07 11:16:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-07 11:16:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2019-09-07 11:16:55,232 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 253 [2019-09-07 11:16:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:55,232 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2019-09-07 11:16:55,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 11:16:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2019-09-07 11:16:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-07 11:16:55,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:55,234 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 19, 19, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:55,234 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1966564348, now seen corresponding path program 35 times [2019-09-07 11:16:55,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:55,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:55,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:55,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:55,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5087 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 4831 trivial. 0 not checked. [2019-09-07 11:16:55,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:55,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:16:55,536 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:19,358 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-07 11:17:19,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:19,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:17:19,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5087 backedges. 2020 proven. 477 refuted. 0 times theorem prover too weak. 2590 trivial. 0 not checked. [2019-09-07 11:17:19,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:19,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-09-07 11:17:19,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 11:17:19,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 11:17:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:17:19,738 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 38 states. [2019-09-07 11:17:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:19,933 INFO L93 Difference]: Finished difference Result 256 states and 305 transitions. [2019-09-07 11:17:19,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 11:17:19,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 264 [2019-09-07 11:17:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:19,935 INFO L225 Difference]: With dead ends: 256 [2019-09-07 11:17:19,935 INFO L226 Difference]: Without dead ends: 155 [2019-09-07 11:17:19,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:17:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-07 11:17:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-09-07 11:17:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 11:17:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2019-09-07 11:17:19,945 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 264 [2019-09-07 11:17:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:19,946 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2019-09-07 11:17:19,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 11:17:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2019-09-07 11:17:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-07 11:17:19,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:19,949 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 19, 19, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:19,949 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash 814660059, now seen corresponding path program 36 times [2019-09-07 11:17:19,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:19,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:19,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:19,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:19,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5624 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2019-09-07 11:17:20,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:20,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:17:22,734 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 11:17:22,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:22,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:17:22,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5624 backedges. 2252 proven. 289 refuted. 0 times theorem prover too weak. 3083 trivial. 0 not checked. [2019-09-07 11:17:22,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:22,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 11:17:22,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:17:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:17:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:17:22,820 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand 21 states. [2019-09-07 11:17:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:22,873 INFO L93 Difference]: Finished difference Result 223 states and 266 transitions. [2019-09-07 11:17:22,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:17:22,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 275 [2019-09-07 11:17:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:22,875 INFO L225 Difference]: With dead ends: 223 [2019-09-07 11:17:22,875 INFO L226 Difference]: Without dead ends: 155 [2019-09-07 11:17:22,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:17:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-07 11:17:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-07 11:17:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 11:17:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2019-09-07 11:17:22,887 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 275 [2019-09-07 11:17:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:22,887 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2019-09-07 11:17:22,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:17:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2019-09-07 11:17:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-07 11:17:22,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:22,889 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 19, 19, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:22,890 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:22,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:22,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1231865507, now seen corresponding path program 37 times [2019-09-07 11:17:22,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:22,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:22,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 5298 trivial. 0 not checked. [2019-09-07 11:17:23,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:23,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:17:23,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:23,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:17:23,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 5298 trivial. 0 not checked. [2019-09-07 11:17:23,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:23,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 11:17:23,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:17:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:17:23,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:17:23,474 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand 23 states. [2019-09-07 11:17:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:23,550 INFO L93 Difference]: Finished difference Result 266 states and 312 transitions. [2019-09-07 11:17:23,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:17:23,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 277 [2019-09-07 11:17:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:23,553 INFO L225 Difference]: With dead ends: 266 [2019-09-07 11:17:23,553 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 11:17:23,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 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-09-07 11:17:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 11:17:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-07 11:17:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-07 11:17:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2019-09-07 11:17:23,560 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 277 [2019-09-07 11:17:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:23,562 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2019-09-07 11:17:23,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:17:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2019-09-07 11:17:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-07 11:17:23,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:23,567 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:23,567 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1937191173, now seen corresponding path program 38 times [2019-09-07 11:17:23,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:23,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:23,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:17:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5698 backedges. 0 proven. 2782 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-07 11:17:24,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:24,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:17:24,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:24,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:17:24,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:24,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:17:24,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5698 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 5298 trivial. 0 not checked. [2019-09-07 11:17:24,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:24,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 11:17:24,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 11:17:24,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 11:17:24,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:17:24,704 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand 43 states. [2019-09-07 11:17:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:24,912 INFO L93 Difference]: Finished difference Result 273 states and 325 transitions. [2019-09-07 11:17:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 11:17:24,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 279 [2019-09-07 11:17:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:24,914 INFO L225 Difference]: With dead ends: 273 [2019-09-07 11:17:24,914 INFO L226 Difference]: Without dead ends: 164 [2019-09-07 11:17:24,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:17:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-07 11:17:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-09-07 11:17:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-07 11:17:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 185 transitions. [2019-09-07 11:17:24,922 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 185 transitions. Word has length 279 [2019-09-07 11:17:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:24,923 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 185 transitions. [2019-09-07 11:17:24,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 11:17:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 185 transitions. [2019-09-07 11:17:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-07 11:17:24,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:24,925 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 21, 21, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:24,926 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash 792768860, now seen corresponding path program 39 times [2019-09-07 11:17:24,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:24,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:24,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5946 trivial. 0 not checked. [2019-09-07 11:17:25,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:25,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:25,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:17:28,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-07 11:17:28,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:28,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:17:28,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 2490 proven. 324 refuted. 0 times theorem prover too weak. 3456 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:17:29,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:29,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 11:17:29,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:17:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:17:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:17:29,060 INFO L87 Difference]: Start difference. First operand 161 states and 185 transitions. Second operand 22 states. [2019-09-07 11:17:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:29,129 INFO L93 Difference]: Finished difference Result 235 states and 280 transitions. [2019-09-07 11:17:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:17:29,130 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 290 [2019-09-07 11:17:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:29,131 INFO L225 Difference]: With dead ends: 235 [2019-09-07 11:17:29,132 INFO L226 Difference]: Without dead ends: 164 [2019-09-07 11:17:29,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:17:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-07 11:17:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-07 11:17:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-07 11:17:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2019-09-07 11:17:29,139 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 187 transitions. Word has length 290 [2019-09-07 11:17:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:29,139 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 187 transitions. [2019-09-07 11:17:29,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:17:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2019-09-07 11:17:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 11:17:29,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:29,141 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 21, 21, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:29,142 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1157985690, now seen corresponding path program 40 times [2019-09-07 11:17:29,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:29,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:29,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6307 backedges. 0 proven. 3078 refuted. 0 times theorem prover too weak. 3229 trivial. 0 not checked. [2019-09-07 11:17:29,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:29,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:17:29,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:17:29,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:29,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:17:29,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6307 backedges. 2488 proven. 590 refuted. 0 times theorem prover too weak. 3229 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:17:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:29,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 11:17:29,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 11:17:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 11:17:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:17:29,770 INFO L87 Difference]: Start difference. First operand 163 states and 187 transitions. Second operand 24 states. [2019-09-07 11:17:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:29,849 INFO L93 Difference]: Finished difference Result 281 states and 333 transitions. [2019-09-07 11:17:29,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 11:17:29,851 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 292 [2019-09-07 11:17:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:29,853 INFO L225 Difference]: With dead ends: 281 [2019-09-07 11:17:29,853 INFO L226 Difference]: Without dead ends: 168 [2019-09-07 11:17:29,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:17:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-07 11:17:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-09-07 11:17:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-07 11:17:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2019-09-07 11:17:29,870 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 292 [2019-09-07 11:17:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:29,870 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2019-09-07 11:17:29,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 11:17:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2019-09-07 11:17:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-07 11:17:29,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:29,873 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 21, 21, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:29,873 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 935308795, now seen corresponding path program 41 times [2019-09-07 11:17:29,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:29,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:29,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6865 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 6504 trivial. 0 not checked. [2019-09-07 11:17:30,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:30,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:30,262 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:18:15,963 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-07 11:18:15,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:15,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:18:15,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6865 backedges. 2734 proven. 651 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2019-09-07 11:18:16,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:16,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-09-07 11:18:16,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 11:18:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 11:18:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:18:16,526 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand 44 states. [2019-09-07 11:18:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:16,711 INFO L93 Difference]: Finished difference Result 290 states and 345 transitions. [2019-09-07 11:18:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 11:18:16,712 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 301 [2019-09-07 11:18:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:16,714 INFO L225 Difference]: With dead ends: 290 [2019-09-07 11:18:16,714 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 11:18:16,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:18:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 11:18:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-09-07 11:18:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 11:18:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2019-09-07 11:18:16,722 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 301 [2019-09-07 11:18:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:16,722 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2019-09-07 11:18:16,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 11:18:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2019-09-07 11:18:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 11:18:16,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:16,725 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 21, 21, 20, 20, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:16,725 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1077378040, now seen corresponding path program 42 times [2019-09-07 11:18:16,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:16,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:16,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:16,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:16,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7489 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7048 trivial. 0 not checked. [2019-09-07 11:18:17,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:17,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:17,190 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:18:22,496 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-07 11:18:22,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:22,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 11:18:22,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7489 backedges. 3043 proven. 400 refuted. 0 times theorem prover too weak. 4046 trivial. 0 not checked. [2019-09-07 11:18:23,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:23,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-09-07 11:18:23,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 11:18:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 11:18:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1585, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 11:18:23,040 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand 47 states. [2019-09-07 11:18:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:23,782 INFO L93 Difference]: Finished difference Result 300 states and 354 transitions. [2019-09-07 11:18:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 11:18:23,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 312 [2019-09-07 11:18:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:23,783 INFO L225 Difference]: With dead ends: 300 [2019-09-07 11:18:23,783 INFO L226 Difference]: Without dead ends: 178 [2019-09-07 11:18:23,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=3475, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 11:18:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-07 11:18:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-07 11:18:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 11:18:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2019-09-07 11:18:23,791 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 312 [2019-09-07 11:18:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:23,791 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2019-09-07 11:18:23,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 11:18:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2019-09-07 11:18:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-07 11:18:23,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:23,793 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 23, 23, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:23,794 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -807103366, now seen corresponding path program 43 times [2019-09-07 11:18:23,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:23,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7618 backedges. 0 proven. 3715 refuted. 0 times theorem prover too weak. 3903 trivial. 0 not checked. [2019-09-07 11:18:24,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:24,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:18:24,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:24,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:18:24,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7618 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 7089 trivial. 0 not checked. [2019-09-07 11:18:25,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:25,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 11:18:25,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 11:18:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 11:18:25,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:18:25,206 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 49 states. [2019-09-07 11:18:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:25,437 INFO L93 Difference]: Finished difference Result 309 states and 367 transitions. [2019-09-07 11:18:25,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 11:18:25,438 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 318 [2019-09-07 11:18:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:25,440 INFO L225 Difference]: With dead ends: 309 [2019-09-07 11:18:25,441 INFO L226 Difference]: Without dead ends: 185 [2019-09-07 11:18:25,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:18:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-07 11:18:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-09-07 11:18:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 11:18:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2019-09-07 11:18:25,452 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 318 [2019-09-07 11:18:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:25,453 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2019-09-07 11:18:25,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 11:18:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2019-09-07 11:18:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-07 11:18:25,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:25,457 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 24, 24, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:25,458 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1567271993, now seen corresponding path program 44 times [2019-09-07 11:18:25,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:18:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8277 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7836 trivial. 0 not checked. [2019-09-07 11:18:25,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:25,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:25,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:18:26,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:18:26,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:26,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:18:26,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8277 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 7701 trivial. 0 not checked. [2019-09-07 11:18:26,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:26,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 49 [2019-09-07 11:18:26,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 11:18:26,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 11:18:26,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1726, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:18:26,629 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand 49 states. [2019-09-07 11:18:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:26,829 INFO L93 Difference]: Finished difference Result 315 states and 370 transitions. [2019-09-07 11:18:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 11:18:26,829 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 329 [2019-09-07 11:18:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:26,831 INFO L225 Difference]: With dead ends: 315 [2019-09-07 11:18:26,831 INFO L226 Difference]: Without dead ends: 188 [2019-09-07 11:18:26,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=626, Invalid=1726, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:18:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-07 11:18:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-09-07 11:18:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-07 11:18:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 213 transitions. [2019-09-07 11:18:26,839 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 213 transitions. Word has length 329 [2019-09-07 11:18:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:26,839 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 213 transitions. [2019-09-07 11:18:26,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 11:18:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 213 transitions. [2019-09-07 11:18:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-07 11:18:26,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:26,842 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 25, 25, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:26,842 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 932494425, now seen corresponding path program 45 times [2019-09-07 11:18:26,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:26,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8369 backedges. 0 proven. 4056 refuted. 0 times theorem prover too weak. 4313 trivial. 0 not checked. [2019-09-07 11:18:27,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:27,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:27,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:18:35,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-07 11:18:35,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:18:35,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8369 backedges. 3276 proven. 484 refuted. 0 times theorem prover too weak. 4609 trivial. 0 not checked. [2019-09-07 11:18:36,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:36,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2019-09-07 11:18:36,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 11:18:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 11:18:36,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:18:36,585 INFO L87 Difference]: Start difference. First operand 186 states and 213 transitions. Second operand 49 states. [2019-09-07 11:18:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:36,791 INFO L93 Difference]: Finished difference Result 322 states and 381 transitions. [2019-09-07 11:18:36,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 11:18:36,791 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 333 [2019-09-07 11:18:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:36,793 INFO L225 Difference]: With dead ends: 322 [2019-09-07 11:18:36,793 INFO L226 Difference]: Without dead ends: 194 [2019-09-07 11:18:36,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:18:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-07 11:18:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-09-07 11:18:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-07 11:18:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 219 transitions. [2019-09-07 11:18:36,801 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 219 transitions. Word has length 333 [2019-09-07 11:18:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:36,801 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 219 transitions. [2019-09-07 11:18:36,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 11:18:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 219 transitions. [2019-09-07 11:18:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-07 11:18:36,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:36,804 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 25, 25, 23, 23, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:36,804 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1387963558, now seen corresponding path program 46 times [2019-09-07 11:18:36,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:36,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:36,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:36,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9053 backedges. 0 proven. 4412 refuted. 0 times theorem prover too weak. 4641 trivial. 0 not checked. [2019-09-07 11:18:37,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:37,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:18:37,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:37,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:18:37,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:37,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:18:37,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9053 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 8428 trivial. 0 not checked. [2019-09-07 11:18:38,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:38,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2019-09-07 11:18:38,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 11:18:38,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 11:18:38,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 11:18:38,096 INFO L87 Difference]: Start difference. First operand 191 states and 219 transitions. Second operand 53 states. [2019-09-07 11:18:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:38,303 INFO L93 Difference]: Finished difference Result 333 states and 395 transitions. [2019-09-07 11:18:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 11:18:38,303 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 344 [2019-09-07 11:18:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:38,305 INFO L225 Difference]: With dead ends: 333 [2019-09-07 11:18:38,305 INFO L226 Difference]: Without dead ends: 199 [2019-09-07 11:18:38,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 11:18:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-07 11:18:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-09-07 11:18:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-07 11:18:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2019-09-07 11:18:38,311 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 344 [2019-09-07 11:18:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:38,311 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2019-09-07 11:18:38,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 11:18:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2019-09-07 11:18:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-07 11:18:38,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:38,313 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 26, 26, 23, 23, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:38,313 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1612826329, now seen corresponding path program 47 times [2019-09-07 11:18:38,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:38,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:38,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:38,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:38,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9770 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 9241 trivial. 0 not checked. [2019-09-07 11:18:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:38,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:38,774 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:20:34,526 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-09-07 11:20:34,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:20:34,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:20:34,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:20:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9770 backedges. 3854 proven. 925 refuted. 0 times theorem prover too weak. 4991 trivial. 0 not checked. [2019-09-07 11:20:35,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:20:35,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 52 [2019-09-07 11:20:35,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 11:20:35,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 11:20:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=1950, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 11:20:35,180 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand 52 states. [2019-09-07 11:20:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:20:35,393 INFO L93 Difference]: Finished difference Result 340 states and 403 transitions. [2019-09-07 11:20:35,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 11:20:35,393 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 355 [2019-09-07 11:20:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:20:35,395 INFO L225 Difference]: With dead ends: 340 [2019-09-07 11:20:35,395 INFO L226 Difference]: Without dead ends: 204 [2019-09-07 11:20:35,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=702, Invalid=1950, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 11:20:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-07 11:20:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-09-07 11:20:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-07 11:20:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2019-09-07 11:20:35,401 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 355 [2019-09-07 11:20:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:20:35,402 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2019-09-07 11:20:35,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 11:20:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2019-09-07 11:20:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-07 11:20:35,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:20:35,404 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 26, 26, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:20:35,404 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:20:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:20:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash -460979878, now seen corresponding path program 48 times [2019-09-07 11:20:35,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:20:35,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:20:35,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:35,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:20:35,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:20:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10510 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 9934 trivial. 0 not checked. [2019-09-07 11:20:35,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:20:35,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:20:35,869 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:20:47,915 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2019-09-07 11:20:47,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:20:47,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:20:47,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:20:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10510 backedges. 4170 proven. 576 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked. [2019-09-07 11:20:47,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:20:48,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 11:20:48,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:20:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:20:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:20:48,001 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 28 states. [2019-09-07 11:20:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:20:48,086 INFO L93 Difference]: Finished difference Result 293 states and 350 transitions. [2019-09-07 11:20:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:20:48,087 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 366 [2019-09-07 11:20:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:20:48,088 INFO L225 Difference]: With dead ends: 293 [2019-09-07 11:20:48,088 INFO L226 Difference]: Without dead ends: 204 [2019-09-07 11:20:48,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:20:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-07 11:20:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-07 11:20:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-07 11:20:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 233 transitions. [2019-09-07 11:20:48,095 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 233 transitions. Word has length 366 [2019-09-07 11:20:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:20:48,095 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 233 transitions. [2019-09-07 11:20:48,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:20:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 233 transitions. [2019-09-07 11:20:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-07 11:20:48,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:20:48,098 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 26, 26, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:20:48,098 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:20:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:20:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1833172328, now seen corresponding path program 49 times [2019-09-07 11:20:48,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:20:48,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:20:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:48,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:20:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:20:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10559 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 9883 trivial. 0 not checked. [2019-09-07 11:20:48,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:20:48,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:20:48,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:20:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:20:49,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:20:49,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:20:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10559 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 9883 trivial. 0 not checked. [2019-09-07 11:20:49,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:20:49,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 11:20:49,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:20:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:20:49,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:20:49,410 INFO L87 Difference]: Start difference. First operand 203 states and 233 transitions. Second operand 30 states. [2019-09-07 11:20:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:20:49,501 INFO L93 Difference]: Finished difference Result 350 states and 410 transitions. [2019-09-07 11:20:49,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 11:20:49,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 368 [2019-09-07 11:20:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:20:49,503 INFO L225 Difference]: With dead ends: 350 [2019-09-07 11:20:49,503 INFO L226 Difference]: Without dead ends: 206 [2019-09-07 11:20:49,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:20:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-07 11:20:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-07 11:20:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 11:20:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2019-09-07 11:20:49,510 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 368 [2019-09-07 11:20:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:20:49,510 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2019-09-07 11:20:49,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:20:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2019-09-07 11:20:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-07 11:20:49,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:20:49,514 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 27, 27, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:20:49,514 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:20:49,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:20:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1092236742, now seen corresponding path program 50 times [2019-09-07 11:20:49,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:20:49,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:20:49,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:20:49,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:20:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10612 backedges. 0 proven. 5169 refuted. 0 times theorem prover too weak. 5443 trivial. 0 not checked. [2019-09-07 11:20:50,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:20:50,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:20:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:20:50,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:20:50,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:20:50,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:20:50,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:20:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10612 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 9883 trivial. 0 not checked. [2019-09-07 11:20:51,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:20:51,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2019-09-07 11:20:51,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 11:20:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 11:20:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 11:20:51,286 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 57 states. [2019-09-07 11:20:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:20:51,510 INFO L93 Difference]: Finished difference Result 357 states and 423 transitions. [2019-09-07 11:20:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 11:20:51,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 370 [2019-09-07 11:20:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:20:51,512 INFO L225 Difference]: With dead ends: 357 [2019-09-07 11:20:51,512 INFO L226 Difference]: Without dead ends: 213 [2019-09-07 11:20:51,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 11:20:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-07 11:20:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2019-09-07 11:20:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-07 11:20:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 241 transitions. [2019-09-07 11:20:51,518 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 241 transitions. Word has length 370 [2019-09-07 11:20:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:20:51,518 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 241 transitions. [2019-09-07 11:20:51,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 11:20:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 241 transitions. [2019-09-07 11:20:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-07 11:20:51,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:20:51,521 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 28, 28, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:20:51,521 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:20:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:20:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1705698951, now seen corresponding path program 51 times [2019-09-07 11:20:51,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:20:51,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:20:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:51,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:20:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:20:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:20:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11387 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10762 trivial. 0 not checked. [2019-09-07 11:20:52,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:20:52,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:20:52,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:21:18,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-07 11:21:18,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:18,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:21:18,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11387 backedges. 4492 proven. 625 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:21:18,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:18,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 11:21:18,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:21:18,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:21:18,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:21:18,955 INFO L87 Difference]: Start difference. First operand 210 states and 241 transitions. Second operand 29 states. [2019-09-07 11:21:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:19,049 INFO L93 Difference]: Finished difference Result 305 states and 364 transitions. [2019-09-07 11:21:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:21:19,050 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 381 [2019-09-07 11:21:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:19,052 INFO L225 Difference]: With dead ends: 305 [2019-09-07 11:21:19,052 INFO L226 Difference]: Without dead ends: 213 [2019-09-07 11:21:19,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:21:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-07 11:21:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-07 11:21:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 11:21:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 243 transitions. [2019-09-07 11:21:19,060 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 243 transitions. Word has length 381 [2019-09-07 11:21:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:19,061 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 243 transitions. [2019-09-07 11:21:19,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:21:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 243 transitions. [2019-09-07 11:21:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-07 11:21:19,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:19,064 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 28, 28, 26, 26, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:19,065 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:19,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1002251131, now seen corresponding path program 52 times [2019-09-07 11:21:19,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:19,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:19,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:19,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:19,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11438 backedges. 0 proven. 5570 refuted. 0 times theorem prover too weak. 5868 trivial. 0 not checked. [2019-09-07 11:21:19,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:19,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:19,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:21:19,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:21:19,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:19,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:21:19,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11438 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10654 trivial. 0 not checked. [2019-09-07 11:21:20,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:20,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2019-09-07 11:21:20,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 11:21:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 11:21:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 11:21:20,555 INFO L87 Difference]: Start difference. First operand 212 states and 243 transitions. Second operand 59 states. [2019-09-07 11:21:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:20,763 INFO L93 Difference]: Finished difference Result 369 states and 437 transitions. [2019-09-07 11:21:20,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 11:21:20,763 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 383 [2019-09-07 11:21:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:20,764 INFO L225 Difference]: With dead ends: 369 [2019-09-07 11:21:20,764 INFO L226 Difference]: Without dead ends: 220 [2019-09-07 11:21:20,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 11:21:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-07 11:21:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-09-07 11:21:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-07 11:21:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 249 transitions. [2019-09-07 11:21:20,772 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 249 transitions. Word has length 383 [2019-09-07 11:21:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:20,773 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 249 transitions. [2019-09-07 11:21:20,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 11:21:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 249 transitions. [2019-09-07 11:21:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-07 11:21:20,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:20,776 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 29, 29, 26, 26, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:20,776 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 499234524, now seen corresponding path program 53 times [2019-09-07 11:21:20,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:20,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:20,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12242 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 11566 trivial. 0 not checked. [2019-09-07 11:21:21,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:21,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:23:47,646 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-09-07 11:23:47,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:23:47,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:23:47,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:23:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12242 backedges. 4820 proven. 1162 refuted. 0 times theorem prover too weak. 6260 trivial. 0 not checked. [2019-09-07 11:23:48,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:23:48,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2019-09-07 11:23:48,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 11:23:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 11:23:48,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2436, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 11:23:48,396 INFO L87 Difference]: Start difference. First operand 217 states and 249 transitions. Second operand 58 states. [2019-09-07 11:23:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:23:48,639 INFO L93 Difference]: Finished difference Result 376 states and 445 transitions. [2019-09-07 11:23:48,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 11:23:48,640 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 394 [2019-09-07 11:23:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:23:48,641 INFO L225 Difference]: With dead ends: 376 [2019-09-07 11:23:48,641 INFO L226 Difference]: Without dead ends: 225 [2019-09-07 11:23:48,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=870, Invalid=2436, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 11:23:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-07 11:23:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-09-07 11:23:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-07 11:23:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 255 transitions. [2019-09-07 11:23:48,648 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 255 transitions. Word has length 394 [2019-09-07 11:23:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:23:48,649 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 255 transitions. [2019-09-07 11:23:48,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 11:23:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 255 transitions. [2019-09-07 11:23:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-07 11:23:48,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:23:48,653 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 29, 29, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:23:48,653 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:23:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:23:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash -169808261, now seen corresponding path program 54 times [2019-09-07 11:23:48,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:23:48,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:23:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:48,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:23:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:23:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13069 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 12340 trivial. 0 not checked. [2019-09-07 11:23:49,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:23:49,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:23:49,394 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:24:13,300 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 57 check-sat command(s) [2019-09-07 11:24:13,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:24:13,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 11:24:13,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:24:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13069 backedges. 5172 proven. 729 refuted. 0 times theorem prover too weak. 7168 trivial. 0 not checked. [2019-09-07 11:24:13,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:24:13,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 11:24:13,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:24:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:24:13,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:24:13,417 INFO L87 Difference]: Start difference. First operand 222 states and 255 transitions. Second operand 31 states. [2019-09-07 11:24:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:24:13,515 INFO L93 Difference]: Finished difference Result 323 states and 386 transitions. [2019-09-07 11:24:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 11:24:13,516 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 405 [2019-09-07 11:24:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:24:13,517 INFO L225 Difference]: With dead ends: 323 [2019-09-07 11:24:13,517 INFO L226 Difference]: Without dead ends: 225 [2019-09-07 11:24:13,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:24:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-07 11:24:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2019-09-07 11:24:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-07 11:24:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 257 transitions. [2019-09-07 11:24:13,523 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 257 transitions. Word has length 405 [2019-09-07 11:24:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:24:13,524 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 257 transitions. [2019-09-07 11:24:13,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:24:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 257 transitions. [2019-09-07 11:24:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-09-07 11:24:13,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:24:13,527 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 29, 29, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:24:13,527 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:24:13,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:24:13,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1602408061, now seen corresponding path program 55 times [2019-09-07 11:24:13,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:24:13,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:24:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:13,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:24:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13124 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 12283 trivial. 0 not checked. [2019-09-07 11:24:14,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:24:14,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:24:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:24:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:14,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:24:14,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:24:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13124 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 12283 trivial. 0 not checked. [2019-09-07 11:24:14,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:24:14,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 11:24:14,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:24:14,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:24:14,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:24:14,427 INFO L87 Difference]: Start difference. First operand 224 states and 257 transitions. Second operand 33 states. [2019-09-07 11:24:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:24:14,562 INFO L93 Difference]: Finished difference Result 386 states and 452 transitions. [2019-09-07 11:24:14,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:24:14,562 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 407 [2019-09-07 11:24:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:24:14,563 INFO L225 Difference]: With dead ends: 386 [2019-09-07 11:24:14,564 INFO L226 Difference]: Without dead ends: 227 [2019-09-07 11:24:14,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:24:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-07 11:24:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-09-07 11:24:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-07 11:24:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 259 transitions. [2019-09-07 11:24:14,572 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 259 transitions. Word has length 407 [2019-09-07 11:24:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:24:14,573 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 259 transitions. [2019-09-07 11:24:14,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:24:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 259 transitions. [2019-09-07 11:24:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-07 11:24:14,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:24:14,578 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 30, 30, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:24:14,578 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:24:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:24:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1368812389, now seen corresponding path program 56 times [2019-09-07 11:24:14,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:24:14,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:24:14,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:14,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:24:14,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13183 backedges. 0 proven. 6417 refuted. 0 times theorem prover too weak. 6766 trivial. 0 not checked. [2019-09-07 11:24:15,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:24:15,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:24:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:24:15,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:24:15,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:24:15,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:24:15,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:24:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13183 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 12283 trivial. 0 not checked. [2019-09-07 11:24:16,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:24:16,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-09-07 11:24:16,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 11:24:16,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 11:24:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:24:16,234 INFO L87 Difference]: Start difference. First operand 226 states and 259 transitions. Second operand 63 states. [2019-09-07 11:24:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:24:16,488 INFO L93 Difference]: Finished difference Result 393 states and 465 transitions. [2019-09-07 11:24:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 11:24:16,488 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 409 [2019-09-07 11:24:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:24:16,489 INFO L225 Difference]: With dead ends: 393 [2019-09-07 11:24:16,489 INFO L226 Difference]: Without dead ends: 234 [2019-09-07 11:24:16,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:24:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-07 11:24:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-09-07 11:24:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-07 11:24:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2019-09-07 11:24:16,496 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 409 [2019-09-07 11:24:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:24:16,496 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2019-09-07 11:24:16,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 11:24:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2019-09-07 11:24:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-07 11:24:16,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:24:16,499 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 31, 31, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:24:16,500 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:24:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:24:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 45542460, now seen corresponding path program 57 times [2019-09-07 11:24:16,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:24:16,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:24:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:16,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:24:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14045 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 13261 trivial. 0 not checked. [2019-09-07 11:24:17,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:24:17,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:24:17,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:24:39,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-07 11:24:39,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:24:39,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:24:39,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:24:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 14045 backedges. 5530 proven. 784 refuted. 0 times theorem prover too weak. 7731 trivial. 0 not checked. [2019-09-07 11:24:39,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:24:39,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 11:24:39,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:24:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:24:39,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:24:39,579 INFO L87 Difference]: Start difference. First operand 231 states and 265 transitions. Second operand 32 states. [2019-09-07 11:24:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:24:39,672 INFO L93 Difference]: Finished difference Result 335 states and 400 transitions. [2019-09-07 11:24:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:24:39,673 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 420 [2019-09-07 11:24:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:24:39,675 INFO L225 Difference]: With dead ends: 335 [2019-09-07 11:24:39,675 INFO L226 Difference]: Without dead ends: 234 [2019-09-07 11:24:39,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:24:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-07 11:24:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-09-07 11:24:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-07 11:24:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 267 transitions. [2019-09-07 11:24:39,682 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 267 transitions. Word has length 420 [2019-09-07 11:24:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:24:39,682 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 267 transitions. [2019-09-07 11:24:39,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:24:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 267 transitions. [2019-09-07 11:24:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-09-07 11:24:39,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:24:39,685 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 31, 31, 29, 29, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:24:39,685 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:24:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:24:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash -916611078, now seen corresponding path program 58 times [2019-09-07 11:24:39,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:24:39,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:24:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:39,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:24:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14102 backedges. 0 proven. 6863 refuted. 0 times theorem prover too weak. 7239 trivial. 0 not checked. [2019-09-07 11:24:40,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:24:40,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:24:40,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:24:40,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:24:40,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:24:40,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:24:40,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:24:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14102 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 13141 trivial. 0 not checked. [2019-09-07 11:24:41,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:24:41,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 65 [2019-09-07 11:24:41,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 11:24:41,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 11:24:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 11:24:41,479 INFO L87 Difference]: Start difference. First operand 233 states and 267 transitions. Second operand 65 states. [2019-09-07 11:24:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:24:41,737 INFO L93 Difference]: Finished difference Result 405 states and 479 transitions. [2019-09-07 11:24:41,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 11:24:41,738 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 422 [2019-09-07 11:24:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:24:41,739 INFO L225 Difference]: With dead ends: 405 [2019-09-07 11:24:41,739 INFO L226 Difference]: Without dead ends: 241 [2019-09-07 11:24:41,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 11:24:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-07 11:24:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-09-07 11:24:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-07 11:24:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 273 transitions. [2019-09-07 11:24:41,745 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 273 transitions. Word has length 422 [2019-09-07 11:24:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:24:41,746 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 273 transitions. [2019-09-07 11:24:41,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 11:24:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 273 transitions. [2019-09-07 11:24:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-07 11:24:41,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:24:41,749 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 32, 32, 29, 29, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:24:41,749 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:24:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:24:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash -619157831, now seen corresponding path program 59 times [2019-09-07 11:24:41,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:24:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:24:41,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:41,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:24:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14993 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 14152 trivial. 0 not checked. [2019-09-07 11:24:42,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:24:42,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:24:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:28:05,236 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2019-09-07 11:28:05,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:28:05,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:28:05,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:28:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14993 backedges. 5894 proven. 1426 refuted. 0 times theorem prover too weak. 7673 trivial. 0 not checked. [2019-09-07 11:28:06,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:28:06,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 64 [2019-09-07 11:28:06,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 11:28:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 11:28:06,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 11:28:06,146 INFO L87 Difference]: Start difference. First operand 238 states and 273 transitions. Second operand 64 states. [2019-09-07 11:28:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:28:06,389 INFO L93 Difference]: Finished difference Result 412 states and 487 transitions. [2019-09-07 11:28:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 11:28:06,389 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 433 [2019-09-07 11:28:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:28:06,390 INFO L225 Difference]: With dead ends: 412 [2019-09-07 11:28:06,391 INFO L226 Difference]: Without dead ends: 246 [2019-09-07 11:28:06,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 11:28:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-07 11:28:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2019-09-07 11:28:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-07 11:28:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 279 transitions. [2019-09-07 11:28:06,398 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 279 transitions. Word has length 433 [2019-09-07 11:28:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:28:06,398 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 279 transitions. [2019-09-07 11:28:06,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 11:28:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2019-09-07 11:28:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-07 11:28:06,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:28:06,401 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 32, 32, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:28:06,402 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:28:06,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:28:06,402 INFO L82 PathProgramCache]: Analyzing trace with hash 897291514, now seen corresponding path program 60 times [2019-09-07 11:28:06,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:28:06,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:28:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:06,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:28:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:28:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15907 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 15007 trivial. 0 not checked. [2019-09-07 11:28:07,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:28:07,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:28:07,208 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:28:53,842 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2019-09-07 11:28:53,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:28:53,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 11:28:53,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:28:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15907 backedges. 6282 proven. 900 refuted. 0 times theorem prover too weak. 8725 trivial. 0 not checked. [2019-09-07 11:28:53,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:28:53,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 11:28:53,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 11:28:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 11:28:53,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:28:53,961 INFO L87 Difference]: Start difference. First operand 243 states and 279 transitions. Second operand 34 states. [2019-09-07 11:28:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:28:54,066 INFO L93 Difference]: Finished difference Result 353 states and 422 transitions. [2019-09-07 11:28:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:28:54,066 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 444 [2019-09-07 11:28:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:28:54,068 INFO L225 Difference]: With dead ends: 353 [2019-09-07 11:28:54,068 INFO L226 Difference]: Without dead ends: 246 [2019-09-07 11:28:54,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:28:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-07 11:28:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-09-07 11:28:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-07 11:28:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 281 transitions. [2019-09-07 11:28:54,077 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 281 transitions. Word has length 444 [2019-09-07 11:28:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:28:54,077 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 281 transitions. [2019-09-07 11:28:54,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 11:28:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 281 transitions. [2019-09-07 11:28:54,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-07 11:28:54,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:28:54,080 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 32, 32, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:28:54,080 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:28:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:28:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash 822629048, now seen corresponding path program 61 times [2019-09-07 11:28:54,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:28:54,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:28:54,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:54,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:28:54,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:28:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15968 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 14944 trivial. 0 not checked. [2019-09-07 11:28:54,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:28:54,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:28:54,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:28:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:28:54,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:28:54,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:28:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15968 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 14944 trivial. 0 not checked. [2019-09-07 11:28:55,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:28:55,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 11:28:55,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:28:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:28:55,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:28:55,063 INFO L87 Difference]: Start difference. First operand 245 states and 281 transitions. Second operand 36 states. [2019-09-07 11:28:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:28:55,164 INFO L93 Difference]: Finished difference Result 422 states and 494 transitions. [2019-09-07 11:28:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:28:55,165 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 446 [2019-09-07 11:28:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:28:55,166 INFO L225 Difference]: With dead ends: 422 [2019-09-07 11:28:55,166 INFO L226 Difference]: Without dead ends: 248 [2019-09-07 11:28:55,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:28:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-07 11:28:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-09-07 11:28:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-07 11:28:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 283 transitions. [2019-09-07 11:28:55,174 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 283 transitions. Word has length 446 [2019-09-07 11:28:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:28:55,174 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 283 transitions. [2019-09-07 11:28:55,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:28:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 283 transitions. [2019-09-07 11:28:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-07 11:28:55,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:28:55,178 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 33, 33, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:28:55,178 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:28:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:28:55,178 INFO L82 PathProgramCache]: Analyzing trace with hash -382662950, now seen corresponding path program 62 times [2019-09-07 11:28:55,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:28:55,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:28:55,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:55,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:28:55,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:28:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16033 backedges. 0 proven. 7800 refuted. 0 times theorem prover too weak. 8233 trivial. 0 not checked. [2019-09-07 11:28:55,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:28:55,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:28:55,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:28:56,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:28:56,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:28:56,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:28:56,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:28:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16033 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 14944 trivial. 0 not checked. [2019-09-07 11:28:56,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:28:56,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 11:28:56,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 11:28:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 11:28:56,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 11:28:56,957 INFO L87 Difference]: Start difference. First operand 247 states and 283 transitions. Second operand 69 states. [2019-09-07 11:28:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:28:57,233 INFO L93 Difference]: Finished difference Result 429 states and 507 transitions. [2019-09-07 11:28:57,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 11:28:57,233 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 448 [2019-09-07 11:28:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:28:57,234 INFO L225 Difference]: With dead ends: 429 [2019-09-07 11:28:57,235 INFO L226 Difference]: Without dead ends: 255 [2019-09-07 11:28:57,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 11:28:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-07 11:28:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-09-07 11:28:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-07 11:28:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 289 transitions. [2019-09-07 11:28:57,241 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 289 transitions. Word has length 448 [2019-09-07 11:28:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:28:57,241 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 289 transitions. [2019-09-07 11:28:57,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 11:28:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 289 transitions. [2019-09-07 11:28:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-09-07 11:28:57,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:28:57,244 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 34, 34, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:28:57,245 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:28:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:28:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1512283815, now seen corresponding path program 63 times [2019-09-07 11:28:57,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:28:57,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:28:57,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:57,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:28:57,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:28:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:28:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16982 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 16021 trivial. 0 not checked. [2019-09-07 11:28:57,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:28:57,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:28:57,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:29:39,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-07 11:29:39,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:29:39,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 11:29:39,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:29:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16982 backedges. 6676 proven. 961 refuted. 0 times theorem prover too weak. 9345 trivial. 0 not checked. [2019-09-07 11:29:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:29:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 67 [2019-09-07 11:29:40,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 11:29:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 11:29:40,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=2740, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:29:40,352 INFO L87 Difference]: Start difference. First operand 252 states and 289 transitions. Second operand 67 states. [2019-09-07 11:29:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:29:40,572 INFO L93 Difference]: Finished difference Result 365 states and 436 transitions. [2019-09-07 11:29:40,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:29:40,572 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 459 [2019-09-07 11:29:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:29:40,574 INFO L225 Difference]: With dead ends: 365 [2019-09-07 11:29:40,575 INFO L226 Difference]: Without dead ends: 255 [2019-09-07 11:29:40,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1749, Invalid=2807, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 11:29:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-07 11:29:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-09-07 11:29:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-07 11:29:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2019-09-07 11:29:40,582 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 459 [2019-09-07 11:29:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:29:40,582 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2019-09-07 11:29:40,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 11:29:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2019-09-07 11:29:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-07 11:29:40,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:29:40,586 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 34, 34, 32, 32, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:29:40,586 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:29:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:29:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash -342065445, now seen corresponding path program 64 times [2019-09-07 11:29:40,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:29:40,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:29:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:29:40,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:29:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:29:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:29:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17045 backedges. 0 proven. 8291 refuted. 0 times theorem prover too weak. 8754 trivial. 0 not checked. [2019-09-07 11:29:41,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:29:41,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:29:41,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:29:41,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:29:41,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:29:41,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 11:29:41,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:29:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17045 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 15889 trivial. 0 not checked. [2019-09-07 11:29:42,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:29:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 71 [2019-09-07 11:29:42,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 11:29:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 11:29:42,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 11:29:42,491 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand 71 states. [2019-09-07 11:29:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:29:42,770 INFO L93 Difference]: Finished difference Result 441 states and 521 transitions. [2019-09-07 11:29:42,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 11:29:42,771 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 461 [2019-09-07 11:29:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:29:42,772 INFO L225 Difference]: With dead ends: 441 [2019-09-07 11:29:42,772 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 11:29:42,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 11:29:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 11:29:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2019-09-07 11:29:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-07 11:29:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 297 transitions. [2019-09-07 11:29:42,779 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 297 transitions. Word has length 461 [2019-09-07 11:29:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:29:42,779 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 297 transitions. [2019-09-07 11:29:42,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 11:29:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 297 transitions. [2019-09-07 11:29:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-07 11:29:42,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:29:42,782 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 102, 35, 35, 32, 32, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:29:42,783 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:29:42,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:29:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1752674044, now seen corresponding path program 65 times [2019-09-07 11:29:42,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:29:42,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:29:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:29:42,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:29:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:29:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:29:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 16999 trivial. 0 not checked. [2019-09-07 11:29:43,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:29:43,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:29:43,474 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1