java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_partition_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:26:27,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:26:27,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:26:27,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:26:27,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:26:27,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:26:27,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:26:27,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:26:27,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:26:27,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:26:27,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:26:27,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:26:27,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:26:27,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:26:27,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:26:27,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:26:27,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:26:27,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:26:27,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:26:27,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:26:27,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:26:27,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:26:27,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:26:27,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:26:27,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:26:27,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:26:27,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:26:27,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:26:27,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:26:27,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:26:27,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:26:27,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:26:27,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:26:27,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:26:27,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:26:27,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:26:27,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:26:27,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:26:27,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:26:27,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:26:27,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:26:27,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 23:26:27,258 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:26:27,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:26:27,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:26:27,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:26:27,261 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:26:27,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:26:27,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:26:27,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:26:27,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:26:27,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:26:27,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:26:27,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:26:27,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:26:27,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:26:27,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:26:27,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:26:27,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:26:27,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:26:27,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:26:27,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:26:27,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:26:27,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:26:27,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:26:27,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:26:27,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:26:27,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:26:27,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:26:27,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:26:27,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:26:27,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:26:27,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:26:27,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:26:27,314 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:26:27,315 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:26:27,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_ground-1.i [2019-10-01 23:26:27,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a5dbe95/c53ca7478fa34362b890512a8e566bf9/FLAG9375e9b18 [2019-10-01 23:26:27,835 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:26:27,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_ground-1.i [2019-10-01 23:26:27,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a5dbe95/c53ca7478fa34362b890512a8e566bf9/FLAG9375e9b18 [2019-10-01 23:26:28,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a5dbe95/c53ca7478fa34362b890512a8e566bf9 [2019-10-01 23:26:28,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:26:28,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:26:28,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:28,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:26:28,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:26:28,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36edca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28, skipping insertion in model container [2019-10-01 23:26:28,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,282 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:26:28,301 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:26:28,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:28,534 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:26:28,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:28,673 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:26:28,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28 WrapperNode [2019-10-01 23:26:28,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:28,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:26:28,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:26:28,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:26:28,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... [2019-10-01 23:26:28,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:26:28,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:26:28,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:26:28,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:26:28,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:26:28,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:26:28,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:26:28,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:26:28,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:26:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:26:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:26:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:26:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:26:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:26:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:26:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:26:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:26:28,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:26:28,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:26:29,072 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:26:29,072 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-01 23:26:29,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:29 BoogieIcfgContainer [2019-10-01 23:26:29,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:26:29,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:26:29,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:26:29,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:26:29,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:26:28" (1/3) ... [2019-10-01 23:26:29,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ec93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:29, skipping insertion in model container [2019-10-01 23:26:29,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:28" (2/3) ... [2019-10-01 23:26:29,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ec93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:29, skipping insertion in model container [2019-10-01 23:26:29,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:29" (3/3) ... [2019-10-01 23:26:29,082 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_ground-1.i [2019-10-01 23:26:29,093 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:26:29,108 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:26:29,149 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:26:29,197 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:26:29,198 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:26:29,198 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:26:29,198 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:26:29,199 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:26:29,199 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:26:29,199 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:26:29,199 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:26:29,200 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:26:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-10-01 23:26:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:26:29,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:29,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:29,233 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash -825680561, now seen corresponding path program 1 times [2019-10-01 23:26:29,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:29,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:26:29,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:26:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:26:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:26:29,409 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-10-01 23:26:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:29,434 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2019-10-01 23:26:29,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:26:29,435 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:26:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:29,444 INFO L225 Difference]: With dead ends: 59 [2019-10-01 23:26:29,445 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 23:26:29,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:26:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 23:26:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-01 23:26:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:26:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-10-01 23:26:29,499 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 15 [2019-10-01 23:26:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:29,500 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-10-01 23:26:29,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:26:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-10-01 23:26:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:26:29,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:29,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:29,502 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1876449348, now seen corresponding path program 1 times [2019-10-01 23:26:29,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:29,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:29,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:26:29,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:26:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:26:29,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:29,571 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-10-01 23:26:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:29,647 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-10-01 23:26:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:26:29,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:26:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:29,650 INFO L225 Difference]: With dead ends: 55 [2019-10-01 23:26:29,650 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 23:26:29,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 23:26:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-01 23:26:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 23:26:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-10-01 23:26:29,661 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 15 [2019-10-01 23:26:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:29,661 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-10-01 23:26:29,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:26:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-10-01 23:26:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 23:26:29,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:29,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:29,663 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash -684235798, now seen corresponding path program 1 times [2019-10-01 23:26:29,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:29,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:29,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:29,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:26:29,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:29,786 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:29,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:26:29,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:26:29,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:29,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:26:29,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:26:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:26:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:26:29,915 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2019-10-01 23:26:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:29,990 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2019-10-01 23:26:29,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:26:29,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-01 23:26:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:29,992 INFO L225 Difference]: With dead ends: 62 [2019-10-01 23:26:29,992 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 23:26:29,993 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:26:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 23:26:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-10-01 23:26:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 23:26:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-10-01 23:26:30,001 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 21 [2019-10-01 23:26:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:30,001 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-10-01 23:26:30,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:26:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-10-01 23:26:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 23:26:30,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:30,003 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:30,003 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:30,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1590841348, now seen corresponding path program 2 times [2019-10-01 23:26:30,004 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:30,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:30,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:30,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 23:26:30,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:30,097 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:30,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:30,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:30,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:30,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:26:30,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 23:26:30,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:30,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:26:30,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:26:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:26:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:30,202 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 6 states. [2019-10-01 23:26:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:30,274 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-10-01 23:26:30,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:26:30,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-01 23:26:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:30,276 INFO L225 Difference]: With dead ends: 71 [2019-10-01 23:26:30,276 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 23:26:30,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 23:26:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-10-01 23:26:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 23:26:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-10-01 23:26:30,287 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-10-01 23:26:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:30,287 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-10-01 23:26:30,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:26:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-10-01 23:26:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 23:26:30,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:30,289 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:30,289 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1802172202, now seen corresponding path program 3 times [2019-10-01 23:26:30,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:30,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:30,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:30,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 23:26:30,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:30,478 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:30,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:30,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 23:26:30,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:30,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:26:30,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 23:26:30,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:30,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:26:30,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:26:30,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:26:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:26:30,595 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 7 states. [2019-10-01 23:26:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:30,676 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2019-10-01 23:26:30,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:26:30,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-10-01 23:26:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:30,680 INFO L225 Difference]: With dead ends: 80 [2019-10-01 23:26:30,681 INFO L226 Difference]: Without dead ends: 53 [2019-10-01 23:26:30,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-01 23:26:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-01 23:26:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-10-01 23:26:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 23:26:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2019-10-01 23:26:30,689 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 33 [2019-10-01 23:26:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:30,690 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2019-10-01 23:26:30,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:26:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2019-10-01 23:26:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 23:26:30,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:30,692 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:30,692 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1613342780, now seen corresponding path program 4 times [2019-10-01 23:26:30,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:30,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:30,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:30,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:30,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 23:26:30,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:30,830 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:30,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:30,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:30,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:30,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:26:30,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 23:26:30,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:30,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:26:30,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:26:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:26:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:26:30,961 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 8 states. [2019-10-01 23:26:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:31,062 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2019-10-01 23:26:31,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:26:31,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-01 23:26:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:31,067 INFO L225 Difference]: With dead ends: 89 [2019-10-01 23:26:31,068 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 23:26:31,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:26:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 23:26:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-10-01 23:26:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 23:26:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2019-10-01 23:26:31,082 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 39 [2019-10-01 23:26:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:31,083 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2019-10-01 23:26:31,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:26:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2019-10-01 23:26:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 23:26:31,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:31,087 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:31,087 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:31,088 INFO L82 PathProgramCache]: Analyzing trace with hash 306051690, now seen corresponding path program 5 times [2019-10-01 23:26:31,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:31,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:31,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-01 23:26:31,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:31,266 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:31,298 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:26:31,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 23:26:31,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:31,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:26:31,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-01 23:26:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:26:31,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:26:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:26:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:26:31,733 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand 9 states. [2019-10-01 23:26:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:31,848 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2019-10-01 23:26:31,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:26:31,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-10-01 23:26:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:31,851 INFO L225 Difference]: With dead ends: 98 [2019-10-01 23:26:31,851 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 23:26:31,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 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-01 23:26:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 23:26:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-10-01 23:26:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 23:26:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-10-01 23:26:31,871 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 45 [2019-10-01 23:26:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:31,871 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-10-01 23:26:31,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:26:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-10-01 23:26:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 23:26:31,881 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:31,881 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:31,882 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash 835219332, now seen corresponding path program 6 times [2019-10-01 23:26:31,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:31,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:31,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:31,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-01 23:26:32,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:32,085 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:32,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:26:32,423 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:26:32,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:32,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:26:32,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-01 23:26:32,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:26:32,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:26:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:26:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:26:32,480 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 10 states. [2019-10-01 23:26:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:32,587 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2019-10-01 23:26:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:26:32,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-10-01 23:26:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:32,589 INFO L225 Difference]: With dead ends: 107 [2019-10-01 23:26:32,589 INFO L226 Difference]: Without dead ends: 71 [2019-10-01 23:26:32,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 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-01 23:26:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-01 23:26:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2019-10-01 23:26:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 23:26:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2019-10-01 23:26:32,597 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 51 [2019-10-01 23:26:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:32,598 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2019-10-01 23:26:32,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:26:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2019-10-01 23:26:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 23:26:32,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:32,599 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:32,600 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:32,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:32,600 INFO L82 PathProgramCache]: Analyzing trace with hash -653496918, now seen corresponding path program 7 times [2019-10-01 23:26:32,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:32,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:32,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-01 23:26:32,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:32,742 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:32,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:32,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:26:32,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-01 23:26:32,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:32,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:26:32,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:26:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:26:32,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:26:32,879 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 11 states. [2019-10-01 23:26:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:33,036 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2019-10-01 23:26:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:26:33,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-01 23:26:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:33,038 INFO L225 Difference]: With dead ends: 116 [2019-10-01 23:26:33,038 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 23:26:33,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:26:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 23:26:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-10-01 23:26:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 23:26:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2019-10-01 23:26:33,046 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 57 [2019-10-01 23:26:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:33,047 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2019-10-01 23:26:33,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:26:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2019-10-01 23:26:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 23:26:33,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:33,048 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:33,049 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:33,049 INFO L82 PathProgramCache]: Analyzing trace with hash -796092604, now seen corresponding path program 8 times [2019-10-01 23:26:33,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:33,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:33,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:33,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:33,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 23:26:33,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:33,174 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:33,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:33,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:33,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:26:33,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 23:26:33,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:33,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:26:33,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:26:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:26:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:26:33,286 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 12 states. [2019-10-01 23:26:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:33,419 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2019-10-01 23:26:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:26:33,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-10-01 23:26:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:33,421 INFO L225 Difference]: With dead ends: 125 [2019-10-01 23:26:33,421 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 23:26:33,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:26:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 23:26:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-10-01 23:26:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:26:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2019-10-01 23:26:33,428 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 63 [2019-10-01 23:26:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:33,429 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2019-10-01 23:26:33,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:26:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2019-10-01 23:26:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 23:26:33,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:33,430 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:33,430 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash -802008854, now seen corresponding path program 9 times [2019-10-01 23:26:33,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:33,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:33,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:33,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-01 23:26:33,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:33,571 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:36,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-01 23:26:36,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:36,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:26:36,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-01 23:26:36,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:36,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:26:36,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:26:36,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:26:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:26:36,199 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 13 states. [2019-10-01 23:26:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:36,320 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2019-10-01 23:26:36,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:26:36,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-10-01 23:26:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:36,321 INFO L225 Difference]: With dead ends: 134 [2019-10-01 23:26:36,322 INFO L226 Difference]: Without dead ends: 89 [2019-10-01 23:26:36,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 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-01 23:26:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-01 23:26:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-10-01 23:26:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 23:26:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2019-10-01 23:26:36,329 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 69 [2019-10-01 23:26:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:36,329 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2019-10-01 23:26:36,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:26:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2019-10-01 23:26:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:26:36,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:36,331 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:36,331 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 889638660, now seen corresponding path program 10 times [2019-10-01 23:26:36,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:36,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:36,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-01 23:26:36,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:36,463 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:36,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:37,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:37,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:37,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:26:37,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:26:37,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:26:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:26:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:26:37,682 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 14 states. [2019-10-01 23:26:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:37,837 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2019-10-01 23:26:37,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:26:37,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2019-10-01 23:26:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:37,840 INFO L225 Difference]: With dead ends: 143 [2019-10-01 23:26:37,840 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 23:26:37,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:26:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 23:26:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2019-10-01 23:26:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 23:26:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2019-10-01 23:26:37,848 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 75 [2019-10-01 23:26:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:37,848 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2019-10-01 23:26:37,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:26:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2019-10-01 23:26:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 23:26:37,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:37,850 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:37,850 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash -888429526, now seen corresponding path program 11 times [2019-10-01 23:26:37,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:37,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:37,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 23:26:38,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:38,102 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:38,138 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:27:19,284 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 23:27:19,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:19,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:27:19,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 23:27:19,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:19,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:27:19,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:27:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:27:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:27:19,359 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 15 states. [2019-10-01 23:27:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:19,492 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2019-10-01 23:27:19,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:27:19,493 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2019-10-01 23:27:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:19,495 INFO L225 Difference]: With dead ends: 152 [2019-10-01 23:27:19,495 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 23:27:19,495 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 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-01 23:27:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 23:27:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-10-01 23:27:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 23:27:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-10-01 23:27:19,502 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 81 [2019-10-01 23:27:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:19,502 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-10-01 23:27:19,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:27:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-10-01 23:27:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 23:27:19,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:19,503 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:19,504 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1427838660, now seen corresponding path program 12 times [2019-10-01 23:27:19,504 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:19,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:19,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:27:19,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:19,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 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-01 23:27:19,738 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:27:30,844 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:27:30,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:30,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:27:30,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:27:30,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:30,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:27:30,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:27:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:27:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:27:30,901 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 16 states. [2019-10-01 23:27:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:31,060 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2019-10-01 23:27:31,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:27:31,060 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-10-01 23:27:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:31,062 INFO L225 Difference]: With dead ends: 161 [2019-10-01 23:27:31,062 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 23:27:31,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 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-01 23:27:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 23:27:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-10-01 23:27:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 23:27:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2019-10-01 23:27:31,069 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 87 [2019-10-01 23:27:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:31,070 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2019-10-01 23:27:31,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:27:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2019-10-01 23:27:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 23:27:31,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:31,071 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:31,071 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash 536110954, now seen corresponding path program 13 times [2019-10-01 23:27:31,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:31,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:31,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-10-01 23:27:31,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:31,303 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:31,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:31,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:27:31,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-10-01 23:27:31,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:31,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:27:31,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:27:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:27:31,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:27:31,460 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 17 states. [2019-10-01 23:27:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:31,656 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2019-10-01 23:27:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:27:31,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2019-10-01 23:27:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:31,663 INFO L225 Difference]: With dead ends: 170 [2019-10-01 23:27:31,663 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 23:27:31,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:27:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 23:27:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-10-01 23:27:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 23:27:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 141 transitions. [2019-10-01 23:27:31,677 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 141 transitions. Word has length 93 [2019-10-01 23:27:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:31,677 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 141 transitions. [2019-10-01 23:27:31,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:27:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 141 transitions. [2019-10-01 23:27:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 23:27:31,678 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:31,679 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:31,679 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1548915068, now seen corresponding path program 14 times [2019-10-01 23:27:31,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:31,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:31,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:31,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:31,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-10-01 23:27:31,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:31,917 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:27:31,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:32,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:27:32,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:32,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:27:32,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-10-01 23:27:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:27:32,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:27:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:27:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:27:32,056 INFO L87 Difference]: Start difference. First operand 109 states and 141 transitions. Second operand 18 states. [2019-10-01 23:27:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:32,277 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2019-10-01 23:27:32,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:27:32,278 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2019-10-01 23:27:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:32,279 INFO L225 Difference]: With dead ends: 179 [2019-10-01 23:27:32,279 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 23:27:32,280 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:27:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 23:27:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2019-10-01 23:27:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 23:27:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2019-10-01 23:27:32,286 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 99 [2019-10-01 23:27:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:32,286 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2019-10-01 23:27:32,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:27:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2019-10-01 23:27:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-01 23:27:32,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:32,288 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:32,288 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1749588650, now seen corresponding path program 15 times [2019-10-01 23:27:32,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:32,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:32,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-01 23:27:32,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:32,536 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:28:22,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 23:28:22,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:22,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:28:22,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-01 23:28:22,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:22,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:28:22,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:28:22,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:28:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:28:22,646 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand 19 states. [2019-10-01 23:28:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:22,824 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2019-10-01 23:28:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:28:22,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2019-10-01 23:28:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:22,826 INFO L225 Difference]: With dead ends: 188 [2019-10-01 23:28:22,827 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 23:28:22,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:28:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 23:28:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2019-10-01 23:28:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 23:28:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 157 transitions. [2019-10-01 23:28:22,832 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 157 transitions. Word has length 105 [2019-10-01 23:28:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:22,833 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 157 transitions. [2019-10-01 23:28:22,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:28:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2019-10-01 23:28:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-01 23:28:22,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:22,834 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:22,835 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1352783428, now seen corresponding path program 16 times [2019-10-01 23:28:22,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:22,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:22,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-10-01 23:28:23,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:23,125 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:23,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:28:35,316 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:28:35,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:35,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:28:35,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-10-01 23:28:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:28:35,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:28:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:28:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:28:35,357 INFO L87 Difference]: Start difference. First operand 121 states and 157 transitions. Second operand 20 states. [2019-10-01 23:28:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:35,574 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2019-10-01 23:28:35,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:28:35,574 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-10-01 23:28:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:35,575 INFO L225 Difference]: With dead ends: 197 [2019-10-01 23:28:35,575 INFO L226 Difference]: Without dead ends: 131 [2019-10-01 23:28:35,576 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:28:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-01 23:28:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-10-01 23:28:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 23:28:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2019-10-01 23:28:35,581 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 165 transitions. Word has length 111 [2019-10-01 23:28:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:35,581 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 165 transitions. [2019-10-01 23:28:35,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:28:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2019-10-01 23:28:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:28:35,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:35,583 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:35,583 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1080311274, now seen corresponding path program 17 times [2019-10-01 23:28:35,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:35,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:35,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-10-01 23:28:35,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:35,826 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:30:24,673 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 23:30:24,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:24,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:30:24,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-10-01 23:30:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:30:24,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:30:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:30:24,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:30:24,789 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand 21 states. [2019-10-01 23:30:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:25,032 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2019-10-01 23:30:25,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:30:25,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2019-10-01 23:30:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:25,036 INFO L225 Difference]: With dead ends: 206 [2019-10-01 23:30:25,036 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 23:30:25,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 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-01 23:30:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 23:30:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-10-01 23:30:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 23:30:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2019-10-01 23:30:25,042 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 117 [2019-10-01 23:30:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:25,042 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2019-10-01 23:30:25,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:30:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2019-10-01 23:30:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 23:30:25,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:25,045 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:25,045 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:25,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1998828028, now seen corresponding path program 18 times [2019-10-01 23:30:25,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:25,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:25,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-01 23:30:25,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:25,391 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:25,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:31:55,829 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:31:55,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:31:55,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:31:55,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-01 23:31:55,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:55,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:31:55,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:31:55,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:31:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:31:55,922 INFO L87 Difference]: Start difference. First operand 133 states and 173 transitions. Second operand 22 states. [2019-10-01 23:31:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:56,147 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2019-10-01 23:31:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:31:56,148 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 123 [2019-10-01 23:31:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:56,150 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:31:56,150 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 23:31:56,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 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-01 23:31:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 23:31:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-10-01 23:31:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 23:31:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2019-10-01 23:31:56,156 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 123 [2019-10-01 23:31:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:56,156 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2019-10-01 23:31:56,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:31:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2019-10-01 23:31:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-01 23:31:56,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:56,158 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:56,158 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash 128143658, now seen corresponding path program 19 times [2019-10-01 23:31:56,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:56,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:56,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:31:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-10-01 23:31:56,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:56,426 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:56,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:31:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:56,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:31:56,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-10-01 23:31:56,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:56,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:31:56,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:31:56,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:31:56,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:31:56,564 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand 23 states. [2019-10-01 23:31:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:56,838 INFO L93 Difference]: Finished difference Result 224 states and 294 transitions. [2019-10-01 23:31:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:31:56,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2019-10-01 23:31:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:56,841 INFO L225 Difference]: With dead ends: 224 [2019-10-01 23:31:56,841 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 23:31:56,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:31:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 23:31:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-10-01 23:31:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 23:31:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2019-10-01 23:31:56,848 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 129 [2019-10-01 23:31:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:56,848 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2019-10-01 23:31:56,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:31:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2019-10-01 23:31:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 23:31:56,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:56,850 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:56,850 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1237264956, now seen corresponding path program 20 times [2019-10-01 23:31:56,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:56,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:56,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:56,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:31:56,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-10-01 23:31:57,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:57,161 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:57,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:31:57,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:31:57,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:31:57,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:31:57,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-10-01 23:31:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:31:57,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:31:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:31:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:31:57,316 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand 24 states. [2019-10-01 23:31:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:57,589 INFO L93 Difference]: Finished difference Result 233 states and 306 transitions. [2019-10-01 23:31:57,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:31:57,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2019-10-01 23:31:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:57,592 INFO L225 Difference]: With dead ends: 233 [2019-10-01 23:31:57,592 INFO L226 Difference]: Without dead ends: 155 [2019-10-01 23:31:57,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:31:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-01 23:31:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-10-01 23:31:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 23:31:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2019-10-01 23:31:57,597 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 135 [2019-10-01 23:31:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:57,598 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2019-10-01 23:31:57,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:31:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2019-10-01 23:31:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-01 23:31:57,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:57,600 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:57,600 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1604201366, now seen corresponding path program 21 times [2019-10-01 23:31:57,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:57,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:57,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:57,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:31:57,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-10-01 23:31:57,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:57,949 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:33:51,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-01 23:33:51,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:33:51,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:33:51,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:33:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-10-01 23:33:51,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:33:51,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:33:51,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:33:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:33:51,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:33:51,811 INFO L87 Difference]: Start difference. First operand 151 states and 197 transitions. Second operand 25 states. [2019-10-01 23:33:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:33:52,103 INFO L93 Difference]: Finished difference Result 242 states and 318 transitions. [2019-10-01 23:33:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:33:52,105 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2019-10-01 23:33:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:33:52,110 INFO L225 Difference]: With dead ends: 242 [2019-10-01 23:33:52,110 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 23:33:52,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 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-01 23:33:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 23:33:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2019-10-01 23:33:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 23:33:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-10-01 23:33:52,126 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 205 transitions. Word has length 141 [2019-10-01 23:33:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:33:52,127 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-10-01 23:33:52,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:33:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2019-10-01 23:33:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 23:33:52,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:33:52,130 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:33:52,130 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:33:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:33:52,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1078760060, now seen corresponding path program 22 times [2019-10-01 23:33:52,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:33:52,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:33:52,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:33:52,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:33:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:33:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:33:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-10-01 23:33:52,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:33:52,684 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:33:52,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:34:04,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:34:04,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:34:04,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:34:04,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:34:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-10-01 23:34:04,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:34:04,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:34:04,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:34:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:34:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:34:04,936 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. Second operand 26 states. [2019-10-01 23:34:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:34:05,216 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2019-10-01 23:34:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:34:05,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2019-10-01 23:34:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:34:05,218 INFO L225 Difference]: With dead ends: 251 [2019-10-01 23:34:05,218 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 23:34:05,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:34:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 23:34:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2019-10-01 23:34:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 23:34:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2019-10-01 23:34:05,226 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 147 [2019-10-01 23:34:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:34:05,226 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2019-10-01 23:34:05,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:34:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2019-10-01 23:34:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-01 23:34:05,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:34:05,228 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:34:05,228 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:34:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:34:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash 805029802, now seen corresponding path program 23 times [2019-10-01 23:34:05,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:34:05,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:34:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:05,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:34:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:34:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-10-01 23:34:05,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:34:05,658 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:34:05,722 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:37:05,540 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 23:37:05,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:37:05,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:37:05,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:37:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-10-01 23:37:05,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:37:05,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:37:05,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:37:05,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:37:05,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:37:05,690 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand 27 states. [2019-10-01 23:37:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:05,988 INFO L93 Difference]: Finished difference Result 260 states and 342 transitions. [2019-10-01 23:37:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:37:05,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 153 [2019-10-01 23:37:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:05,993 INFO L225 Difference]: With dead ends: 260 [2019-10-01 23:37:05,993 INFO L226 Difference]: Without dead ends: 173 [2019-10-01 23:37:05,993 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 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-01 23:37:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-01 23:37:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-10-01 23:37:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 23:37:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2019-10-01 23:37:05,999 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 153 [2019-10-01 23:37:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:05,999 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2019-10-01 23:37:06,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:37:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2019-10-01 23:37:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-01 23:37:06,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:06,002 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:06,002 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1226315076, now seen corresponding path program 24 times [2019-10-01 23:37:06,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:06,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:06,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:37:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2019-10-01 23:37:06,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:06,464 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:06,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:39:48,415 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:39:48,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:48,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:39:48,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2019-10-01 23:39:48,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:48,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:39:48,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:39:48,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:39:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:39:48,551 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand 28 states. [2019-10-01 23:39:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:48,862 INFO L93 Difference]: Finished difference Result 269 states and 354 transitions. [2019-10-01 23:39:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:39:48,863 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 159 [2019-10-01 23:39:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:48,864 INFO L225 Difference]: With dead ends: 269 [2019-10-01 23:39:48,865 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 23:39:48,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:39:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 23:39:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2019-10-01 23:39:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-01 23:39:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2019-10-01 23:39:48,871 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 229 transitions. Word has length 159 [2019-10-01 23:39:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:48,871 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 229 transitions. [2019-10-01 23:39:48,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:39:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 229 transitions. [2019-10-01 23:39:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-01 23:39:48,873 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:48,873 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:48,874 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash -556979478, now seen corresponding path program 25 times [2019-10-01 23:39:48,874 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:48,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:48,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-10-01 23:39:49,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:49,476 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:49,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:49,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:39:49,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-10-01 23:39:49,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:49,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:39:49,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:39:49,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:39:49,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:39:49,701 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand 29 states. [2019-10-01 23:39:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:50,054 INFO L93 Difference]: Finished difference Result 278 states and 366 transitions. [2019-10-01 23:39:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:39:50,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 165 [2019-10-01 23:39:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:50,058 INFO L225 Difference]: With dead ends: 278 [2019-10-01 23:39:50,059 INFO L226 Difference]: Without dead ends: 185 [2019-10-01 23:39:50,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:39:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-01 23:39:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2019-10-01 23:39:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 23:39:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2019-10-01 23:39:50,069 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 165 [2019-10-01 23:39:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:50,069 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2019-10-01 23:39:50,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:39:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2019-10-01 23:39:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-01 23:39:50,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:50,072 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:50,072 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:50,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash -212677372, now seen corresponding path program 26 times [2019-10-01 23:39:50,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:50,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:50,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:50,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2019-10-01 23:39:50,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:50,641 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:50,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:39:50,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:39:50,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:50,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:39:50,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2019-10-01 23:39:50,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:50,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:39:50,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:39:50,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:39:50,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:39:50,884 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand 30 states. [2019-10-01 23:39:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:51,216 INFO L93 Difference]: Finished difference Result 287 states and 378 transitions. [2019-10-01 23:39:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:39:51,218 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 171 [2019-10-01 23:39:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:51,220 INFO L225 Difference]: With dead ends: 287 [2019-10-01 23:39:51,220 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 23:39:51,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:39:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 23:39:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2019-10-01 23:39:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 23:39:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 245 transitions. [2019-10-01 23:39:51,230 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 245 transitions. Word has length 171 [2019-10-01 23:39:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:51,231 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 245 transitions. [2019-10-01 23:39:51,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:39:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 245 transitions. [2019-10-01 23:39:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-01 23:39:51,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:51,233 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:51,234 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1741554134, now seen corresponding path program 27 times [2019-10-01 23:39:51,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:51,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:51,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:51,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-10-01 23:39:51,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:51,902 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:51,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2