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/loop-acceleration/array_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:08:59,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:08:59,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:08:59,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:08:59,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:08:59,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:08:59,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:08:59,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:08:59,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:08:59,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:08:59,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:08:59,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:08:59,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:08:59,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:08:59,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:08:59,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:08:59,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:08:59,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:08:59,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:08:59,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:08:59,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:08:59,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:08:59,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:08:59,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:08:59,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:08:59,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:08:59,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:08:59,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:08:59,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:08:59,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:08:59,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:08:59,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:08:59,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:08:59,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:08:59,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:08:59,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:08:59,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:08:59,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:08:59,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:08:59,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:08:59,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:08:59,184 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 11:08:59,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:08:59,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:08:59,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:08:59,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:08:59,223 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:08:59,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:08:59,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:08:59,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:08:59,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:08:59,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:08:59,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:08:59,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:08:59,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:08:59,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:08:59,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:08:59,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:08:59,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:08:59,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:08:59,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:08:59,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:08:59,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:08:59,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:08:59,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:08:59,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:08:59,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:08:59,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:08:59,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:08:59,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:08:59,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:08:59,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:08:59,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:08:59,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:08:59,294 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:08:59,295 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:08:59,295 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-2.i [2019-10-02 11:08:59,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce94c966/a206f19e65814ed5b0d5a4123dd8360f/FLAG3cda68f3c [2019-10-02 11:08:59,788 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:08:59,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2.i [2019-10-02 11:08:59,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce94c966/a206f19e65814ed5b0d5a4123dd8360f/FLAG3cda68f3c [2019-10-02 11:09:00,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce94c966/a206f19e65814ed5b0d5a4123dd8360f [2019-10-02 11:09:00,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:09:00,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:09:00,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:09:00,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:09:00,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:09:00,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52af6b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00, skipping insertion in model container [2019-10-02 11:09:00,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,227 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:09:00,243 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:09:00,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:09:00,475 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:09:00,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:09:00,509 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:09:00,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00 WrapperNode [2019-10-02 11:09:00,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:09:00,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:09:00,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:09:00,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:09:00,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (1/1) ... [2019-10-02 11:09:00,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:09:00,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:09:00,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:09:00,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:09:00,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (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 11:09:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:09:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:09:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:09:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:09:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:09:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:09:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:09:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:09:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:09:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:09:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:09:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:09:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:09:00,917 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:09:00,918 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:09:00,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:09:00 BoogieIcfgContainer [2019-10-02 11:09:00,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:09:00,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:09:00,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:09:00,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:09:00,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:09:00" (1/3) ... [2019-10-02 11:09:00,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdee4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:09:00, skipping insertion in model container [2019-10-02 11:09:00,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:09:00" (2/3) ... [2019-10-02 11:09:00,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdee4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:09:00, skipping insertion in model container [2019-10-02 11:09:00,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:09:00" (3/3) ... [2019-10-02 11:09:00,935 INFO L109 eAbstractionObserver]: Analyzing ICFG array_2-2.i [2019-10-02 11:09:00,947 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:09:00,958 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:09:00,998 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:09:01,037 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:09:01,038 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:09:01,038 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:09:01,038 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:09:01,038 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:09:01,038 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:09:01,039 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:09:01,039 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:09:01,039 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:09:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-02 11:09:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:09:01,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:01,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:01,067 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:01,073 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2019-10-02 11:09:01,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:01,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:01,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:01,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:09:01,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:09:01,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:09:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:09:01,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:09:01,232 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-02 11:09:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:01,251 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-10-02 11:09:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:09:01,253 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-02 11:09:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:01,260 INFO L225 Difference]: With dead ends: 34 [2019-10-02 11:09:01,261 INFO L226 Difference]: Without dead ends: 14 [2019-10-02 11:09:01,264 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 11:09:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-02 11:09:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-02 11:09:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-02 11:09:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-10-02 11:09:01,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-10-02 11:09:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:01,305 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-10-02 11:09:01,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:09:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-10-02 11:09:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:09:01,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:01,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:01,306 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2019-10-02 11:09:01,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:01,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:09:01,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:09:01,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:09:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:09:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:09:01,365 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2019-10-02 11:09:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:01,385 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-10-02 11:09:01,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:09:01,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-02 11:09:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:01,386 INFO L225 Difference]: With dead ends: 22 [2019-10-02 11:09:01,386 INFO L226 Difference]: Without dead ends: 16 [2019-10-02 11:09:01,387 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 11:09:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-02 11:09:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-02 11:09:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-02 11:09:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-02 11:09:01,392 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-10-02 11:09:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:01,393 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-02 11:09:01,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:09:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-02 11:09:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:09:01,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:01,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:01,394 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2019-10-02 11:09:01,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:01,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:01,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:01,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:01,470 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 11:09:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:01,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:09:01,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:01,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:01,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 11:09:01,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:09:01,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:09:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:09:01,586 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-10-02 11:09:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:01,633 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-10-02 11:09:01,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:09:01,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-02 11:09:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:01,635 INFO L225 Difference]: With dead ends: 24 [2019-10-02 11:09:01,635 INFO L226 Difference]: Without dead ends: 18 [2019-10-02 11:09:01,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 11:09:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-02 11:09:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-02 11:09:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-02 11:09:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-10-02 11:09:01,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-10-02 11:09:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:01,641 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-10-02 11:09:01,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:09:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-10-02 11:09:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:09:01,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:01,642 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:01,643 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:01,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:01,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2019-10-02 11:09:01,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:01,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:01,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:01,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:01,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:01,717 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 11:09:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:09:01,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:09:01,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:01,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:09:01,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:09:01,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:01,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 11:09:01,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:09:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:09:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:09:01,807 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-10-02 11:09:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:01,839 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-10-02 11:09:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:09:01,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-02 11:09:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:01,841 INFO L225 Difference]: With dead ends: 26 [2019-10-02 11:09:01,841 INFO L226 Difference]: Without dead ends: 20 [2019-10-02 11:09:01,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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 11:09:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-02 11:09:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-02 11:09:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-02 11:09:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-10-02 11:09:01,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-10-02 11:09:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:01,847 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-10-02 11:09:01,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:09:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-10-02 11:09:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:09:01,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:01,849 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:01,849 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2019-10-02 11:09:01,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:01,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:01,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:01,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:01,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:01,921 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:09:01,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:09:01,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 11:09:01,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:01,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:09:01,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:02,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 11:09:02,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:09:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:09:02,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:09:02,010 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-10-02 11:09:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:02,052 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-10-02 11:09:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:09:02,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-02 11:09:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:02,053 INFO L225 Difference]: With dead ends: 28 [2019-10-02 11:09:02,053 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:09:02,054 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:09:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:09:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-02 11:09:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 11:09:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-10-02 11:09:02,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-10-02 11:09:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:02,060 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-10-02 11:09:02,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:09:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-10-02 11:09:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:09:02,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:02,061 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:02,062 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 4 times [2019-10-02 11:09:02,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:02,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:02,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:02,157 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 11:09:02,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:09:02,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:09:02,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:02,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:09:02,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:02,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:02,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 11:09:02,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:09:02,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:09:02,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:09:02,244 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-10-02 11:09:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:02,288 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-10-02 11:09:02,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:09:02,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-02 11:09:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:02,290 INFO L225 Difference]: With dead ends: 30 [2019-10-02 11:09:02,291 INFO L226 Difference]: Without dead ends: 24 [2019-10-02 11:09:02,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:09:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-02 11:09:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-02 11:09:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-02 11:09:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-10-02 11:09:02,305 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-10-02 11:09:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:02,305 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-10-02 11:09:02,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:09:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-10-02 11:09:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:09:02,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:02,307 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:02,308 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:02,308 INFO L82 PathProgramCache]: Analyzing trace with hash 954425671, now seen corresponding path program 5 times [2019-10-02 11:09:02,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:02,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:02,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:02,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:09:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:09:02,523 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 11:09:02,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:02,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:09:02,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:02,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:02,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-02 11:09:02,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:09:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:09:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:09:02,550 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-10-02 11:09:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:02,592 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-10-02 11:09:02,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:09:02,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-02 11:09:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:02,593 INFO L225 Difference]: With dead ends: 32 [2019-10-02 11:09:02,593 INFO L226 Difference]: Without dead ends: 26 [2019-10-02 11:09:02,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:09:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-02 11:09:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-10-02 11:09:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-02 11:09:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-10-02 11:09:02,599 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-10-02 11:09:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:02,599 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-10-02 11:09:02,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:09:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-10-02 11:09:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:09:02,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:02,601 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:02,601 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1534314089, now seen corresponding path program 6 times [2019-10-02 11:09:02,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:02,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:02,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:02,696 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:09:02,719 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:09:02,762 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 11:09:02,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:02,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:09:02,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 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 11:09:02,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:02,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 11:09:02,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:09:02,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:09:02,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:09:02,791 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-10-02 11:09:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:02,839 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-10-02 11:09:02,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:09:02,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-02 11:09:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:02,840 INFO L225 Difference]: With dead ends: 34 [2019-10-02 11:09:02,840 INFO L226 Difference]: Without dead ends: 28 [2019-10-02 11:09:02,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:09:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-02 11:09:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-02 11:09:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:09:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-10-02 11:09:02,846 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-10-02 11:09:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:02,846 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-10-02 11:09:02,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:09:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-10-02 11:09:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:09:02,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:02,848 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:02,848 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash 461335307, now seen corresponding path program 7 times [2019-10-02 11:09:02,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:02,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:02,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:02,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:02,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:02,957 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 11:09:02,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:09:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:03,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:09:03,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:03,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:03,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 11:09:03,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:09:03,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:09:03,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:09:03,041 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-10-02 11:09:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:03,100 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-10-02 11:09:03,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:09:03,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-02 11:09:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:03,103 INFO L225 Difference]: With dead ends: 36 [2019-10-02 11:09:03,103 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 11:09:03,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 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 11:09:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 11:09:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-02 11:09:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:09:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-10-02 11:09:03,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-10-02 11:09:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:03,112 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-10-02 11:09:03,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:09:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-10-02 11:09:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:09:03,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:03,113 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:03,114 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 120876845, now seen corresponding path program 8 times [2019-10-02 11:09:03,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:03,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:03,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:03,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:03,280 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 11:09:03,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:09:03,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:09:03,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:03,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:09:03,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:03,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 11:09:03,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:09:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:09:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:09:03,380 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-10-02 11:09:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:03,452 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-10-02 11:09:03,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:09:03,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-02 11:09:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:03,455 INFO L225 Difference]: With dead ends: 38 [2019-10-02 11:09:03,455 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 11:09:03,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 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 11:09:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 11:09:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-02 11:09:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 11:09:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-10-02 11:09:03,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-10-02 11:09:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:03,460 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-10-02 11:09:03,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:09:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-10-02 11:09:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:09:03,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:03,462 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:03,462 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:03,462 INFO L82 PathProgramCache]: Analyzing trace with hash -642190641, now seen corresponding path program 9 times [2019-10-02 11:09:03,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:03,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:03,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:03,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:03,576 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:09:03,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:09:03,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 11:09:03,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:03,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 11:09:03,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:03,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-02 11:09:03,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:09:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:09:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:09:03,701 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-10-02 11:09:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:03,757 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-10-02 11:09:03,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:09:03,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-10-02 11:09:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:03,760 INFO L225 Difference]: With dead ends: 40 [2019-10-02 11:09:03,760 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 11:09:03,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:09:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 11:09:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-02 11:09:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:09:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-10-02 11:09:03,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-10-02 11:09:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:03,769 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-10-02 11:09:03,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:09:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-10-02 11:09:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:09:03,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:03,771 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:03,771 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 10 times [2019-10-02 11:09:03,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:03,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:03,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:03,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:03,933 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 11:09:03,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:09:03,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:09:03,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:03,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:09:03,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:04,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:04,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 11:09:04,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:09:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:09:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:09:04,036 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-10-02 11:09:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:04,082 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-10-02 11:09:04,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:09:04,087 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-02 11:09:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:04,088 INFO L225 Difference]: With dead ends: 42 [2019-10-02 11:09:04,088 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 11:09:04,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 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 11:09:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 11:09:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-02 11:09:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 11:09:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-10-02 11:09:04,095 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-10-02 11:09:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:04,095 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-10-02 11:09:04,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:09:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-10-02 11:09:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 11:09:04,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:04,096 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:04,097 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1285617811, now seen corresponding path program 11 times [2019-10-02 11:09:04,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:04,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:04,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:04,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:04,236 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 11:09:04,258 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:09:04,342 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-02 11:09:04,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:04,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:09:04,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:09:04,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:04,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-02 11:09:04,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:09:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:09:04,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:09:04,377 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-10-02 11:09:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:04,432 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-10-02 11:09:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:09:04,432 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-10-02 11:09:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:04,433 INFO L225 Difference]: With dead ends: 44 [2019-10-02 11:09:04,433 INFO L226 Difference]: Without dead ends: 38 [2019-10-02 11:09:04,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:09:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-02 11:09:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-02 11:09:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 11:09:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-10-02 11:09:04,442 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-10-02 11:09:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:04,443 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-10-02 11:09:04,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:09:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-10-02 11:09:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:09:04,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:04,445 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:04,446 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1982380725, now seen corresponding path program 12 times [2019-10-02 11:09:04,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:04,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:04,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:04,632 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:09:04,661 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:09:04,848 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 11:09:04,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:04,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:09:04,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:04,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:04,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-02 11:09:04,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:09:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:09:04,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:09:04,878 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-10-02 11:09:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:04,937 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-10-02 11:09:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:09:04,937 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-10-02 11:09:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:04,938 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:09:04,938 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:09:04,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:09:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:09:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-02 11:09:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:09:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-10-02 11:09:04,943 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-10-02 11:09:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:04,943 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-10-02 11:09:04,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:09:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-10-02 11:09:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:09:04,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:04,945 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:04,945 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1556642903, now seen corresponding path program 13 times [2019-10-02 11:09:04,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:04,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:04,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:04,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:05,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:05,114 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:09:05,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:05,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:09:05,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:05,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:05,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 11:09:05,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 11:09:05,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 11:09:05,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:09:05,216 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-10-02 11:09:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:05,276 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-10-02 11:09:05,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:09:05,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-10-02 11:09:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:05,278 INFO L225 Difference]: With dead ends: 48 [2019-10-02 11:09:05,278 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:09:05,279 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:09:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:09:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-10-02 11:09:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 11:09:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-10-02 11:09:05,283 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-10-02 11:09:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:05,284 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-10-02 11:09:05,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 11:09:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-10-02 11:09:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 11:09:05,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:05,285 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:05,285 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash 444489081, now seen corresponding path program 14 times [2019-10-02 11:09:05,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:05,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:05,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:05,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:05,446 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:09:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:09:05,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:09:05,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:05,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:09:05,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:05,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:05,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 11:09:05,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:09:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:09:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:09:05,543 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-10-02 11:09:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:05,647 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-02 11:09:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:09:05,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-10-02 11:09:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:05,648 INFO L225 Difference]: With dead ends: 50 [2019-10-02 11:09:05,648 INFO L226 Difference]: Without dead ends: 44 [2019-10-02 11:09:05,649 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 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 11:09:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-02 11:09:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-10-02 11:09:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:09:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-10-02 11:09:05,656 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-10-02 11:09:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:05,656 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-10-02 11:09:05,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:09:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-10-02 11:09:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 11:09:05,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:05,657 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:05,657 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522843, now seen corresponding path program 15 times [2019-10-02 11:09:05,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:05,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:05,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:05,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:05,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:05,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:05,879 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 11:09:05,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:09:06,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-02 11:09:06,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:06,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 11:09:06,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:06,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-02 11:09:06,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:09:06,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:09:06,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:09:06,208 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-10-02 11:09:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:06,275 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-10-02 11:09:06,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:09:06,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-10-02 11:09:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:06,276 INFO L225 Difference]: With dead ends: 52 [2019-10-02 11:09:06,277 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 11:09:06,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:09:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 11:09:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-10-02 11:09:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 11:09:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-10-02 11:09:06,281 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-10-02 11:09:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:06,282 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-10-02 11:09:06,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:09:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-10-02 11:09:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:09:06,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:06,283 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:06,283 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2114126275, now seen corresponding path program 16 times [2019-10-02 11:09:06,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:06,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:06,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:06,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:06,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:06,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:06,462 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 11:09:06,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:09:06,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:09:06,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:06,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:09:06,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:06,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:06,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 11:09:06,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:09:06,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:09:06,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:09:06,561 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-10-02 11:09:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:06,625 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-10-02 11:09:06,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:09:06,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-10-02 11:09:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:06,626 INFO L225 Difference]: With dead ends: 54 [2019-10-02 11:09:06,627 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 11:09:06,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 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 11:09:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 11:09:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-10-02 11:09:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 11:09:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-10-02 11:09:06,632 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-10-02 11:09:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:06,633 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-10-02 11:09:06,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:09:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-10-02 11:09:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:09:06,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:06,634 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:06,634 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash -996540961, now seen corresponding path program 17 times [2019-10-02 11:09:06,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:06,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:06,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:06,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:06,837 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 11:09:06,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:09:07,108 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-02 11:09:07,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:07,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 11:09:07,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:07,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:07,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-02 11:09:07,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:09:07,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:09:07,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:09:07,145 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-10-02 11:09:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:07,231 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-10-02 11:09:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:09:07,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-10-02 11:09:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:07,233 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:09:07,233 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 11:09:07,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:09:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 11:09:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-02 11:09:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 11:09:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-10-02 11:09:07,240 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-10-02 11:09:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:07,241 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-10-02 11:09:07,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:09:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-10-02 11:09:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:09:07,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:07,242 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:07,243 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash -738878207, now seen corresponding path program 18 times [2019-10-02 11:09:07,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:07,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:07,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:07,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:07,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:07,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:07,528 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) [2019-10-02 11:09:07,567 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:09:07,996 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-02 11:09:07,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:07,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 11:09:08,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:09:08,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:08,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-02 11:09:08,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 11:09:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 11:09:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:09:08,045 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-10-02 11:09:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:08,115 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-10-02 11:09:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:09:08,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-10-02 11:09:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:08,117 INFO L225 Difference]: With dead ends: 58 [2019-10-02 11:09:08,117 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 11:09:08,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:09:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 11:09:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-02 11:09:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 11:09:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-10-02 11:09:08,122 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-10-02 11:09:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:08,122 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-10-02 11:09:08,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 11:09:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-10-02 11:09:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:09:08,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:08,123 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:08,124 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2061892515, now seen corresponding path program 19 times [2019-10-02 11:09:08,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:08,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:08,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:08,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:08,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:08,354 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 11:09:08,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:08,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:09:08,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:08,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:08,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 11:09:08,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:09:08,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:09:08,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:09:08,439 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-10-02 11:09:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:08,521 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-10-02 11:09:08,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 11:09:08,522 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-10-02 11:09:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:08,522 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:09:08,523 INFO L226 Difference]: Without dead ends: 54 [2019-10-02 11:09:08,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 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 11:09:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-02 11:09:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-02 11:09:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 11:09:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-10-02 11:09:08,527 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-10-02 11:09:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:08,528 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-10-02 11:09:08,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:09:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-10-02 11:09:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:09:08,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:08,529 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:08,529 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash 658061765, now seen corresponding path program 20 times [2019-10-02 11:09:08,530 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:08,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:08,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:08,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:08,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:08,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:08,814 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:09:08,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:09:08,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:09:08,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:08,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 11:09:08,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:09:08,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:08,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 11:09:08,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:09:08,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:09:08,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:09:08,910 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-10-02 11:09:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:08,996 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-10-02 11:09:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:09:08,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-10-02 11:09:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:09,000 INFO L225 Difference]: With dead ends: 62 [2019-10-02 11:09:09,000 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 11:09:09,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 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 11:09:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 11:09:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-02 11:09:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 11:09:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-10-02 11:09:09,004 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-10-02 11:09:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:09,005 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-10-02 11:09:09,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:09:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-10-02 11:09:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:09:09,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:09,016 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:09,016 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 196441959, now seen corresponding path program 21 times [2019-10-02 11:09:09,017 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:09,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:09,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:09,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:09,304 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 11:09:09,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:09:09,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-02 11:09:09,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:09,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:09:09,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:09,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:09,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-02 11:09:09,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 11:09:09,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 11:09:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:09:09,779 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-10-02 11:09:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:09,844 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-10-02 11:09:09,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 11:09:09,845 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-10-02 11:09:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:09,846 INFO L225 Difference]: With dead ends: 64 [2019-10-02 11:09:09,846 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 11:09:09,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 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 11:09:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 11:09:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-02 11:09:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 11:09:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-02 11:09:09,850 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-10-02 11:09:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:09,851 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-02 11:09:09,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 11:09:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-02 11:09:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:09:09,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:09,852 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:09,852 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 22 times [2019-10-02 11:09:09,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:09,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:09,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:10,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:10,236 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 11:09:10,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:09:10,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:09:10,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:10,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 11:09:10,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:10,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:10,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 11:09:10,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 11:09:10,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 11:09:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:09:10,350 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-10-02 11:09:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:10,442 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-10-02 11:09:10,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:09:10,443 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-10-02 11:09:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:10,444 INFO L225 Difference]: With dead ends: 66 [2019-10-02 11:09:10,444 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:09:10,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:09:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:09:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-02 11:09:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 11:09:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-10-02 11:09:10,449 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-10-02 11:09:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:10,450 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-10-02 11:09:10,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 11:09:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-10-02 11:09:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:09:10,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:10,451 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:10,451 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1830383915, now seen corresponding path program 23 times [2019-10-02 11:09:10,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:10,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:10,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:10,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:10,809 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 11:09:10,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:09:11,129 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-02 11:09:11,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:11,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 11:09:11,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:11,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-02 11:09:11,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 11:09:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 11:09:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:09:11,155 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-10-02 11:09:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:11,258 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-10-02 11:09:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 11:09:11,258 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-10-02 11:09:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:11,259 INFO L225 Difference]: With dead ends: 68 [2019-10-02 11:09:11,259 INFO L226 Difference]: Without dead ends: 62 [2019-10-02 11:09:11,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:09:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-02 11:09:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-10-02 11:09:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 11:09:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-10-02 11:09:11,263 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-10-02 11:09:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:11,264 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-10-02 11:09:11,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 11:09:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-10-02 11:09:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 11:09:11,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:11,265 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:11,265 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1516596557, now seen corresponding path program 24 times [2019-10-02 11:09:11,266 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:11,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:11,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:11,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:11,582 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 11:09:11,609 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:09:14,850 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-02 11:09:14,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:14,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 11:09:14,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:14,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:14,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-02 11:09:14,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 11:09:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 11:09:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:09:14,885 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-10-02 11:09:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:14,984 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-10-02 11:09:14,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 11:09:14,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-10-02 11:09:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:14,986 INFO L225 Difference]: With dead ends: 70 [2019-10-02 11:09:14,986 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 11:09:14,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 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 11:09:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 11:09:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-02 11:09:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 11:09:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-10-02 11:09:14,990 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-10-02 11:09:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:14,991 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-10-02 11:09:14,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 11:09:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-10-02 11:09:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:09:14,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:14,992 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:14,992 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 614656239, now seen corresponding path program 25 times [2019-10-02 11:09:14,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:14,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:14,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:15,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:15,427 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 11:09:15,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:15,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 11:09:15,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:15,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:15,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 11:09:15,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 11:09:15,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 11:09:15,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 11:09:15,565 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-10-02 11:09:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:15,659 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-10-02 11:09:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 11:09:15,659 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-10-02 11:09:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:15,660 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:09:15,660 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 11:09:15,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 11:09:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 11:09:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-02 11:09:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 11:09:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-10-02 11:09:15,665 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-10-02 11:09:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:15,665 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-10-02 11:09:15,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 11:09:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-10-02 11:09:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:09:15,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:15,666 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:15,667 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1433404433, now seen corresponding path program 26 times [2019-10-02 11:09:15,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:15,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:16,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:16,086 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 11:09:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:09:16,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:09:16,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:16,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 11:09:16,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:09:16,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:16,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 11:09:16,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 11:09:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 11:09:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:09:16,210 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-10-02 11:09:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:16,314 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-10-02 11:09:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 11:09:16,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-10-02 11:09:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:16,315 INFO L225 Difference]: With dead ends: 74 [2019-10-02 11:09:16,315 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 11:09:16,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:09:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 11:09:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-02 11:09:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 11:09:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-10-02 11:09:16,320 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-10-02 11:09:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:16,321 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-10-02 11:09:16,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 11:09:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-10-02 11:09:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 11:09:16,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:16,322 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:16,322 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2023563597, now seen corresponding path program 27 times [2019-10-02 11:09:16,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:16,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:16,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:16,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:16,724 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 11:09:16,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:09:22,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-02 11:09:22,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:22,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:09:22,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:22,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:22,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-02 11:09:22,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 11:09:22,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 11:09:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:09:22,051 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-10-02 11:09:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:22,179 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-10-02 11:09:22,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 11:09:22,179 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-10-02 11:09:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:22,180 INFO L225 Difference]: With dead ends: 76 [2019-10-02 11:09:22,180 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 11:09:22,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 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 11:09:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 11:09:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-02 11:09:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-02 11:09:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-10-02 11:09:22,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-10-02 11:09:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:22,191 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-10-02 11:09:22,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 11:09:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-10-02 11:09:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 11:09:22,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:22,192 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:22,192 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash 134846677, now seen corresponding path program 28 times [2019-10-02 11:09:22,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:22,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:22,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:22,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:22,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:22,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:22,597 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 11:09:22,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:09:22,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:09:22,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:22,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 11:09:22,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:22,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:22,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-02 11:09:22,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 11:09:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 11:09:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:09:22,693 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-10-02 11:09:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:22,797 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-10-02 11:09:22,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 11:09:22,797 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-10-02 11:09:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:22,798 INFO L225 Difference]: With dead ends: 78 [2019-10-02 11:09:22,798 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 11:09:22,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:09:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 11:09:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-02 11:09:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 11:09:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-10-02 11:09:22,802 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-10-02 11:09:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:22,802 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-10-02 11:09:22,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 11:09:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-10-02 11:09:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 11:09:22,803 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:22,803 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:22,804 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:22,804 INFO L82 PathProgramCache]: Analyzing trace with hash -102083977, now seen corresponding path program 29 times [2019-10-02 11:09:22,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:22,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:22,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:23,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:23,208 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 11:09:23,269 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:09:23,824 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-02 11:09:23,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:23,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 11:09:23,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:23,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:23,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-02 11:09:23,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 11:09:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 11:09:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:09:23,858 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-10-02 11:09:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:23,952 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-10-02 11:09:23,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 11:09:23,953 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-10-02 11:09:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:23,954 INFO L225 Difference]: With dead ends: 80 [2019-10-02 11:09:23,954 INFO L226 Difference]: Without dead ends: 74 [2019-10-02 11:09:23,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:09:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-02 11:09:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-02 11:09:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-02 11:09:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-10-02 11:09:23,958 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-10-02 11:09:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:23,959 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-10-02 11:09:23,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 11:09:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-10-02 11:09:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 11:09:23,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:23,960 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:23,960 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:23,961 INFO L82 PathProgramCache]: Analyzing trace with hash -159175783, now seen corresponding path program 30 times [2019-10-02 11:09:23,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:23,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:23,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:23,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:23,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:24,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:24,400 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 11:09:24,436 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:09:30,473 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-02 11:09:30,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:30,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 11:09:30,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:30,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:30,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-02 11:09:30,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 11:09:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 11:09:30,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 11:09:30,504 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-10-02 11:09:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:30,623 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-10-02 11:09:30,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 11:09:30,624 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-10-02 11:09:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:30,625 INFO L225 Difference]: With dead ends: 82 [2019-10-02 11:09:30,625 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 11:09:30,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 11:09:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 11:09:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-02 11:09:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 11:09:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-10-02 11:09:30,630 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-10-02 11:09:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:30,630 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-10-02 11:09:30,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 11:09:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-10-02 11:09:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 11:09:30,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:30,631 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:30,631 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash 810173499, now seen corresponding path program 31 times [2019-10-02 11:09:30,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:30,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:31,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:31,227 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 11:09:31,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:31,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 11:09:31,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:31,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:31,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-02 11:09:31,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 11:09:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 11:09:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:09:31,332 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-10-02 11:09:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:31,460 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-10-02 11:09:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 11:09:31,460 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-10-02 11:09:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:31,461 INFO L225 Difference]: With dead ends: 84 [2019-10-02 11:09:31,461 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 11:09:31,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:09:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 11:09:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-02 11:09:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 11:09:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-10-02 11:09:31,466 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-10-02 11:09:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:31,467 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-10-02 11:09:31,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 11:09:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-10-02 11:09:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 11:09:31,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:31,468 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:31,468 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:31,468 INFO L82 PathProgramCache]: Analyzing trace with hash 346930269, now seen corresponding path program 32 times [2019-10-02 11:09:31,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:31,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:31,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:31,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:31,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:31,952 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 11:09:31,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:09:32,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:09:32,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:32,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 11:09:32,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:32,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:32,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 11:09:32,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 11:09:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 11:09:32,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 11:09:32,062 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-10-02 11:09:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:32,179 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-10-02 11:09:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 11:09:32,179 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-10-02 11:09:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:32,180 INFO L225 Difference]: With dead ends: 86 [2019-10-02 11:09:32,180 INFO L226 Difference]: Without dead ends: 80 [2019-10-02 11:09:32,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 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 11:09:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-02 11:09:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-10-02 11:09:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-02 11:09:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-10-02 11:09:32,185 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-10-02 11:09:32,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:32,185 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-10-02 11:09:32,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 11:09:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-10-02 11:09:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 11:09:32,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:32,186 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:32,187 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1846785023, now seen corresponding path program 33 times [2019-10-02 11:09:32,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:32,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:32,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:32,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:32,705 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 11:09:32,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:09:54,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-10-02 11:09:54,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:54,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 11:09:54,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:54,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:54,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-02 11:09:54,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 11:09:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 11:09:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 11:09:54,682 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-10-02 11:09:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:54,794 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-10-02 11:09:54,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 11:09:54,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-10-02 11:09:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:54,795 INFO L225 Difference]: With dead ends: 88 [2019-10-02 11:09:54,796 INFO L226 Difference]: Without dead ends: 82 [2019-10-02 11:09:54,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 11:09:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-02 11:09:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-10-02 11:09:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-02 11:09:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-10-02 11:09:54,799 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-10-02 11:09:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:54,800 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-10-02 11:09:54,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 11:09:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-10-02 11:09:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 11:09:54,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:54,803 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:54,803 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash 98192161, now seen corresponding path program 34 times [2019-10-02 11:09:54,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:54,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:54,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:55,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:55,345 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 11:09:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:09:55,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:09:55,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:55,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 11:09:55,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-02 11:09:55,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 11:09:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 11:09:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 11:09:55,463 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-10-02 11:09:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:55,599 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-10-02 11:09:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 11:09:55,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-10-02 11:09:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:55,600 INFO L225 Difference]: With dead ends: 90 [2019-10-02 11:09:55,601 INFO L226 Difference]: Without dead ends: 84 [2019-10-02 11:09:55,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 11:09:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-02 11:09:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-10-02 11:09:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 11:09:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-10-02 11:09:55,606 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-10-02 11:09:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:55,606 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-10-02 11:09:55,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 11:09:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-10-02 11:09:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:09:55,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:55,607 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:55,607 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash -967335485, now seen corresponding path program 35 times [2019-10-02 11:09:55,607 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:55,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:55,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:56,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:56,184 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 11:09:56,227 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:09:57,293 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-02 11:09:57,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:09:57,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 11:09:57,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:09:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:57,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:09:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-02 11:09:57,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 11:09:57,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 11:09:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 11:09:57,332 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-10-02 11:09:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:57,476 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-10-02 11:09:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 11:09:57,477 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-10-02 11:09:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:57,478 INFO L225 Difference]: With dead ends: 92 [2019-10-02 11:09:57,478 INFO L226 Difference]: Without dead ends: 86 [2019-10-02 11:09:57,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 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 11:09:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-02 11:09:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-10-02 11:09:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 11:09:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-10-02 11:09:57,481 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-10-02 11:09:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:57,483 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-10-02 11:09:57,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 11:09:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-10-02 11:09:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 11:09:57,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:57,484 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:57,484 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1557780453, now seen corresponding path program 36 times [2019-10-02 11:09:57,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:57,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:57,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:57,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:09:57,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:58,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:09:58,559 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 11:09:58,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:10:22,978 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-10-02 11:10:22,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:10:22,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 11:10:22,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:10:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:23,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:10:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-02 11:10:23,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 11:10:23,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 11:10:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:10:23,033 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-10-02 11:10:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:10:23,163 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-10-02 11:10:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:10:23,163 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-10-02 11:10:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:10:23,164 INFO L225 Difference]: With dead ends: 94 [2019-10-02 11:10:23,164 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 11:10:23,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:10:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 11:10:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-02 11:10:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 11:10:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-10-02 11:10:23,168 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-10-02 11:10:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:10:23,169 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-10-02 11:10:23,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 11:10:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-10-02 11:10:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 11:10:23,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:10:23,170 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:10:23,170 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:10:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:10:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1537674631, now seen corresponding path program 37 times [2019-10-02 11:10:23,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:10:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:10:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:23,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:10:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:10:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:24,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:10:24,166 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:10:24,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:10:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:10:24,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 11:10:24,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:10:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:24,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:10:24,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-02 11:10:24,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 11:10:24,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 11:10:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 11:10:24,294 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-10-02 11:10:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:10:24,449 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-10-02 11:10:24,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 11:10:24,449 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-10-02 11:10:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:10:24,450 INFO L225 Difference]: With dead ends: 96 [2019-10-02 11:10:24,450 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 11:10:24,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 11:10:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 11:10:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-02 11:10:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 11:10:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-10-02 11:10:24,454 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-10-02 11:10:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:10:24,455 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-10-02 11:10:24,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 11:10:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-10-02 11:10:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 11:10:24,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:10:24,456 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:10:24,456 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:10:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:10:24,456 INFO L82 PathProgramCache]: Analyzing trace with hash -604151127, now seen corresponding path program 38 times [2019-10-02 11:10:24,456 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:10:24,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:10:24,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:24,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:10:24,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:10:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:25,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:10:25,167 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 11:10:25,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:10:25,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:10:25,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:10:25,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 11:10:25,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:10:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:25,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:10:25,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-02 11:10:25,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 11:10:25,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 11:10:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:10:25,312 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-10-02 11:10:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:10:25,439 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-10-02 11:10:25,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 11:10:25,440 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-10-02 11:10:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:10:25,441 INFO L225 Difference]: With dead ends: 98 [2019-10-02 11:10:25,441 INFO L226 Difference]: Without dead ends: 92 [2019-10-02 11:10:25,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:10:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-02 11:10:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-10-02 11:10:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 11:10:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-10-02 11:10:25,446 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-10-02 11:10:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:10:25,446 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-10-02 11:10:25,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 11:10:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-10-02 11:10:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 11:10:25,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:10:25,447 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:10:25,447 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:10:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:10:25,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1609369781, now seen corresponding path program 39 times [2019-10-02 11:10:25,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:10:25,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:10:25,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:25,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:10:25,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:10:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:26,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:10:26,287 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 11:10:26,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:11:09,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-10-02 11:11:09,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:11:09,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 11:11:09,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:11:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:11:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:11:09,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-02 11:11:09,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 11:11:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 11:11:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 11:11:09,147 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-10-02 11:11:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:11:09,295 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-10-02 11:11:09,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 11:11:09,295 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-10-02 11:11:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:11:09,296 INFO L225 Difference]: With dead ends: 100 [2019-10-02 11:11:09,296 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 11:11:09,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 11:11:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 11:11:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-10-02 11:11:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-02 11:11:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-10-02 11:11:09,304 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-10-02 11:11:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:11:09,305 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-10-02 11:11:09,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 11:11:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-10-02 11:11:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 11:11:09,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:11:09,306 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:11:09,306 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:11:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:11:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1256854675, now seen corresponding path program 40 times [2019-10-02 11:11:09,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:11:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:11:09,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:09,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:11:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:11:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:11:10,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:11:10,432 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 11:11:10,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:11:10,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:11:10,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:11:10,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 11:11:10,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:11:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:11:10,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:11:10,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-02 11:11:10,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 11:11:10,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 11:11:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 11:11:10,589 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-10-02 11:11:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:11:10,750 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-10-02 11:11:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 11:11:10,750 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-10-02 11:11:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:11:10,752 INFO L225 Difference]: With dead ends: 102 [2019-10-02 11:11:10,752 INFO L226 Difference]: Without dead ends: 96 [2019-10-02 11:11:10,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 11:11:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-02 11:11:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-02 11:11:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 11:11:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-10-02 11:11:10,757 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-10-02 11:11:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:11:10,757 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-10-02 11:11:10,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-02 11:11:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-10-02 11:11:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 11:11:10,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:11:10,758 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:11:10,759 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:11:10,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:11:10,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1792254193, now seen corresponding path program 41 times [2019-10-02 11:11:10,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:11:10,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:11:10,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:10,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:11:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:11:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:11:11,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:11:11,505 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 11:11:11,563 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:11:13,576 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-02 11:11:13,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:11:13,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 11:11:13,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:11:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:11:13,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:11:13,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-02 11:11:13,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 11:11:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 11:11:13,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 11:11:13,618 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-10-02 11:11:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:11:13,823 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-10-02 11:11:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 11:11:13,826 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-10-02 11:11:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:11:13,826 INFO L225 Difference]: With dead ends: 104 [2019-10-02 11:11:13,826 INFO L226 Difference]: Without dead ends: 98 [2019-10-02 11:11:13,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 11:11:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-02 11:11:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-10-02 11:11:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-02 11:11:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-10-02 11:11:13,831 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-10-02 11:11:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:11:13,832 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-10-02 11:11:13,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 11:11:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-10-02 11:11:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 11:11:13,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:11:13,833 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:11:13,833 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:11:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:11:13,833 INFO L82 PathProgramCache]: Analyzing trace with hash -915115471, now seen corresponding path program 42 times [2019-10-02 11:11:13,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:11:13,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:11:13,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:13,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:11:13,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:11:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:11:14,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:11:14,599 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 11:11:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:12:56,797 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-02 11:12:56,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:12:56,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-02 11:12:56,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:12:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:12:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:12:56,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-10-02 11:12:56,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 11:12:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 11:12:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 11:12:56,884 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-10-02 11:12:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:12:57,036 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-10-02 11:12:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 11:12:57,042 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-10-02 11:12:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:12:57,043 INFO L225 Difference]: With dead ends: 106 [2019-10-02 11:12:57,043 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 11:12:57,044 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 11:12:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 11:12:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-10-02 11:12:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 11:12:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-10-02 11:12:57,048 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-10-02 11:12:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:12:57,048 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-10-02 11:12:57,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 11:12:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-10-02 11:12:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 11:12:57,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:12:57,050 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:12:57,050 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:12:57,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:12:57,050 INFO L82 PathProgramCache]: Analyzing trace with hash 201606355, now seen corresponding path program 43 times [2019-10-02 11:12:57,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:12:57,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:12:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:12:57,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:12:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:12:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:12:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:12:57,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:12:57,907 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 11:12:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:12:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:12:58,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-02 11:12:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:12:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:12:58,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:12:58,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-02 11:12:58,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 11:12:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 11:12:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 11:12:58,057 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-10-02 11:12:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:12:58,230 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-10-02 11:12:58,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 11:12:58,231 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-10-02 11:12:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:12:58,232 INFO L225 Difference]: With dead ends: 108 [2019-10-02 11:12:58,232 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:12:58,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 11:12:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:12:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-10-02 11:12:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-02 11:12:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-10-02 11:12:58,236 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-10-02 11:12:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:12:58,237 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-10-02 11:12:58,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 11:12:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-10-02 11:12:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 11:12:58,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:12:58,238 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:12:58,238 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:12:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:12:58,238 INFO L82 PathProgramCache]: Analyzing trace with hash -370542859, now seen corresponding path program 44 times [2019-10-02 11:12:58,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:12:58,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:12:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:12:58,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:12:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:12:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:12:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:12:59,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:12:59,247 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 11:12:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:12:59,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:12:59,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:12:59,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 11:12:59,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:12:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:12:59,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:12:59,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-02 11:12:59,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 11:12:59,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 11:12:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 11:12:59,398 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-10-02 11:12:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:12:59,521 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-10-02 11:12:59,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 11:12:59,522 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-10-02 11:12:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:12:59,523 INFO L225 Difference]: With dead ends: 110 [2019-10-02 11:12:59,523 INFO L226 Difference]: Without dead ends: 104 [2019-10-02 11:12:59,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 11:12:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-02 11:12:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-10-02 11:12:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 11:12:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-10-02 11:12:59,528 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-10-02 11:12:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:12:59,528 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-10-02 11:12:59,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 11:12:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-10-02 11:12:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 11:12:59,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:12:59,529 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:12:59,529 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:12:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:12:59,532 INFO L82 PathProgramCache]: Analyzing trace with hash -450123625, now seen corresponding path program 45 times [2019-10-02 11:12:59,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:12:59,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:12:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:12:59,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:12:59,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:12:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:13:00,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:00,396 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 11:13:00,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:14:27,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-10-02 11:14:27,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:14:27,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 11:14:27,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:27,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:27,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-02 11:14:27,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 11:14:27,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 11:14:27,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 11:14:27,830 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-10-02 11:14:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:27,997 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-10-02 11:14:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 11:14:27,999 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-10-02 11:14:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:28,000 INFO L225 Difference]: With dead ends: 112 [2019-10-02 11:14:28,000 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 11:14:28,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 11:14:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 11:14:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-02 11:14:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-02 11:14:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-10-02 11:14:28,003 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-10-02 11:14:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:28,004 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-10-02 11:14:28,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 11:14:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-10-02 11:14:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 11:14:28,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:28,005 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:28,005 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 382171577, now seen corresponding path program 46 times [2019-10-02 11:14:28,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:28,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:14:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:28,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:28,894 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 11:14:28,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:14:29,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:14:29,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:14:29,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 11:14:29,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 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 11:14:29,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:29,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-02 11:14:29,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 11:14:29,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 11:14:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 11:14:29,046 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-10-02 11:14:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:29,238 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-10-02 11:14:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 11:14:29,239 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-10-02 11:14:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:29,240 INFO L225 Difference]: With dead ends: 114 [2019-10-02 11:14:29,240 INFO L226 Difference]: Without dead ends: 108 [2019-10-02 11:14:29,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 11:14:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-02 11:14:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-02 11:14:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-02 11:14:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-10-02 11:14:29,246 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-10-02 11:14:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:29,246 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-10-02 11:14:29,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 11:14:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-10-02 11:14:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 11:14:29,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:29,247 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:29,247 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1353943643, now seen corresponding path program 47 times [2019-10-02 11:14:29,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:29,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:29,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:29,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:14:29,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:30,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:30,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 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 11:14:30,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:14:32,799 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-02 11:14:32,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:14:32,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 11:14:32,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:32,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:32,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-02 11:14:32,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 11:14:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 11:14:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 11:14:32,833 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-10-02 11:14:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:33,033 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-10-02 11:14:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 11:14:33,034 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-10-02 11:14:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:33,035 INFO L225 Difference]: With dead ends: 116 [2019-10-02 11:14:33,035 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 11:14:33,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 11:14:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 11:14:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-10-02 11:14:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-02 11:14:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-10-02 11:14:33,039 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-10-02 11:14:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:33,040 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-10-02 11:14:33,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 11:14:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-10-02 11:14:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 11:14:33,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:33,041 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:33,041 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1075971459, now seen corresponding path program 48 times [2019-10-02 11:14:33,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:33,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:33,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:14:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:34,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:34,390 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 11:14:34,466 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:17:28,697 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-10-02 11:17:28,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:28,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-02 11:17:28,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:28,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:28,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-10-02 11:17:28,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 11:17:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 11:17:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:17:28,812 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-10-02 11:17:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:29,007 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-10-02 11:17:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 11:17:29,008 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-10-02 11:17:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:29,009 INFO L225 Difference]: With dead ends: 118 [2019-10-02 11:17:29,009 INFO L226 Difference]: Without dead ends: 112 [2019-10-02 11:17:29,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:17:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-02 11:17:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-10-02 11:17:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-02 11:17:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-10-02 11:17:29,013 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-10-02 11:17:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:29,014 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-10-02 11:17:29,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 11:17:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-10-02 11:17:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 11:17:29,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:29,015 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:29,015 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash 237824543, now seen corresponding path program 49 times [2019-10-02 11:17:29,016 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:29,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:30,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:30,162 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:17:30,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:30,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 11:17:30,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:17:30,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:30,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-02 11:17:30,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 11:17:30,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 11:17:30,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:17:30,338 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-10-02 11:17:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:30,545 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-10-02 11:17:30,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 11:17:30,546 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-10-02 11:17:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:30,547 INFO L225 Difference]: With dead ends: 120 [2019-10-02 11:17:30,547 INFO L226 Difference]: Without dead ends: 114 [2019-10-02 11:17:30,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:17:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-02 11:17:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-10-02 11:17:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-02 11:17:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-10-02 11:17:30,552 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-10-02 11:17:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:30,553 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-10-02 11:17:30,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 11:17:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-10-02 11:17:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 11:17:30,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:30,555 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:30,556 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 75397441, now seen corresponding path program 50 times [2019-10-02 11:17:30,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:31,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:31,667 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 11:17:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:17:31,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:17:31,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:31,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-02 11:17:31,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 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 11:17:31,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:31,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-02 11:17:31,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 11:17:31,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 11:17:31,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 11:17:31,864 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-10-02 11:17:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:32,037 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-10-02 11:17:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 11:17:32,037 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-10-02 11:17:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:32,038 INFO L225 Difference]: With dead ends: 122 [2019-10-02 11:17:32,039 INFO L226 Difference]: Without dead ends: 116 [2019-10-02 11:17:32,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 11:17:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-02 11:17:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-10-02 11:17:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-02 11:17:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-10-02 11:17:32,043 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-10-02 11:17:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:32,043 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-10-02 11:17:32,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 11:17:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-10-02 11:17:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 11:17:32,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:32,044 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:32,044 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1398224925, now seen corresponding path program 51 times [2019-10-02 11:17:32,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:32,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:32,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:33,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:33,116 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 11:17:33,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:20:25,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-10-02 11:20:25,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:25,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 11:20:25,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:25,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:25,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-02 11:20:25,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 11:20:25,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 11:20:25,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 11:20:25,517 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-10-02 11:20:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:25,756 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-10-02 11:20:25,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 11:20:25,757 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-10-02 11:20:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:25,758 INFO L225 Difference]: With dead ends: 124 [2019-10-02 11:20:25,760 INFO L226 Difference]: Without dead ends: 118 [2019-10-02 11:20:25,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 11:20:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-02 11:20:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-10-02 11:20:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-02 11:20:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-10-02 11:20:25,766 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-10-02 11:20:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:25,766 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-10-02 11:20:25,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 11:20:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-10-02 11:20:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 11:20:25,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:25,768 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:25,768 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:25,769 INFO L82 PathProgramCache]: Analyzing trace with hash -210110971, now seen corresponding path program 52 times [2019-10-02 11:20:25,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:25,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:25,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:25,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:25,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:26,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:26,962 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 11:20:27,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:20:27,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:20:27,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:27,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-02 11:20:27,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:27,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:27,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-02 11:20:27,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 11:20:27,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 11:20:27,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 11:20:27,139 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-10-02 11:20:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:27,360 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-10-02 11:20:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 11:20:27,360 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-10-02 11:20:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:27,361 INFO L225 Difference]: With dead ends: 126 [2019-10-02 11:20:27,361 INFO L226 Difference]: Without dead ends: 120 [2019-10-02 11:20:27,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 11:20:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-02 11:20:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-10-02 11:20:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-02 11:20:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-10-02 11:20:27,366 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-10-02 11:20:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:27,366 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-10-02 11:20:27,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 11:20:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-10-02 11:20:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 11:20:27,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:27,367 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:27,367 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:27,368 INFO L82 PathProgramCache]: Analyzing trace with hash -893901913, now seen corresponding path program 53 times [2019-10-02 11:20:27,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:27,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:28,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:28,774 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:20:28,854 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:20:32,927 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-02 11:20:32,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:32,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 11:20:32,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-02 11:20:32,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-02 11:20:32,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-02 11:20:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 11:20:32,969 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-10-02 11:20:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:33,189 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-10-02 11:20:33,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 11:20:33,189 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-10-02 11:20:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:33,190 INFO L225 Difference]: With dead ends: 128 [2019-10-02 11:20:33,190 INFO L226 Difference]: Without dead ends: 122 [2019-10-02 11:20:33,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 11:20:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-02 11:20:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-10-02 11:20:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-02 11:20:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-10-02 11:20:33,194 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-10-02 11:20:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:33,195 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-10-02 11:20:33,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-02 11:20:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-10-02 11:20:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 11:20:33,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:33,196 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:33,196 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:33,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:33,196 INFO L82 PathProgramCache]: Analyzing trace with hash -887000887, now seen corresponding path program 54 times [2019-10-02 11:20:33,196 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:33,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:33,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:33,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:33,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:34,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:34,771 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 11:20:34,860 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE