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-673a906-m [2019-10-02 14:41:44,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:41:44,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:41:45,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:41:45,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:41:45,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:41:45,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:41:45,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:41:45,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:41:45,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:41:45,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:41:45,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:41:45,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:41:45,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:41:45,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:41:45,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:41:45,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:41:45,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:41:45,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:41:45,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:41:45,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:41:45,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:41:45,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:41:45,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:41:45,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:41:45,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:41:45,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:41:45,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:41:45,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:41:45,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:41:45,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:41:45,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:41:45,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:41:45,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:41:45,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:41:45,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:41:45,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:41:45,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:41:45,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:41:45,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:41:45,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:41:45,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:41:45,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:41:45,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:41:45,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:41:45,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:41:45,059 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:41:45,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:41:45,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:41:45,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:41:45,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:41:45,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:41:45,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:41:45,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:41:45,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:41:45,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:41:45,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:41:45,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:41:45,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:41:45,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:41:45,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:41:45,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:41:45,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:41:45,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:41:45,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:41:45,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:41:45,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:41:45,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:41:45,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:41:45,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:41:45,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:41:45,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:41:45,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:41:45,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:41:45,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:41:45,111 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:41:45,112 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep40-1.i [2019-10-02 14:41:45,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5c4cf71/bed6836dc4664734a8f3c1e4367fa6a8/FLAG8705edacd [2019-10-02 14:41:45,681 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:41:45,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep40-1.i [2019-10-02 14:41:45,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5c4cf71/bed6836dc4664734a8f3c1e4367fa6a8/FLAG8705edacd [2019-10-02 14:41:46,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5c4cf71/bed6836dc4664734a8f3c1e4367fa6a8 [2019-10-02 14:41:46,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:41:46,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:41:46,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:46,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:41:46,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:41:46,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6a6dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46, skipping insertion in model container [2019-10-02 14:41:46,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,041 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:41:46,065 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:41:46,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:46,329 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:41:46,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:46,365 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:41:46,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46 WrapperNode [2019-10-02 14:41:46,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:46,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:41:46,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:41:46,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:41:46,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... [2019-10-02 14:41:46,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:41:46,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:41:46,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:41:46,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:41:46,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:41:46,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:41:46,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:41:46,584 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-10-02 14:41:46,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:41:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:41:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:41:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:41:46,943 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:41:46,944 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 14:41:46,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:46 BoogieIcfgContainer [2019-10-02 14:41:46,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:41:46,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:41:46,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:41:46,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:41:46,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:41:46" (1/3) ... [2019-10-02 14:41:46,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47486c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:46, skipping insertion in model container [2019-10-02 14:41:46,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:46" (2/3) ... [2019-10-02 14:41:46,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47486c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:46, skipping insertion in model container [2019-10-02 14:41:46,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:46" (3/3) ... [2019-10-02 14:41:46,953 INFO L109 eAbstractionObserver]: Analyzing ICFG sep40-1.i [2019-10-02 14:41:46,961 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:41:46,968 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:41:46,985 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:41:47,021 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:41:47,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:41:47,022 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:41:47,022 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:41:47,022 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:41:47,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:41:47,023 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:41:47,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:41:47,023 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:41:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-02 14:41:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:41:47,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:47,049 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:47,050 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2019-10-02 14:41:47,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:47,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:47,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:47,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:41:47,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:47,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:41:47,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:41:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:41:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:41:47,250 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-02 14:41:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:47,276 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-10-02 14:41:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:41:47,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-02 14:41:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:47,287 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:41:47,287 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 14:41:47,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:41:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 14:41:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 14:41:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 14:41:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-02 14:41:47,340 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2019-10-02 14:41:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:47,340 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-02 14:41:47,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:41:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-02 14:41:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:41:47,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:47,344 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:47,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2019-10-02 14:41:47,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:47,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:47,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:47,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:41:47,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:47,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:41:47,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:41:47,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:41:47,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:47,418 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-02 14:41:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:47,461 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-10-02 14:41:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:47,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:41:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:47,464 INFO L225 Difference]: With dead ends: 48 [2019-10-02 14:41:47,464 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 14:41:47,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 14:41:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-02 14:41:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 14:41:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-10-02 14:41:47,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2019-10-02 14:41:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:47,474 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-10-02 14:41:47,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:41:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-10-02 14:41:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:41:47,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:47,476 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:47,476 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:47,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:47,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2019-10-02 14:41:47,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:47,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:47,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:47,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:41:47,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:47,581 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:47,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:47,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:41:47,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 14:41:47,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:41:47,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 14:41:47,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:41:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:41:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:47,718 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-10-02 14:41:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:47,757 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-10-02 14:41:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:47,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-02 14:41:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:47,759 INFO L225 Difference]: With dead ends: 49 [2019-10-02 14:41:47,759 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 14:41:47,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 14:41:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-10-02 14:41:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 14:41:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-02 14:41:47,773 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2019-10-02 14:41:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:47,773 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-02 14:41:47,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:41:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-02 14:41:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 14:41:47,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:47,776 INFO L411 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-10-02 14:41:47,777 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:47,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2019-10-02 14:41:47,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:47,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:47,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:47,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:41:47,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:41:47,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:41:47,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:47,886 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-10-02 14:41:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:47,902 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-10-02 14:41:47,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:47,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 14:41:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:47,905 INFO L225 Difference]: With dead ends: 45 [2019-10-02 14:41:47,905 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 14:41:47,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 14:41:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-02 14:41:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 14:41:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-02 14:41:47,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2019-10-02 14:41:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:47,916 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-02 14:41:47,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:41:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-02 14:41:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 14:41:47,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:47,918 INFO L411 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-10-02 14:41:47,918 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2019-10-02 14:41:47,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:48,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:48,031 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:48,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:48,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:48,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:48,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:48,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:41:48,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:41:48,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:41:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:41:48,200 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-02 14:41:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:48,249 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-10-02 14:41:48,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:41:48,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 14:41:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:48,253 INFO L225 Difference]: With dead ends: 54 [2019-10-02 14:41:48,254 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 14:41:48,255 INFO L640 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-10-02 14:41:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 14:41:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-02 14:41:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 14:41:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-02 14:41:48,267 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2019-10-02 14:41:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:48,267 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-02 14:41:48,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:41:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-02 14:41:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 14:41:48,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:48,270 INFO L411 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-10-02 14:41:48,270 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2019-10-02 14:41:48,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:48,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:48,378 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:48,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:41:48,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:48,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:48,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:41:48,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:48,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:48,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:41:48,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:41:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:41:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:41:48,483 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2019-10-02 14:41:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:48,526 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-02 14:41:48,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:41:48,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-02 14:41:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:48,528 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:41:48,528 INFO L226 Difference]: Without dead ends: 35 [2019-10-02 14:41:48,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:41:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-02 14:41:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-02 14:41:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 14:41:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-02 14:41:48,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 47 [2019-10-02 14:41:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:48,536 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-02 14:41:48,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:41:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-02 14:41:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 14:41:48,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:48,537 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:48,537 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1005160965, now seen corresponding path program 3 times [2019-10-02 14:41:48,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:48,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:48,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:48,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:48,657 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:48,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:41:48,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 14:41:48,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:48,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:48,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 14:41:48,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:48,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 14:41:48,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:41:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:41:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:41:48,749 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2019-10-02 14:41:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:48,808 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-10-02 14:41:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:41:48,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-02 14:41:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:48,811 INFO L225 Difference]: With dead ends: 63 [2019-10-02 14:41:48,811 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 14:41:48,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:41:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 14:41:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-10-02 14:41:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 14:41:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-02 14:41:48,819 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 49 [2019-10-02 14:41:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:48,819 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-02 14:41:48,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:41:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-02 14:41:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:41:48,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:48,824 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:48,825 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 742022364, now seen corresponding path program 4 times [2019-10-02 14:41:48,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 14:41:48,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:48,968 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:48,988 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-10-02 14:41:49,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:41:49,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:49,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:41:49,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:41:49,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:49,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-10-02 14:41:49,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:41:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:41:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:49,112 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 10 states. [2019-10-02 14:41:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:49,183 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-10-02 14:41:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:41:49,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-02 14:41:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:49,185 INFO L225 Difference]: With dead ends: 71 [2019-10-02 14:41:49,186 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 14:41:49,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 14:41:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-10-02 14:41:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 14:41:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-10-02 14:41:49,194 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 60 [2019-10-02 14:41:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:49,194 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-10-02 14:41:49,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:41:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-10-02 14:41:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 14:41:49,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:49,196 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:49,197 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash -535819369, now seen corresponding path program 5 times [2019-10-02 14:41:49,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:49,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:49,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:49,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-10-02 14:41:49,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:49,357 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:49,387 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:41:49,451 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 14:41:49,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:49,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:41:49,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:49,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:49,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-02 14:41:49,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:41:49,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:41:49,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:41:49,510 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-10-02 14:41:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:49,589 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2019-10-02 14:41:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:41:49,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-10-02 14:41:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:49,593 INFO L225 Difference]: With dead ends: 79 [2019-10-02 14:41:49,593 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 14:41:49,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:41:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 14:41:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-10-02 14:41:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 14:41:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-10-02 14:41:49,610 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 71 [2019-10-02 14:41:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:49,610 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-02 14:41:49,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:41:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-10-02 14:41:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 14:41:49,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:49,613 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:49,613 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash 778847808, now seen corresponding path program 6 times [2019-10-02 14:41:49,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:49,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:49,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:49,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-10-02 14:41:49,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:49,770 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:49,792 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-10-02 14:41:49,849 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 14:41:49,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:49,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:49,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-02 14:41:49,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:49,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-02 14:41:49,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:41:49,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:41:49,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:49,909 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2019-10-02 14:41:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:49,985 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2019-10-02 14:41:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:41:49,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-10-02 14:41:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:49,987 INFO L225 Difference]: With dead ends: 85 [2019-10-02 14:41:49,987 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 14:41:49,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 14:41:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-10-02 14:41:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 14:41:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-10-02 14:41:49,998 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 82 [2019-10-02 14:41:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:49,998 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-10-02 14:41:49,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:41:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-10-02 14:41:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 14:41:50,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:50,002 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:50,002 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 27018272, now seen corresponding path program 7 times [2019-10-02 14:41:50,003 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:50,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:50,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:50,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:50,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:50,138 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:50,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:50,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:41:50,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:50,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:50,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:41:50,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:41:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:41:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:50,288 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 11 states. [2019-10-02 14:41:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:50,337 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2019-10-02 14:41:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:41:50,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-10-02 14:41:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:50,338 INFO L225 Difference]: With dead ends: 88 [2019-10-02 14:41:50,338 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 14:41:50,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 14:41:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-02 14:41:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 14:41:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-02 14:41:50,345 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 86 [2019-10-02 14:41:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:50,346 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-02 14:41:50,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:41:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-02 14:41:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 14:41:50,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:50,347 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:50,348 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:50,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1793036866, now seen corresponding path program 8 times [2019-10-02 14:41:50,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:50,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:50,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:50,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:50,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:50,473 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:50,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:41:50,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:50,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:50,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:41:50,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:50,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:41:50,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:41:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:41:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:41:50,611 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 12 states. [2019-10-02 14:41:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:50,662 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-10-02 14:41:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:41:50,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-10-02 14:41:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:50,666 INFO L225 Difference]: With dead ends: 90 [2019-10-02 14:41:50,667 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 14:41:50,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:41:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 14:41:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-02 14:41:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 14:41:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-10-02 14:41:50,677 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 88 [2019-10-02 14:41:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:50,677 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-10-02 14:41:50,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:41:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-10-02 14:41:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 14:41:50,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:50,679 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:50,680 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1870143516, now seen corresponding path program 9 times [2019-10-02 14:41:50,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:50,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:50,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:50,825 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:50,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:41:50,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 14:41:50,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:50,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:41:50,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-02 14:41:50,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:50,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 14:41:50,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:41:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:41:50,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:41:50,960 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 15 states. [2019-10-02 14:41:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:51,028 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2019-10-02 14:41:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:41:51,028 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-10-02 14:41:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:51,029 INFO L225 Difference]: With dead ends: 95 [2019-10-02 14:41:51,029 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 14:41:51,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:41:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 14:41:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-02 14:41:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 14:41:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-10-02 14:41:51,036 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 90 [2019-10-02 14:41:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:51,036 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-10-02 14:41:51,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:41:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-10-02 14:41:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 14:41:51,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:51,037 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:51,038 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:51,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1573371196, now seen corresponding path program 10 times [2019-10-02 14:41:51,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:51,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:51,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:51,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:51,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 14:41:51,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:51,264 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:51,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:41:51,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:41:51,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:51,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:41:51,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 14:41:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:51,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 14:41:51,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:41:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:41:51,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:41:51,437 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 14 states. [2019-10-02 14:41:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:51,523 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-10-02 14:41:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:41:51,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2019-10-02 14:41:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:51,525 INFO L225 Difference]: With dead ends: 98 [2019-10-02 14:41:51,525 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 14:41:51,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:41:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 14:41:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-02 14:41:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 14:41:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-10-02 14:41:51,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 94 [2019-10-02 14:41:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:51,534 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-10-02 14:41:51,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:41:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-10-02 14:41:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 14:41:51,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:51,537 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:51,537 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1553707290, now seen corresponding path program 11 times [2019-10-02 14:41:51,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:51,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:51,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 14:41:51,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:51,729 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:52,194 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 14:41:52,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:52,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:41:52,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-10-02 14:41:52,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:52,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-02 14:41:52,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:41:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:41:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:41:52,300 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 19 states. [2019-10-02 14:41:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:52,390 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2019-10-02 14:41:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:41:52,391 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-10-02 14:41:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:52,392 INFO L225 Difference]: With dead ends: 105 [2019-10-02 14:41:52,392 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 14:41:52,393 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:41:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 14:41:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-10-02 14:41:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-02 14:41:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-10-02 14:41:52,399 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 96 [2019-10-02 14:41:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:52,399 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-10-02 14:41:52,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:41:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-10-02 14:41:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 14:41:52,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:52,401 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:52,401 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash 492928205, now seen corresponding path program 12 times [2019-10-02 14:41:52,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:52,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:52,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:52,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-10-02 14:41:52,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:52,610 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:52,634 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:52,809 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 14:41:52,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:52,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:41:52,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-10-02 14:41:52,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:52,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-02 14:41:52,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:41:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:41:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:41:52,905 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 19 states. [2019-10-02 14:41:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:53,005 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2019-10-02 14:41:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:41:53,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 107 [2019-10-02 14:41:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:53,007 INFO L225 Difference]: With dead ends: 111 [2019-10-02 14:41:53,007 INFO L226 Difference]: Without dead ends: 74 [2019-10-02 14:41:53,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:41:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-02 14:41:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-10-02 14:41:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-02 14:41:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-02 14:41:53,018 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 107 [2019-10-02 14:41:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:53,018 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-02 14:41:53,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:41:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-02 14:41:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 14:41:53,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:53,020 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:53,020 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1983679981, now seen corresponding path program 13 times [2019-10-02 14:41:53,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:53,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:53,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:53,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 178 proven. 35 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-10-02 14:41:53,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:53,160 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:53,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:53,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:41:53,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-02 14:41:53,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:53,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16] total 22 [2019-10-02 14:41:53,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 14:41:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 14:41:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:41:53,515 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 22 states. [2019-10-02 14:41:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:53,606 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2019-10-02 14:41:53,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:41:53,607 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-10-02 14:41:53,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:53,608 INFO L225 Difference]: With dead ends: 119 [2019-10-02 14:41:53,608 INFO L226 Difference]: Without dead ends: 80 [2019-10-02 14:41:53,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:41:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-02 14:41:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-10-02 14:41:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 14:41:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-02 14:41:53,615 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 111 [2019-10-02 14:41:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:53,615 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-02 14:41:53,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 14:41:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-10-02 14:41:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 14:41:53,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:53,617 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:53,617 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:53,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:53,618 INFO L82 PathProgramCache]: Analyzing trace with hash -770159190, now seen corresponding path program 14 times [2019-10-02 14:41:53,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:53,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:53,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-02 14:41:53,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:53,864 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:53,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:41:53,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:53,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:54,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:41:54,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-02 14:41:54,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:54,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 14:41:54,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:41:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:41:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:41:54,048 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 18 states. [2019-10-02 14:41:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:54,123 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-10-02 14:41:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:41:54,123 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 122 [2019-10-02 14:41:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:54,124 INFO L225 Difference]: With dead ends: 122 [2019-10-02 14:41:54,125 INFO L226 Difference]: Without dead ends: 80 [2019-10-02 14:41:54,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:41:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-02 14:41:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-10-02 14:41:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-02 14:41:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-10-02 14:41:54,136 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 122 [2019-10-02 14:41:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:54,136 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-10-02 14:41:54,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:41:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-10-02 14:41:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 14:41:54,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:54,138 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:54,138 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash -728321332, now seen corresponding path program 15 times [2019-10-02 14:41:54,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:54,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:54,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-02 14:41:54,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:54,423 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:54,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:41:54,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 14:41:54,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:54,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:41:54,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 250 proven. 16 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2019-10-02 14:41:54,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:54,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-10-02 14:41:54,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:41:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:41:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:41:54,662 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 23 states. [2019-10-02 14:41:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:54,753 INFO L93 Difference]: Finished difference Result 127 states and 148 transitions. [2019-10-02 14:41:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:41:54,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-10-02 14:41:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:54,754 INFO L225 Difference]: With dead ends: 127 [2019-10-02 14:41:54,754 INFO L226 Difference]: Without dead ends: 85 [2019-10-02 14:41:54,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:41:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-02 14:41:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-10-02 14:41:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 14:41:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-10-02 14:41:54,760 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 124 [2019-10-02 14:41:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:54,760 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-10-02 14:41:54,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:41:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-10-02 14:41:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 14:41:54,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:54,762 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 16, 16, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:54,762 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash 549336236, now seen corresponding path program 16 times [2019-10-02 14:41:54,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:54,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:54,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:54,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-02 14:41:55,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:55,005 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:55,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:41:55,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:41:55,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:55,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:41:55,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-02 14:41:55,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:55,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 14:41:55,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:41:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:41:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:41:55,142 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 20 states. [2019-10-02 14:41:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:55,209 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2019-10-02 14:41:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:41:55,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2019-10-02 14:41:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:55,210 INFO L225 Difference]: With dead ends: 130 [2019-10-02 14:41:55,210 INFO L226 Difference]: Without dead ends: 86 [2019-10-02 14:41:55,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:41:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-02 14:41:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-10-02 14:41:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 14:41:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2019-10-02 14:41:55,216 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 128 [2019-10-02 14:41:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:55,216 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2019-10-02 14:41:55,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:41:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2019-10-02 14:41:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 14:41:55,218 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:55,218 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:55,218 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1464813490, now seen corresponding path program 17 times [2019-10-02 14:41:55,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:55,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:55,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:55,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:55,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-02 14:41:55,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:55,502 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:55,527 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:41:56,401 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-02 14:41:56,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:56,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:41:56,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-10-02 14:41:56,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:56,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-02 14:41:56,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:41:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:41:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:41:56,531 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 27 states. [2019-10-02 14:41:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:56,733 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2019-10-02 14:41:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:41:56,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 130 [2019-10-02 14:41:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:56,734 INFO L225 Difference]: With dead ends: 137 [2019-10-02 14:41:56,735 INFO L226 Difference]: Without dead ends: 93 [2019-10-02 14:41:56,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:41:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-02 14:41:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-10-02 14:41:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-02 14:41:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-10-02 14:41:56,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 130 [2019-10-02 14:41:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:56,741 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-10-02 14:41:56,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:41:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-10-02 14:41:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 14:41:56,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:56,744 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 18, 18, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:56,745 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1603252197, now seen corresponding path program 18 times [2019-10-02 14:41:56,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:56,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:56,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2019-10-02 14:41:57,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:57,108 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:41:57,547 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 14:41:57,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:57,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:41:57,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 332 proven. 25 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-10-02 14:41:57,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:57,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8] total 27 [2019-10-02 14:41:57,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:41:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:41:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:41:57,685 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 27 states. [2019-10-02 14:41:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:57,819 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-10-02 14:41:57,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:41:57,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 141 [2019-10-02 14:41:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:57,822 INFO L225 Difference]: With dead ends: 143 [2019-10-02 14:41:57,822 INFO L226 Difference]: Without dead ends: 96 [2019-10-02 14:41:57,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:41:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-02 14:41:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-10-02 14:41:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 14:41:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-10-02 14:41:57,829 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 141 [2019-10-02 14:41:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:57,829 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-10-02 14:41:57,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:41:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-10-02 14:41:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 14:41:57,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:57,831 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 19, 19, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:57,831 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:57,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:57,832 INFO L82 PathProgramCache]: Analyzing trace with hash 708223493, now seen corresponding path program 19 times [2019-10-02 14:41:57,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:57,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:57,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:57,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:41:58,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:58,181 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:58,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:58,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:41:58,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:41:58,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:58,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 14:41:58,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:41:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:41:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:41:58,327 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 23 states. [2019-10-02 14:41:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:58,413 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2019-10-02 14:41:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:41:58,414 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2019-10-02 14:41:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:58,415 INFO L225 Difference]: With dead ends: 146 [2019-10-02 14:41:58,415 INFO L226 Difference]: Without dead ends: 97 [2019-10-02 14:41:58,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:41:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-02 14:41:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-10-02 14:41:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 14:41:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-10-02 14:41:58,420 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 145 [2019-10-02 14:41:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:58,420 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-10-02 14:41:58,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:41:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-10-02 14:41:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 14:41:58,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:58,422 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:58,422 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1334548131, now seen corresponding path program 20 times [2019-10-02 14:41:58,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:58,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:58,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:41:58,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:58,775 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:58,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:41:58,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:58,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:58,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:41:58,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:41:58,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:58,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 14:41:58,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:41:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:41:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:41:58,954 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 24 states. [2019-10-02 14:41:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:59,028 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2019-10-02 14:41:59,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:41:59,029 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 147 [2019-10-02 14:41:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:59,030 INFO L225 Difference]: With dead ends: 148 [2019-10-02 14:41:59,030 INFO L226 Difference]: Without dead ends: 99 [2019-10-02 14:41:59,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:41:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-02 14:41:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-10-02 14:41:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-02 14:41:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-10-02 14:41:59,036 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 147 [2019-10-02 14:41:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:59,037 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-10-02 14:41:59,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:41:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-10-02 14:41:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 14:41:59,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:59,039 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:59,039 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1937103809, now seen corresponding path program 21 times [2019-10-02 14:41:59,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:59,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:41:59,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:59,387 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:59,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:41:59,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 14:41:59,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:59,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:41:59,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 330 proven. 70 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2019-10-02 14:41:59,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:59,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 32 [2019-10-02 14:41:59,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:41:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:41:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:41:59,734 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 32 states. [2019-10-02 14:41:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:59,870 INFO L93 Difference]: Finished difference Result 155 states and 183 transitions. [2019-10-02 14:41:59,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:41:59,870 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 149 [2019-10-02 14:41:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:59,871 INFO L225 Difference]: With dead ends: 155 [2019-10-02 14:41:59,871 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 14:41:59,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:41:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 14:41:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-10-02 14:41:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 14:41:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-10-02 14:41:59,877 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 149 [2019-10-02 14:41:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:59,878 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-10-02 14:41:59,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:41:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-10-02 14:41:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:41:59,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:59,880 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 22, 22, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:59,880 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:59,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:59,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1388245546, now seen corresponding path program 22 times [2019-10-02 14:41:59,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:59,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2019-10-02 14:42:00,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:00,335 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:00,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:00,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:00,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:00,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:42:00,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 424 proven. 92 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2019-10-02 14:42:00,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:00,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11] total 34 [2019-10-02 14:42:00,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:42:00,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:42:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=768, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:00,645 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 34 states. [2019-10-02 14:42:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:00,752 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2019-10-02 14:42:00,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:42:00,753 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 160 [2019-10-02 14:42:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:00,753 INFO L225 Difference]: With dead ends: 163 [2019-10-02 14:42:00,754 INFO L226 Difference]: Without dead ends: 111 [2019-10-02 14:42:00,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=768, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-02 14:42:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-10-02 14:42:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-02 14:42:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-10-02 14:42:00,760 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 160 [2019-10-02 14:42:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:00,761 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-10-02 14:42:00,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:42:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-10-02 14:42:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 14:42:00,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:00,763 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 23, 23, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:00,763 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash 147307741, now seen corresponding path program 23 times [2019-10-02 14:42:00,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:00,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2019-10-02 14:42:01,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:01,158 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:02,172 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-02 14:42:02,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:02,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:42:02,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 526 proven. 117 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:02,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:02,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 36 [2019-10-02 14:42:02,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:42:02,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:42:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:42:02,416 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 36 states. [2019-10-02 14:42:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:02,539 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2019-10-02 14:42:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 14:42:02,540 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 171 [2019-10-02 14:42:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:02,541 INFO L225 Difference]: With dead ends: 171 [2019-10-02 14:42:02,541 INFO L226 Difference]: Without dead ends: 116 [2019-10-02 14:42:02,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:42:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-02 14:42:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2019-10-02 14:42:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-02 14:42:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-10-02 14:42:02,548 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 171 [2019-10-02 14:42:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:02,548 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-10-02 14:42:02,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:42:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-10-02 14:42:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 14:42:02,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:02,550 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:02,550 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash -687129670, now seen corresponding path program 24 times [2019-10-02 14:42:02,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:02,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2019-10-02 14:42:02,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:02,749 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:02,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:03,656 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-02 14:42:03,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:03,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:42:03,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:03,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:03,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-10-02 14:42:03,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:42:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:42:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:42:03,767 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 20 states. [2019-10-02 14:42:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:03,851 INFO L93 Difference]: Finished difference Result 178 states and 211 transitions. [2019-10-02 14:42:03,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:42:03,852 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 182 [2019-10-02 14:42:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:03,853 INFO L225 Difference]: With dead ends: 178 [2019-10-02 14:42:03,853 INFO L226 Difference]: Without dead ends: 121 [2019-10-02 14:42:03,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:42:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-02 14:42:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2019-10-02 14:42:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-02 14:42:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2019-10-02 14:42:03,862 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 182 [2019-10-02 14:42:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:03,862 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2019-10-02 14:42:03,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:42:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2019-10-02 14:42:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 14:42:03,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:03,866 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:03,866 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1785524387, now seen corresponding path program 25 times [2019-10-02 14:42:03,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:03,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:03,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2323 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-10-02 14:42:04,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:04,123 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:04,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:04,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:42:04,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2323 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1747 trivial. 0 not checked. [2019-10-02 14:42:04,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:04,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27] total 39 [2019-10-02 14:42:04,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 14:42:04,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 14:42:04,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:42:04,702 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 39 states. [2019-10-02 14:42:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:04,876 INFO L93 Difference]: Finished difference Result 189 states and 225 transitions. [2019-10-02 14:42:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 14:42:04,876 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 193 [2019-10-02 14:42:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:04,877 INFO L225 Difference]: With dead ends: 189 [2019-10-02 14:42:04,877 INFO L226 Difference]: Without dead ends: 126 [2019-10-02 14:42:04,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:42:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-02 14:42:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2019-10-02 14:42:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-02 14:42:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2019-10-02 14:42:04,884 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 193 [2019-10-02 14:42:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:04,885 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2019-10-02 14:42:04,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 14:42:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2019-10-02 14:42:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 14:42:04,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:04,888 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 25, 25, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:04,888 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash 158528186, now seen corresponding path program 26 times [2019-10-02 14:42:04,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:04,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:04,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:04,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:04,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2687 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2638 trivial. 0 not checked. [2019-10-02 14:42:05,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:05,084 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:05,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:05,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:05,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:42:05,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2687 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 2062 trivial. 0 not checked. [2019-10-02 14:42:05,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:05,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 28] total 36 [2019-10-02 14:42:05,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:42:05,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:42:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=838, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:42:05,738 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 36 states. [2019-10-02 14:42:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:05,862 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2019-10-02 14:42:05,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 14:42:05,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 204 [2019-10-02 14:42:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:05,864 INFO L225 Difference]: With dead ends: 195 [2019-10-02 14:42:05,864 INFO L226 Difference]: Without dead ends: 129 [2019-10-02 14:42:05,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=422, Invalid=838, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:42:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-02 14:42:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-10-02 14:42:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-02 14:42:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2019-10-02 14:42:05,870 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 204 [2019-10-02 14:42:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:05,870 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2019-10-02 14:42:05,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:42:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2019-10-02 14:42:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 14:42:05,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:05,872 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 26, 26, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:05,872 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:05,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:05,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1465220710, now seen corresponding path program 27 times [2019-10-02 14:42:05,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:05,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:05,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:05,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:05,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2689 trivial. 0 not checked. [2019-10-02 14:42:06,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:06,078 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:06,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 14:42:06,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:06,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:42:06,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 922 proven. 64 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2019-10-02 14:42:06,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:06,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:42:06,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:42:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:42:06,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:06,541 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 12 states. [2019-10-02 14:42:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:06,592 INFO L93 Difference]: Finished difference Result 177 states and 206 transitions. [2019-10-02 14:42:06,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:42:06,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 208 [2019-10-02 14:42:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:06,594 INFO L225 Difference]: With dead ends: 177 [2019-10-02 14:42:06,594 INFO L226 Difference]: Without dead ends: 130 [2019-10-02 14:42:06,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-02 14:42:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-10-02 14:42:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-02 14:42:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2019-10-02 14:42:06,600 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 208 [2019-10-02 14:42:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:06,601 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2019-10-02 14:42:06,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:42:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2019-10-02 14:42:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 14:42:06,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:06,603 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 26, 26, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:06,603 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1138661288, now seen corresponding path program 28 times [2019-10-02 14:42:06,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:06,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:06,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2770 backedges. 920 proven. 210 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-02 14:42:06,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:06,887 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:06,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:07,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:07,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:07,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:42:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2770 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 2094 trivial. 0 not checked. [2019-10-02 14:42:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:07,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 29] total 42 [2019-10-02 14:42:07,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:42:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:42:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:42:07,734 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 42 states. [2019-10-02 14:42:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:07,906 INFO L93 Difference]: Finished difference Result 207 states and 245 transitions. [2019-10-02 14:42:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 14:42:07,908 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 210 [2019-10-02 14:42:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:07,909 INFO L225 Difference]: With dead ends: 207 [2019-10-02 14:42:07,909 INFO L226 Difference]: Without dead ends: 137 [2019-10-02 14:42:07,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:42:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-02 14:42:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-10-02 14:42:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-02 14:42:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2019-10-02 14:42:07,922 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 210 [2019-10-02 14:42:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:07,923 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2019-10-02 14:42:07,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:42:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2019-10-02 14:42:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 14:42:07,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:07,924 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 27, 27, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:07,925 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:07,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1814998501, now seen corresponding path program 29 times [2019-10-02 14:42:07,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:07,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:07,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:07,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:07,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2019-10-02 14:42:08,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:08,537 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:08,582 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:22,298 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-02 14:42:22,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:22,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:42:22,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1070 proven. 247 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:22,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:22,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 16] total 44 [2019-10-02 14:42:22,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 14:42:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 14:42:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1338, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:42:22,658 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 44 states. [2019-10-02 14:42:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:22,845 INFO L93 Difference]: Finished difference Result 215 states and 255 transitions. [2019-10-02 14:42:22,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 14:42:22,846 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 221 [2019-10-02 14:42:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:22,848 INFO L225 Difference]: With dead ends: 215 [2019-10-02 14:42:22,848 INFO L226 Difference]: Without dead ends: 142 [2019-10-02 14:42:22,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=554, Invalid=1338, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:42:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-02 14:42:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2019-10-02 14:42:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-02 14:42:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2019-10-02 14:42:22,857 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 221 [2019-10-02 14:42:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:22,857 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2019-10-02 14:42:22,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-02 14:42:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2019-10-02 14:42:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 14:42:22,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:22,859 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 28, 28, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:22,859 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:22,860 INFO L82 PathProgramCache]: Analyzing trace with hash -969005124, now seen corresponding path program 30 times [2019-10-02 14:42:22,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:22,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3589 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2019-10-02 14:42:23,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:23,490 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:23,533 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:24,991 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-02 14:42:24,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:24,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:42:24,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3589 backedges. 1242 proven. 81 refuted. 0 times theorem prover too weak. 2266 trivial. 0 not checked. [2019-10-02 14:42:25,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:25,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 12] total 41 [2019-10-02 14:42:25,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:42:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:42:25,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1110, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:42:25,235 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand 41 states. [2019-10-02 14:42:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:25,373 INFO L93 Difference]: Finished difference Result 221 states and 258 transitions. [2019-10-02 14:42:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:42:25,373 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 232 [2019-10-02 14:42:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:25,375 INFO L225 Difference]: With dead ends: 221 [2019-10-02 14:42:25,375 INFO L226 Difference]: Without dead ends: 145 [2019-10-02 14:42:25,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=530, Invalid=1110, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:42:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-02 14:42:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-02 14:42:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-02 14:42:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2019-10-02 14:42:25,383 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 232 [2019-10-02 14:42:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:25,383 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2019-10-02 14:42:25,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:42:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2019-10-02 14:42:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 14:42:25,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:25,385 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 29, 29, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:25,385 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1429849956, now seen corresponding path program 31 times [2019-10-02 14:42:25,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:25,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3665 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 2824 trivial. 0 not checked. [2019-10-02 14:42:26,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:26,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:26,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:26,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 14:42:26,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3665 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 2824 trivial. 0 not checked. [2019-10-02 14:42:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:26,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-02 14:42:26,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:42:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:42:26,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:42:26,467 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 33 states. [2019-10-02 14:42:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:26,570 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2019-10-02 14:42:26,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:42:26,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 236 [2019-10-02 14:42:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:26,573 INFO L225 Difference]: With dead ends: 224 [2019-10-02 14:42:26,573 INFO L226 Difference]: Without dead ends: 146 [2019-10-02 14:42:26,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:42:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-02 14:42:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-02 14:42:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-02 14:42:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2019-10-02 14:42:26,578 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 236 [2019-10-02 14:42:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:26,579 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2019-10-02 14:42:26,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:42:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2019-10-02 14:42:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 14:42:26,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:26,581 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:26,581 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1419427522, now seen corresponding path program 32 times [2019-10-02 14:42:26,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:26,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3724 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 2824 trivial. 0 not checked. [2019-10-02 14:42:27,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:27,266 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:27,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:27,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:27,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:27,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:42:27,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3724 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 2824 trivial. 0 not checked. [2019-10-02 14:42:27,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:27,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-02 14:42:27,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:42:27,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:42:27,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:27,621 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 34 states. [2019-10-02 14:42:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:27,799 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-10-02 14:42:27,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 14:42:27,800 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 238 [2019-10-02 14:42:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:27,801 INFO L225 Difference]: With dead ends: 226 [2019-10-02 14:42:27,801 INFO L226 Difference]: Without dead ends: 148 [2019-10-02 14:42:27,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-02 14:42:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-02 14:42:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-02 14:42:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2019-10-02 14:42:27,810 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 238 [2019-10-02 14:42:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:27,811 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2019-10-02 14:42:27,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:42:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2019-10-02 14:42:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 14:42:27,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:27,814 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 31, 31, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:27,814 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash 6596960, now seen corresponding path program 33 times [2019-10-02 14:42:27,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:27,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3785 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 2824 trivial. 0 not checked. [2019-10-02 14:42:28,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:28,452 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:28,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:28,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-02 14:42:28,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:28,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:42:28,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3785 backedges. 1242 proven. 100 refuted. 0 times theorem prover too weak. 2443 trivial. 0 not checked. [2019-10-02 14:42:29,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:29,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 13] total 45 [2019-10-02 14:42:29,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 14:42:29,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 14:42:29,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=1342, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:42:29,024 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 45 states. [2019-10-02 14:42:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:29,239 INFO L93 Difference]: Finished difference Result 231 states and 268 transitions. [2019-10-02 14:42:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 14:42:29,240 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 240 [2019-10-02 14:42:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:29,241 INFO L225 Difference]: With dead ends: 231 [2019-10-02 14:42:29,241 INFO L226 Difference]: Without dead ends: 153 [2019-10-02 14:42:29,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=1342, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:42:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-02 14:42:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-02 14:42:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 14:42:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2019-10-02 14:42:29,248 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 240 [2019-10-02 14:42:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:29,249 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2019-10-02 14:42:29,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 14:42:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2019-10-02 14:42:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 14:42:29,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:29,251 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 32, 32, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:29,252 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash -175071424, now seen corresponding path program 34 times [2019-10-02 14:42:29,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:29,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:29,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:29,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3869 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2019-10-02 14:42:30,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:30,044 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:30,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:30,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:30,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:42:30,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3869 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2019-10-02 14:42:30,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:30,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:42:30,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:42:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:42:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:42:30,284 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand 36 states. [2019-10-02 14:42:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:30,388 INFO L93 Difference]: Finished difference Result 234 states and 270 transitions. [2019-10-02 14:42:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:42:30,388 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 244 [2019-10-02 14:42:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:30,390 INFO L225 Difference]: With dead ends: 234 [2019-10-02 14:42:30,390 INFO L226 Difference]: Without dead ends: 154 [2019-10-02 14:42:30,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:42:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-02 14:42:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-02 14:42:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-02 14:42:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-10-02 14:42:30,396 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 244 [2019-10-02 14:42:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:30,396 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-10-02 14:42:30,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:42:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-10-02 14:42:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 14:42:30,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:30,398 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:30,398 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash -571087390, now seen corresponding path program 35 times [2019-10-02 14:42:30,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:30,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:30,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3934 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2019-10-02 14:42:31,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:31,255 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:43:19,534 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-02 14:43:19,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:19,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:43:19,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3934 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 2411 trivial. 0 not checked. [2019-10-02 14:43:19,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:19,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 17] total 51 [2019-10-02 14:43:19,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:43:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:43:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:43:19,962 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 51 states. [2019-10-02 14:43:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:20,177 INFO L93 Difference]: Finished difference Result 241 states and 283 transitions. [2019-10-02 14:43:20,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 14:43:20,178 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 246 [2019-10-02 14:43:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:20,180 INFO L225 Difference]: With dead ends: 241 [2019-10-02 14:43:20,181 INFO L226 Difference]: Without dead ends: 161 [2019-10-02 14:43:20,182 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:43:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-02 14:43:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2019-10-02 14:43:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-02 14:43:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2019-10-02 14:43:20,188 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 246 [2019-10-02 14:43:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:20,188 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2019-10-02 14:43:20,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:43:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2019-10-02 14:43:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-02 14:43:20,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:20,192 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 34, 34, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:20,192 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1221863377, now seen corresponding path program 36 times [2019-10-02 14:43:20,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:20,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:20,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4397 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2019-10-02 14:43:21,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:21,159 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:21,210 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:43:30,818 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-02 14:43:30,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:43:30,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4397 backedges. 1420 proven. 121 refuted. 0 times theorem prover too weak. 2856 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:43:31,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:31,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 14] total 49 [2019-10-02 14:43:31,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 14:43:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 14:43:31,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=756, Invalid=1596, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:43:31,110 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand 49 states. [2019-10-02 14:43:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:31,320 INFO L93 Difference]: Finished difference Result 247 states and 286 transitions. [2019-10-02 14:43:31,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 14:43:31,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 257 [2019-10-02 14:43:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:31,321 INFO L225 Difference]: With dead ends: 247 [2019-10-02 14:43:31,321 INFO L226 Difference]: Without dead ends: 164 [2019-10-02 14:43:31,323 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=756, Invalid=1596, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:43:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-02 14:43:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-02 14:43:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-02 14:43:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2019-10-02 14:43:31,329 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 257 [2019-10-02 14:43:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:31,329 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2019-10-02 14:43:31,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 14:43:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2019-10-02 14:43:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 14:43:31,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:31,331 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 35, 35, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:31,331 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:31,332 INFO L82 PathProgramCache]: Analyzing trace with hash 285058545, now seen corresponding path program 37 times [2019-10-02 14:43:31,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:31,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:31,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:31,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:32,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:32,010 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:32,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:32,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:43:32,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:32,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:32,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-02 14:43:32,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 14:43:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 14:43:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:43:32,253 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand 39 states. [2019-10-02 14:43:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:32,390 INFO L93 Difference]: Finished difference Result 250 states and 288 transitions. [2019-10-02 14:43:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:43:32,390 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-10-02 14:43:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:32,392 INFO L225 Difference]: With dead ends: 250 [2019-10-02 14:43:32,392 INFO L226 Difference]: Without dead ends: 165 [2019-10-02 14:43:32,393 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:43:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-02 14:43:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-10-02 14:43:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 14:43:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2019-10-02 14:43:32,399 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 261 [2019-10-02 14:43:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:32,399 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2019-10-02 14:43:32,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 14:43:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2019-10-02 14:43:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 14:43:32,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:32,401 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 36, 36, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:32,402 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1486997617, now seen corresponding path program 38 times [2019-10-02 14:43:32,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:32,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:32,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:33,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:33,088 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:43:33,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:43:33,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:33,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 14:43:33,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:43:33,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:33,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-02 14:43:33,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 14:43:33,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 14:43:33,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:43:33,383 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand 40 states. [2019-10-02 14:43:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:33,519 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2019-10-02 14:43:33,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 14:43:33,520 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 263 [2019-10-02 14:43:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:33,523 INFO L225 Difference]: With dead ends: 252 [2019-10-02 14:43:33,523 INFO L226 Difference]: Without dead ends: 167 [2019-10-02 14:43:33,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:43:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-02 14:43:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-10-02 14:43:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-02 14:43:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 185 transitions. [2019-10-02 14:43:33,529 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 185 transitions. Word has length 263 [2019-10-02 14:43:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:33,529 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 185 transitions. [2019-10-02 14:43:33,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 14:43:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 185 transitions. [2019-10-02 14:43:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 14:43:33,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:33,531 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 37, 37, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:33,532 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash 669047213, now seen corresponding path program 39 times [2019-10-02 14:43:33,532 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:33,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:33,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4633 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:34,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:34,488 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:34,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:43:35,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-02 14:43:35,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:35,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:43:35,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4633 backedges. 1420 proven. 144 refuted. 0 times theorem prover too weak. 3069 trivial. 0 not checked. [2019-10-02 14:43:35,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:35,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 15] total 53 [2019-10-02 14:43:35,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 14:43:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 14:43:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=884, Invalid=1872, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:43:35,599 INFO L87 Difference]: Start difference. First operand 166 states and 185 transitions. Second operand 53 states. [2019-10-02 14:43:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:35,925 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2019-10-02 14:43:35,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 14:43:35,926 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 265 [2019-10-02 14:43:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:35,928 INFO L225 Difference]: With dead ends: 257 [2019-10-02 14:43:35,928 INFO L226 Difference]: Without dead ends: 172 [2019-10-02 14:43:35,930 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=884, Invalid=1872, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:43:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-02 14:43:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-10-02 14:43:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-02 14:43:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 189 transitions. [2019-10-02 14:43:35,939 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 189 transitions. Word has length 265 [2019-10-02 14:43:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:35,940 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 189 transitions. [2019-10-02 14:43:35,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 14:43:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 189 transitions. [2019-10-02 14:43:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 14:43:35,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:35,943 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 38, 38, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:35,943 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2042188493, now seen corresponding path program 40 times [2019-10-02 14:43:35,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:35,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:35,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:35,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4733 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 3289 trivial. 0 not checked. [2019-10-02 14:43:37,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:37,072 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:43:37,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:43:37,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:37,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:43:37,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4733 backedges. 1418 proven. 330 refuted. 0 times theorem prover too weak. 2985 trivial. 0 not checked. [2019-10-02 14:43:37,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:37,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 18] total 57 [2019-10-02 14:43:37,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-02 14:43:37,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-02 14:43:37,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=2220, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 14:43:37,938 INFO L87 Difference]: Start difference. First operand 170 states and 189 transitions. Second operand 57 states. [2019-10-02 14:43:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:38,136 INFO L93 Difference]: Finished difference Result 265 states and 309 transitions. [2019-10-02 14:43:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 14:43:38,137 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 269 [2019-10-02 14:43:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:38,138 INFO L225 Difference]: With dead ends: 265 [2019-10-02 14:43:38,138 INFO L226 Difference]: Without dead ends: 178 [2019-10-02 14:43:38,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=972, Invalid=2220, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 14:43:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-02 14:43:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2019-10-02 14:43:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-02 14:43:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2019-10-02 14:43:38,144 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 269 [2019-10-02 14:43:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:38,144 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2019-10-02 14:43:38,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-02 14:43:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2019-10-02 14:43:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 14:43:38,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:38,146 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 48, 39, 39, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:38,146 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1779941450, now seen corresponding path program 41 times [2019-10-02 14:43:38,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:38,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5233 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 3712 trivial. 0 not checked. [2019-10-02 14:43:39,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:39,124 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:39,184 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:45:28,462 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-10-02 14:45:28,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:28,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:45:28,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5233 backedges. 1604 proven. 376 refuted. 0 times theorem prover too weak. 3253 trivial. 0 not checked. [2019-10-02 14:45:29,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:29,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 19] total 59 [2019-10-02 14:45:29,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 14:45:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 14:45:29,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=2391, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:45:29,035 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand 59 states. [2019-10-02 14:45:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:29,257 INFO L93 Difference]: Finished difference Result 272 states and 318 transitions. [2019-10-02 14:45:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 14:45:29,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 280 [2019-10-02 14:45:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:29,259 INFO L225 Difference]: With dead ends: 272 [2019-10-02 14:45:29,259 INFO L226 Difference]: Without dead ends: 182 [2019-10-02 14:45:29,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1031, Invalid=2391, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:45:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-02 14:45:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-10-02 14:45:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-02 14:45:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2019-10-02 14:45:29,266 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 280 [2019-10-02 14:45:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:29,266 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2019-10-02 14:45:29,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 14:45:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2019-10-02 14:45:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 14:45:29,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:29,268 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 40, 40, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:45:29,268 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2045929961, now seen corresponding path program 42 times [2019-10-02 14:45:29,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:29,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:29,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:29,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5762 backedges. 1810 proven. 425 refuted. 0 times theorem prover too weak. 3527 trivial. 0 not checked. [2019-10-02 14:45:29,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:29,611 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:45:29,683 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:45:36,971 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-02 14:45:36,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:36,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:45:36,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5762 backedges. 1812 proven. 169 refuted. 0 times theorem prover too weak. 3781 trivial. 0 not checked. [2019-10-02 14:45:37,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:37,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2019-10-02 14:45:37,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:45:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:45:37,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:45:37,247 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand 34 states. [2019-10-02 14:45:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:37,385 INFO L93 Difference]: Finished difference Result 280 states and 327 transitions. [2019-10-02 14:45:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:45:37,386 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 291 [2019-10-02 14:45:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:37,388 INFO L225 Difference]: With dead ends: 280 [2019-10-02 14:45:37,388 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 14:45:37,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:45:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 14:45:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2019-10-02 14:45:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-02 14:45:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2019-10-02 14:45:37,395 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 291 [2019-10-02 14:45:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:37,395 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2019-10-02 14:45:37,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:45:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2019-10-02 14:45:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 14:45:37,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:37,397 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 54, 40, 40, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:45:37,397 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1795287478, now seen corresponding path program 43 times [2019-10-02 14:45:37,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:37,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6266 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 3765 trivial. 0 not checked. [2019-10-02 14:45:37,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:37,866 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:45:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:45:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:38,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:45:38,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6266 backedges. 2020 proven. 477 refuted. 0 times theorem prover too weak. 3769 trivial. 0 not checked. [2019-10-02 14:45:38,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:38,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-02 14:45:38,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 14:45:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 14:45:38,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:45:38,133 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 22 states. [2019-10-02 14:45:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:38,207 INFO L93 Difference]: Finished difference Result 287 states and 335 transitions. [2019-10-02 14:45:38,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:45:38,209 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 302 [2019-10-02 14:45:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:38,210 INFO L225 Difference]: With dead ends: 287 [2019-10-02 14:45:38,210 INFO L226 Difference]: Without dead ends: 190 [2019-10-02 14:45:38,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:45:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-02 14:45:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-10-02 14:45:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-02 14:45:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2019-10-02 14:45:38,216 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 302 [2019-10-02 14:45:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:38,217 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2019-10-02 14:45:38,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 14:45:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2019-10-02 14:45:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 14:45:38,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:38,219 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 40, 40, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:45:38,219 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash -499593909, now seen corresponding path program 44 times [2019-10-02 14:45:38,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:38,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:45:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6770 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 6574 trivial. 0 not checked. [2019-10-02 14:45:38,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:38,607 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:45:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:45:38,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:45:38,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:38,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:45:38,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6770 backedges. 2246 proven. 532 refuted. 0 times theorem prover too weak. 3992 trivial. 0 not checked. [2019-10-02 14:45:39,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:39,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2019-10-02 14:45:39,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 14:45:39,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 14:45:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:45:39,138 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand 37 states. [2019-10-02 14:45:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:39,268 INFO L93 Difference]: Finished difference Result 296 states and 347 transitions. [2019-10-02 14:45:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 14:45:39,268 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 311 [2019-10-02 14:45:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:39,270 INFO L225 Difference]: With dead ends: 296 [2019-10-02 14:45:39,270 INFO L226 Difference]: Without dead ends: 196 [2019-10-02 14:45:39,271 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:45:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-02 14:45:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2019-10-02 14:45:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-02 14:45:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2019-10-02 14:45:39,276 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 311 [2019-10-02 14:45:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:39,277 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2019-10-02 14:45:39,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 14:45:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2019-10-02 14:45:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 14:45:39,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:39,279 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 40, 40, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:45:39,279 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2108310056, now seen corresponding path program 45 times [2019-10-02 14:45:39,279 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:39,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:39,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7330 backedges. 0 proven. 3078 refuted. 0 times theorem prover too weak. 4252 trivial. 0 not checked. [2019-10-02 14:45:39,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:39,904 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:45:39,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:45:43,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-02 14:45:43,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:43,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:45:43,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7330 backedges. 2490 proven. 225 refuted. 0 times theorem prover too weak. 4615 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:45:44,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:44,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 40 [2019-10-02 14:45:44,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 14:45:44,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 14:45:44,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1137, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:45:44,512 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand 40 states. [2019-10-02 14:45:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:44,769 INFO L93 Difference]: Finished difference Result 306 states and 359 transitions. [2019-10-02 14:45:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:45:44,770 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 322 [2019-10-02 14:45:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:44,772 INFO L225 Difference]: With dead ends: 306 [2019-10-02 14:45:44,772 INFO L226 Difference]: Without dead ends: 201 [2019-10-02 14:45:44,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=423, Invalid=1137, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:45:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-02 14:45:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2019-10-02 14:45:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-02 14:45:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2019-10-02 14:45:44,779 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 322 [2019-10-02 14:45:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:44,780 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2019-10-02 14:45:44,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 14:45:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2019-10-02 14:45:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 14:45:44,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:44,782 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 63, 40, 40, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:45:44,782 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -123654481, now seen corresponding path program 46 times [2019-10-02 14:45:44,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:44,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:44,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7919 backedges. 2738 proven. 651 refuted. 0 times theorem prover too weak. 4530 trivial. 0 not checked. [2019-10-02 14:45:45,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:45,317 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:45:45,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:45:45,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:45:45,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:45,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:45:45,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7919 backedges. 2734 proven. 651 refuted. 0 times theorem prover too weak. 4534 trivial. 0 not checked. [2019-10-02 14:45:45,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:45,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-02 14:45:45,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:45:45,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:45:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:45:45,615 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand 25 states. [2019-10-02 14:45:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:45,699 INFO L93 Difference]: Finished difference Result 313 states and 367 transitions. [2019-10-02 14:45:45,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:45:45,700 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 333 [2019-10-02 14:45:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:45,701 INFO L225 Difference]: With dead ends: 313 [2019-10-02 14:45:45,701 INFO L226 Difference]: Without dead ends: 203 [2019-10-02 14:45:45,702 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:45:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-02 14:45:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-10-02 14:45:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-02 14:45:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2019-10-02 14:45:45,708 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 333 [2019-10-02 14:45:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:45,708 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2019-10-02 14:45:45,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:45:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2019-10-02 14:45:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 14:45:45,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:45,710 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 66, 40, 40, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:45:45,711 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1528545670, now seen corresponding path program 47 times [2019-10-02 14:45:45,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:45,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8504 backedges. 0 proven. 3715 refuted. 0 times theorem prover too weak. 4789 trivial. 0 not checked. [2019-10-02 14:45:46,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:46,308 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:45:46,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:47:34,039 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-10-02 14:47:34,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:34,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:47:34,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8504 backedges. 2996 proven. 715 refuted. 0 times theorem prover too weak. 4793 trivial. 0 not checked. [2019-10-02 14:47:34,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:34,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 14:47:34,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:47:34,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:47:34,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:47:34,169 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand 26 states. [2019-10-02 14:47:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:34,250 INFO L93 Difference]: Finished difference Result 319 states and 375 transitions. [2019-10-02 14:47:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:47:34,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 342 [2019-10-02 14:47:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:34,259 INFO L225 Difference]: With dead ends: 319 [2019-10-02 14:47:34,259 INFO L226 Difference]: Without dead ends: 206 [2019-10-02 14:47:34,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:47:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-02 14:47:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-10-02 14:47:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-02 14:47:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 231 transitions. [2019-10-02 14:47:34,265 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 231 transitions. Word has length 342 [2019-10-02 14:47:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:34,266 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 231 transitions. [2019-10-02 14:47:34,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:47:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions. [2019-10-02 14:47:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 14:47:34,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:34,268 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 69, 40, 40, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:34,268 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2073319025, now seen corresponding path program 48 times [2019-10-02 14:47:34,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:34,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:34,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:34,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9116 backedges. 0 proven. 4056 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2019-10-02 14:47:34,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:34,857 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:34,924 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:47:41,502 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-02 14:47:41,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:41,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:47:41,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9116 backedges. 3355 proven. 256 refuted. 0 times theorem prover too weak. 5505 trivial. 0 not checked. [2019-10-02 14:47:41,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:41,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 45 [2019-10-02 14:47:41,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 14:47:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 14:47:41,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1480, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:47:41,900 INFO L87 Difference]: Start difference. First operand 204 states and 231 transitions. Second operand 45 states. [2019-10-02 14:47:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:42,587 INFO L93 Difference]: Finished difference Result 328 states and 387 transitions. [2019-10-02 14:47:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 14:47:42,587 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 351 [2019-10-02 14:47:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:42,589 INFO L225 Difference]: With dead ends: 328 [2019-10-02 14:47:42,589 INFO L226 Difference]: Without dead ends: 212 [2019-10-02 14:47:42,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=840, Invalid=2942, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 14:47:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-02 14:47:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2019-10-02 14:47:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-02 14:47:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 237 transitions. [2019-10-02 14:47:42,599 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 237 transitions. Word has length 351 [2019-10-02 14:47:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:42,600 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 237 transitions. [2019-10-02 14:47:42,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 14:47:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2019-10-02 14:47:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 14:47:42,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:42,602 INFO L411 BasicCegarLoop]: trace histogram [72, 72, 72, 40, 40, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:42,603 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:42,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1780747164, now seen corresponding path program 49 times [2019-10-02 14:47:42,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:42,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:42,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:42,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:42,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9788 backedges. 3560 proven. 852 refuted. 0 times theorem prover too weak. 5376 trivial. 0 not checked. [2019-10-02 14:47:43,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:43,183 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:43,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:47:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:43,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:47:43,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9788 backedges. 3556 proven. 852 refuted. 0 times theorem prover too weak. 5380 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:47:43,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:43,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-02 14:47:43,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:47:43,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:47:43,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:47:43,499 INFO L87 Difference]: Start difference. First operand 209 states and 237 transitions. Second operand 28 states. [2019-10-02 14:47:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:43,585 INFO L93 Difference]: Finished difference Result 335 states and 395 transitions. [2019-10-02 14:47:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:47:43,586 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 362 [2019-10-02 14:47:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:43,588 INFO L225 Difference]: With dead ends: 335 [2019-10-02 14:47:43,588 INFO L226 Difference]: Without dead ends: 214 [2019-10-02 14:47:43,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 362 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-10-02 14:47:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-02 14:47:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-02 14:47:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-02 14:47:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 241 transitions. [2019-10-02 14:47:43,597 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 241 transitions. Word has length 362 [2019-10-02 14:47:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:43,597 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 241 transitions. [2019-10-02 14:47:43,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:47:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 241 transitions. [2019-10-02 14:47:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-02 14:47:43,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:43,599 INFO L411 BasicCegarLoop]: trace histogram [75, 75, 75, 40, 40, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:43,600 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:43,600 INFO L82 PathProgramCache]: Analyzing trace with hash 181756529, now seen corresponding path program 50 times [2019-10-02 14:47:43,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:43,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:43,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:43,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:47:43,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10454 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 10165 trivial. 0 not checked. [2019-10-02 14:47:44,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:44,251 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:44,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:47:44,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:47:44,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:44,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:47:44,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10454 backedges. 3854 proven. 925 refuted. 0 times theorem prover too weak. 5675 trivial. 0 not checked. [2019-10-02 14:47:45,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:45,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28] total 46 [2019-10-02 14:47:45,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 14:47:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 14:47:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1503, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:47:45,087 INFO L87 Difference]: Start difference. First operand 212 states and 241 transitions. Second operand 46 states. [2019-10-02 14:47:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:45,251 INFO L93 Difference]: Finished difference Result 344 states and 407 transitions. [2019-10-02 14:47:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 14:47:45,252 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 371 [2019-10-02 14:47:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:45,253 INFO L225 Difference]: With dead ends: 344 [2019-10-02 14:47:45,253 INFO L226 Difference]: Without dead ends: 220 [2019-10-02 14:47:45,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=567, Invalid=1503, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:47:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-02 14:47:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-10-02 14:47:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-02 14:47:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 247 transitions. [2019-10-02 14:47:45,260 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 247 transitions. Word has length 371 [2019-10-02 14:47:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:45,261 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 247 transitions. [2019-10-02 14:47:45,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 14:47:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 247 transitions. [2019-10-02 14:47:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-02 14:47:45,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:45,263 INFO L411 BasicCegarLoop]: trace histogram [78, 78, 78, 40, 40, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:45,264 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash -68404542, now seen corresponding path program 51 times [2019-10-02 14:47:45,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:45,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:45,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:45,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:45,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11182 backedges. 4168 proven. 1001 refuted. 0 times theorem prover too weak. 6013 trivial. 0 not checked. [2019-10-02 14:47:45,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:45,816 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:45,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:47:51,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-10-02 14:47:51,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:51,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 14:47:51,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11182 backedges. 4170 proven. 324 refuted. 0 times theorem prover too weak. 6688 trivial. 0 not checked. [2019-10-02 14:47:52,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:52,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 48 [2019-10-02 14:47:52,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 14:47:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 14:47:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1641, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:47:52,007 INFO L87 Difference]: Start difference. First operand 217 states and 247 transitions. Second operand 48 states. [2019-10-02 14:47:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:52,151 INFO L93 Difference]: Finished difference Result 354 states and 419 transitions. [2019-10-02 14:47:52,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 14:47:52,151 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 382 [2019-10-02 14:47:52,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:52,153 INFO L225 Difference]: With dead ends: 354 [2019-10-02 14:47:52,153 INFO L226 Difference]: Without dead ends: 225 [2019-10-02 14:47:52,155 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=615, Invalid=1641, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:47:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-02 14:47:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-10-02 14:47:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-10-02 14:47:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 253 transitions. [2019-10-02 14:47:52,161 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 253 transitions. Word has length 382 [2019-10-02 14:47:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:52,162 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 253 transitions. [2019-10-02 14:47:52,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 14:47:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 253 transitions. [2019-10-02 14:47:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-02 14:47:52,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:52,164 INFO L411 BasicCegarLoop]: trace histogram [81, 81, 81, 40, 40, 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-10-02 14:47:52,165 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash 421483349, now seen corresponding path program 52 times [2019-10-02 14:47:52,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:52,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:52,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:52,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:52,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11939 backedges. 0 proven. 5570 refuted. 0 times theorem prover too weak. 6369 trivial. 0 not checked. [2019-10-02 14:47:52,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:52,913 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:52,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:47:53,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:47:53,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:53,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 14:47:53,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11939 backedges. 4486 proven. 1080 refuted. 0 times theorem prover too weak. 6373 trivial. 0 not checked. [2019-10-02 14:47:53,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:53,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-02 14:47:53,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:47:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:47:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:47:53,268 INFO L87 Difference]: Start difference. First operand 222 states and 253 transitions. Second operand 31 states. [2019-10-02 14:47:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:53,360 INFO L93 Difference]: Finished difference Result 361 states and 427 transitions. [2019-10-02 14:47:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:47:53,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 393 [2019-10-02 14:47:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:53,362 INFO L225 Difference]: With dead ends: 361 [2019-10-02 14:47:53,362 INFO L226 Difference]: Without dead ends: 227 [2019-10-02 14:47:53,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:47:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-02 14:47:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2019-10-02 14:47:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-02 14:47:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 257 transitions. [2019-10-02 14:47:53,369 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 257 transitions. Word has length 393 [2019-10-02 14:47:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:53,370 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 257 transitions. [2019-10-02 14:47:53,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:47:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 257 transitions. [2019-10-02 14:47:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-10-02 14:47:53,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:53,372 INFO L411 BasicCegarLoop]: trace histogram [84, 84, 84, 40, 40, 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-10-02 14:47:53,372 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash -960105312, now seen corresponding path program 53 times [2019-10-02 14:47:53,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:53,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:53,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12686 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 12325 trivial. 0 not checked. [2019-10-02 14:47:53,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:53,932 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:54,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:50:22,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-10-02 14:50:22,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:22,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 14:50:22,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12686 backedges. 4820 proven. 1162 refuted. 0 times theorem prover too weak. 6704 trivial. 0 not checked. [2019-10-02 14:50:23,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:23,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31] total 51 [2019-10-02 14:50:23,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:50:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:50:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1855, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:50:23,419 INFO L87 Difference]: Start difference. First operand 225 states and 257 transitions. Second operand 51 states. [2019-10-02 14:50:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:23,615 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2019-10-02 14:50:23,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 14:50:23,617 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 402 [2019-10-02 14:50:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:23,619 INFO L225 Difference]: With dead ends: 370 [2019-10-02 14:50:23,619 INFO L226 Difference]: Without dead ends: 233 [2019-10-02 14:50:23,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=695, Invalid=1855, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:50:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-02 14:50:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2019-10-02 14:50:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-02 14:50:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 263 transitions. [2019-10-02 14:50:23,627 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 263 transitions. Word has length 402 [2019-10-02 14:50:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:23,627 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 263 transitions. [2019-10-02 14:50:23,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:50:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 263 transitions. [2019-10-02 14:50:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-10-02 14:50:23,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:23,630 INFO L411 BasicCegarLoop]: trace histogram [87, 87, 87, 40, 40, 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-10-02 14:50:23,630 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:23,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1923515191, now seen corresponding path program 54 times [2019-10-02 14:50:23,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:23,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:23,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13499 backedges. 2585 proven. 3832 refuted. 0 times theorem prover too weak. 7082 trivial. 0 not checked. [2019-10-02 14:50:24,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:24,324 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:50:24,402 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:50:32,992 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-02 14:50:32,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:33,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 14:50:33,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13499 backedges. 5172 proven. 400 refuted. 0 times theorem prover too weak. 7927 trivial. 0 not checked. [2019-10-02 14:50:33,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:33,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 23] total 53 [2019-10-02 14:50:33,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 14:50:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 14:50:33,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=2008, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:50:33,492 INFO L87 Difference]: Start difference. First operand 230 states and 263 transitions. Second operand 53 states. [2019-10-02 14:50:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:33,709 INFO L93 Difference]: Finished difference Result 380 states and 451 transitions. [2019-10-02 14:50:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 14:50:33,710 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 413 [2019-10-02 14:50:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:33,712 INFO L225 Difference]: With dead ends: 380 [2019-10-02 14:50:33,712 INFO L226 Difference]: Without dead ends: 238 [2019-10-02 14:50:33,713 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=748, Invalid=2008, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:50:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-02 14:50:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2019-10-02 14:50:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-02 14:50:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 269 transitions. [2019-10-02 14:50:33,720 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 269 transitions. Word has length 413 [2019-10-02 14:50:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:33,720 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 269 transitions. [2019-10-02 14:50:33,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 14:50:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 269 transitions. [2019-10-02 14:50:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-10-02 14:50:33,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:33,723 INFO L411 BasicCegarLoop]: trace histogram [90, 90, 90, 40, 40, 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-10-02 14:50:33,723 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:33,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:33,723 INFO L82 PathProgramCache]: Analyzing trace with hash -848114372, now seen corresponding path program 55 times [2019-10-02 14:50:33,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:33,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14341 backedges. 2764 proven. 4099 refuted. 0 times theorem prover too weak. 7478 trivial. 0 not checked. [2019-10-02 14:50:34,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:34,578 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:50:34,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:34,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:50:34,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14341 backedges. 5524 proven. 1335 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2019-10-02 14:50:34,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:34,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-02 14:50:34,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:50:34,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:50:34,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:50:34,952 INFO L87 Difference]: Start difference. First operand 235 states and 269 transitions. Second operand 34 states. [2019-10-02 14:50:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:35,097 INFO L93 Difference]: Finished difference Result 387 states and 459 transitions. [2019-10-02 14:50:35,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 14:50:35,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 424 [2019-10-02 14:50:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:35,099 INFO L225 Difference]: With dead ends: 387 [2019-10-02 14:50:35,099 INFO L226 Difference]: Without dead ends: 240 [2019-10-02 14:50:35,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:50:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-02 14:50:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2019-10-02 14:50:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-02 14:50:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 273 transitions. [2019-10-02 14:50:35,107 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 273 transitions. Word has length 424 [2019-10-02 14:50:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:35,107 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 273 transitions. [2019-10-02 14:50:35,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:50:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 273 transitions. [2019-10-02 14:50:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-10-02 14:50:35,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:35,110 INFO L411 BasicCegarLoop]: trace histogram [93, 93, 93, 40, 40, 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-10-02 14:50:35,110 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:35,110 INFO L82 PathProgramCache]: Analyzing trace with hash -594063463, now seen corresponding path program 56 times [2019-10-02 14:50:35,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:35,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:35,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15169 backedges. 5898 proven. 1426 refuted. 0 times theorem prover too weak. 7845 trivial. 0 not checked. [2019-10-02 14:50:35,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:35,870 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:50:35,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:50:36,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:50:36,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:36,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:50:36,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15169 backedges. 5894 proven. 1426 refuted. 0 times theorem prover too weak. 7849 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:50:36,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:36,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-02 14:50:36,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 14:50:36,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 14:50:36,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:50:36,343 INFO L87 Difference]: Start difference. First operand 238 states and 273 transitions. Second operand 35 states. [2019-10-02 14:50:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:36,451 INFO L93 Difference]: Finished difference Result 393 states and 467 transitions. [2019-10-02 14:50:36,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:50:36,451 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 433 [2019-10-02 14:50:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:36,452 INFO L225 Difference]: With dead ends: 393 [2019-10-02 14:50:36,452 INFO L226 Difference]: Without dead ends: 243 [2019-10-02 14:50:36,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:50:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-02 14:50:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-10-02 14:50:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-02 14:50:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 277 transitions. [2019-10-02 14:50:36,460 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 277 transitions. Word has length 433 [2019-10-02 14:50:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:36,460 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 277 transitions. [2019-10-02 14:50:36,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 14:50:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 277 transitions. [2019-10-02 14:50:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-10-02 14:50:36,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:36,463 INFO L411 BasicCegarLoop]: trace histogram [96, 96, 96, 40, 40, 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-10-02 14:50:36,463 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash 773014236, now seen corresponding path program 57 times [2019-10-02 14:50:36,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:36,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:36,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:36,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16024 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 15583 trivial. 0 not checked. [2019-10-02 14:50:37,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:37,085 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:50:37,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:50:46,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-10-02 14:50:46,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:46,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:50:46,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16024 backedges. 6282 proven. 441 refuted. 0 times theorem prover too weak. 9301 trivial. 0 not checked. [2019-10-02 14:50:46,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:46,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-02 14:50:46,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:50:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:50:46,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:50:46,704 INFO L87 Difference]: Start difference. First operand 241 states and 277 transitions. Second operand 25 states. [2019-10-02 14:50:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:46,771 INFO L93 Difference]: Finished difference Result 351 states and 420 transitions. [2019-10-02 14:50:46,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:50:46,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 442 [2019-10-02 14:50:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:46,774 INFO L225 Difference]: With dead ends: 351 [2019-10-02 14:50:46,774 INFO L226 Difference]: Without dead ends: 244 [2019-10-02 14:50:46,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:50:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-02 14:50:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2019-10-02 14:50:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-02 14:50:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 279 transitions. [2019-10-02 14:50:46,782 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 279 transitions. Word has length 442 [2019-10-02 14:50:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:46,782 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 279 transitions. [2019-10-02 14:50:46,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:50:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2019-10-02 14:50:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-10-02 14:50:46,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:46,786 INFO L411 BasicCegarLoop]: trace histogram [96, 96, 96, 40, 40, 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-10-02 14:50:46,786 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1651249178, now seen corresponding path program 58 times [2019-10-02 14:50:46,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:46,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:46,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16067 backedges. 3140 proven. 4660 refuted. 0 times theorem prover too weak. 8267 trivial. 0 not checked. [2019-10-02 14:50:47,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:47,714 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:50:47,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:50:48,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:50:48,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:48,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:50:48,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16067 backedges. 6276 proven. 1520 refuted. 0 times theorem prover too weak. 8271 trivial. 0 not checked. [2019-10-02 14:50:48,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:48,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:50:48,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:50:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:50:48,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:50:48,169 INFO L87 Difference]: Start difference. First operand 243 states and 279 transitions. Second operand 36 states. [2019-10-02 14:50:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:48,261 INFO L93 Difference]: Finished difference Result 403 states and 479 transitions. [2019-10-02 14:50:48,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:50:48,266 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 444 [2019-10-02 14:50:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:48,268 INFO L225 Difference]: With dead ends: 403 [2019-10-02 14:50:48,268 INFO L226 Difference]: Without dead ends: 248 [2019-10-02 14:50:48,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:50:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-02 14:50:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2019-10-02 14:50:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-02 14:50:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 283 transitions. [2019-10-02 14:50:48,275 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 283 transitions. Word has length 444 [2019-10-02 14:50:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:48,275 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 283 transitions. [2019-10-02 14:50:48,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:50:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 283 transitions. [2019-10-02 14:50:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-02 14:50:48,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:48,279 INFO L411 BasicCegarLoop]: trace histogram [99, 99, 99, 40, 40, 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-10-02 14:50:48,279 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1209292923, now seen corresponding path program 59 times [2019-10-02 14:50:48,279 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:48,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:48,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:48,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:48,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16949 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 16465 trivial. 0 not checked. [2019-10-02 14:50:48,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:48,762 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:50:48,852 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:53:59,161 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2019-10-02 14:53:59,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:53:59,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 14:53:59,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16949 backedges. 6670 proven. 1617 refuted. 0 times theorem prover too weak. 8662 trivial. 0 not checked. [2019-10-02 14:54:00,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:00,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 36] total 59 [2019-10-02 14:54:00,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 14:54:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 14:54:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:54:00,030 INFO L87 Difference]: Start difference. First operand 246 states and 283 transitions. Second operand 59 states. [2019-10-02 14:54:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:00,239 INFO L93 Difference]: Finished difference Result 412 states and 491 transitions. [2019-10-02 14:54:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 14:54:00,240 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 453 [2019-10-02 14:54:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:00,242 INFO L225 Difference]: With dead ends: 412 [2019-10-02 14:54:00,242 INFO L226 Difference]: Without dead ends: 254 [2019-10-02 14:54:00,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:54:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-02 14:54:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-10-02 14:54:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-02 14:54:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 289 transitions. [2019-10-02 14:54:00,250 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 289 transitions. Word has length 453 [2019-10-02 14:54:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:00,250 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 289 transitions. [2019-10-02 14:54:00,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 14:54:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 289 transitions. [2019-10-02 14:54:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-10-02 14:54:00,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:00,254 INFO L411 BasicCegarLoop]: trace histogram [102, 102, 102, 40, 40, 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-10-02 14:54:00,254 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1061362056, now seen corresponding path program 60 times [2019-10-02 14:54:00,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:00,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:00,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:54:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17903 backedges. 7080 proven. 1717 refuted. 0 times theorem prover too weak. 9106 trivial. 0 not checked. [2019-10-02 14:54:01,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:01,061 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:01,153 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:54:17,308 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-10-02 14:54:17,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:54:17,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:54:17,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 17903 backedges. 7082 proven. 529 refuted. 0 times theorem prover too weak. 10292 trivial. 0 not checked. [2019-10-02 14:54:17,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:17,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 26] total 61 [2019-10-02 14:54:17,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-02 14:54:17,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-02 14:54:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=2670, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 14:54:17,959 INFO L87 Difference]: Start difference. First operand 251 states and 289 transitions. Second operand 61 states. [2019-10-02 14:54:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:18,204 INFO L93 Difference]: Finished difference Result 422 states and 503 transitions. [2019-10-02 14:54:18,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 14:54:18,205 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 464 [2019-10-02 14:54:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:18,207 INFO L225 Difference]: With dead ends: 422 [2019-10-02 14:54:18,207 INFO L226 Difference]: Without dead ends: 259 [2019-10-02 14:54:18,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=2670, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 14:54:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-02 14:54:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-10-02 14:54:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-02 14:54:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2019-10-02 14:54:18,215 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 464 [2019-10-02 14:54:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:18,215 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2019-10-02 14:54:18,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-02 14:54:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2019-10-02 14:54:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-10-02 14:54:18,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:18,219 INFO L411 BasicCegarLoop]: trace histogram [105, 105, 105, 40, 40, 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-10-02 14:54:18,219 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2086160161, now seen corresponding path program 61 times [2019-10-02 14:54:18,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:18,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:18,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:54:18,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18886 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 18310 trivial. 0 not checked. [2019-10-02 14:54:18,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:18,979 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:19,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:54:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:19,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1402 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:54:19,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18886 backedges. 7494 proven. 1820 refuted. 0 times theorem prover too weak. 9572 trivial. 0 not checked. [2019-10-02 14:54:20,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:20,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 38] total 63 [2019-10-02 14:54:20,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-02 14:54:20,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-02 14:54:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1053, Invalid=2853, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 14:54:20,243 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand 63 states. [2019-10-02 14:54:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:20,474 INFO L93 Difference]: Finished difference Result 432 states and 515 transitions. [2019-10-02 14:54:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 14:54:20,475 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 475 [2019-10-02 14:54:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:20,477 INFO L225 Difference]: With dead ends: 432 [2019-10-02 14:54:20,477 INFO L226 Difference]: Without dead ends: 264 [2019-10-02 14:54:20,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1053, Invalid=2853, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 14:54:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-02 14:54:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-10-02 14:54:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-02 14:54:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2019-10-02 14:54:20,486 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 475 [2019-10-02 14:54:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:20,486 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2019-10-02 14:54:20,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-02 14:54:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2019-10-02 14:54:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-10-02 14:54:20,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:20,490 INFO L411 BasicCegarLoop]: trace histogram [108, 108, 108, 40, 40, 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-10-02 14:54:20,490 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 736045588, now seen corresponding path program 62 times [2019-10-02 14:54:20,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:20,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:54:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 19898 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 19273 trivial. 0 not checked. [2019-10-02 14:54:21,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:21,237 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:21,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:54:21,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:54:21,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:54:21,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 14:54:21,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 19898 backedges. 7924 proven. 1926 refuted. 0 times theorem prover too weak. 10048 trivial. 0 not checked. [2019-10-02 14:54:22,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 39] total 65 [2019-10-02 14:54:22,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-02 14:54:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-02 14:54:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1118, Invalid=3042, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 14:54:22,527 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand 65 states. [2019-10-02 14:54:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:22,808 INFO L93 Difference]: Finished difference Result 442 states and 527 transitions. [2019-10-02 14:54:22,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-02 14:54:22,809 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 486 [2019-10-02 14:54:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:22,810 INFO L225 Difference]: With dead ends: 442 [2019-10-02 14:54:22,811 INFO L226 Difference]: Without dead ends: 269 [2019-10-02 14:54:22,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1118, Invalid=3042, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 14:54:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-02 14:54:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-10-02 14:54:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-02 14:54:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 307 transitions. [2019-10-02 14:54:22,817 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 307 transitions. Word has length 486 [2019-10-02 14:54:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:22,817 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 307 transitions. [2019-10-02 14:54:22,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-02 14:54:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 307 transitions. [2019-10-02 14:54:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-10-02 14:54:22,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:22,820 INFO L411 BasicCegarLoop]: trace histogram [111, 111, 111, 40, 40, 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-10-02 14:54:22,820 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash -749758141, now seen corresponding path program 63 times [2019-10-02 14:54:22,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:22,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:22,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:54:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20939 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 20263 trivial. 0 not checked. [2019-10-02 14:54:23,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:23,398 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:23,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:54:39,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-02 14:54:39,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:54:39,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:54:39,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20939 backedges. 8372 proven. 676 refuted. 0 times theorem prover too weak. 11891 trivial. 0 not checked. [2019-10-02 14:54:39,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:39,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 14:54:39,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:54:39,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:54:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:54:39,723 INFO L87 Difference]: Start difference. First operand 266 states and 307 transitions. Second operand 30 states. [2019-10-02 14:54:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:39,814 INFO L93 Difference]: Finished difference Result 391 states and 470 transitions. [2019-10-02 14:54:39,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 14:54:39,814 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 497 [2019-10-02 14:54:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:39,816 INFO L225 Difference]: With dead ends: 391 [2019-10-02 14:54:39,816 INFO L226 Difference]: Without dead ends: 269 [2019-10-02 14:54:39,816 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:54:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-02 14:54:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-10-02 14:54:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-02 14:54:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 309 transitions. [2019-10-02 14:54:39,822 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 309 transitions. Word has length 497 [2019-10-02 14:54:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:39,822 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 309 transitions. [2019-10-02 14:54:39,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:54:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 309 transitions. [2019-10-02 14:54:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-10-02 14:54:39,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:39,826 INFO L411 BasicCegarLoop]: trace histogram [111, 111, 111, 40, 40, 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-10-02 14:54:39,826 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash 570253637, now seen corresponding path program 64 times [2019-10-02 14:54:39,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:39,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:39,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:54:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20992 backedges. 8370 proven. 2035 refuted. 0 times theorem prover too weak. 10587 trivial. 0 not checked. [2019-10-02 14:54:40,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:40,716 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:54:41,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:54:41,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:54:41,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 14:54:41,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20992 backedges. 8366 proven. 2035 refuted. 0 times theorem prover too weak. 10591 trivial. 0 not checked. [2019-10-02 14:54:41,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:41,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-02 14:54:41,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:54:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:54:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:54:41,253 INFO L87 Difference]: Start difference. First operand 268 states and 309 transitions. Second operand 41 states. [2019-10-02 14:54:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:41,375 INFO L93 Difference]: Finished difference Result 453 states and 539 transitions. [2019-10-02 14:54:41,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:54:41,376 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 499 [2019-10-02 14:54:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:41,377 INFO L225 Difference]: With dead ends: 453 [2019-10-02 14:54:41,377 INFO L226 Difference]: Without dead ends: 273 [2019-10-02 14:54:41,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:54:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-02 14:54:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-10-02 14:54:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-02 14:54:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 313 transitions. [2019-10-02 14:54:41,385 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 313 transitions. Word has length 499 [2019-10-02 14:54:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:41,386 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 313 transitions. [2019-10-02 14:54:41,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:54:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 313 transitions. [2019-10-02 14:54:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-10-02 14:54:41,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:41,389 INFO L411 BasicCegarLoop]: trace histogram [114, 114, 114, 40, 40, 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-10-02 14:54:41,390 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1477430704, now seen corresponding path program 65 times [2019-10-02 14:54:41,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:41,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:41,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:54:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 22009 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 21280 trivial. 0 not checked. [2019-10-02 14:54:42,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:42,082 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:42,183 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1