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_minInArray_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:25:42,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:25:42,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:25:42,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:25:42,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:25:42,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:25:42,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:25:42,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:25:42,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:25:42,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:25:42,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:25:42,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:25:42,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:25:42,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:25:42,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:25:42,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:25:42,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:25:42,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:25:42,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:25:42,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:25:42,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:25:42,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:25:42,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:25:42,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:25:42,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:25:42,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:25:42,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:25:42,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:25:42,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:25:42,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:25:42,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:25:42,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:25:42,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:25:42,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:25:42,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:25:42,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:25:42,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:25:42,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:25:42,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:25:42,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:25:42,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:25:42,241 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:25:42,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:25:42,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:25:42,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:25:42,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:25:42,259 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:25:42,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:25:42,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:25:42,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:25:42,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:25:42,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:25:42,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:25:42,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:25:42,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:25:42,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:25:42,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:25:42,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:25:42,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:25:42,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:25:42,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:25:42,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:25:42,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:25:42,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:25:42,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:25:42,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:25:42,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:25:42,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:25:42,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:25:42,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:25:42,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:25:42,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:25:42,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:25:42,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:25:42,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:25:42,323 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:25:42,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i [2019-10-01 23:25:42,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30b7f6ae/0807194d206e4a478e83437f1b7a29c5/FLAG976ff7f27 [2019-10-01 23:25:42,853 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:25:42,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i [2019-10-01 23:25:42,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30b7f6ae/0807194d206e4a478e83437f1b7a29c5/FLAG976ff7f27 [2019-10-01 23:25:43,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30b7f6ae/0807194d206e4a478e83437f1b7a29c5 [2019-10-01 23:25:43,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:25:43,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:25:43,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:25:43,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:25:43,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:25:43,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f07d29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43, skipping insertion in model container [2019-10-01 23:25:43,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,248 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:25:43,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:25:43,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:25:43,545 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:25:43,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:25:43,588 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:25:43,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43 WrapperNode [2019-10-01 23:25:43,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:25:43,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:25:43,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:25:43,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:25:43,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (1/1) ... [2019-10-01 23:25:43,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:25:43,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:25:43,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:25:43,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:25:43,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (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:25:43,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:25:43,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:25:43,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:25:43,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:25:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:25:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:25:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:25:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:25:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:25:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:25:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:25:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:25:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:25:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:25:44,071 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:25:44,071 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:25:44,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:25:44 BoogieIcfgContainer [2019-10-01 23:25:44,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:25:44,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:25:44,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:25:44,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:25:44,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:25:43" (1/3) ... [2019-10-01 23:25:44,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3998d682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:25:44, skipping insertion in model container [2019-10-01 23:25:44,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:25:43" (2/3) ... [2019-10-01 23:25:44,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3998d682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:25:44, skipping insertion in model container [2019-10-01 23:25:44,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:25:44" (3/3) ... [2019-10-01 23:25:44,082 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_minInArray_ground-2.i [2019-10-01 23:25:44,107 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:25:44,133 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:25:44,179 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:25:44,218 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:25:44,225 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:25:44,225 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:25:44,225 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:25:44,225 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:25:44,226 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:25:44,226 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:25:44,226 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:25:44,228 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:25:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-01 23:25:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:25:44,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:44,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:44,267 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1241254978, now seen corresponding path program 1 times [2019-10-01 23:25:44,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:44,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:44,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:44,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:44,471 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:25:44,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:25:44,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:25:44,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:25:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:25:44,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:25:44,490 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-01 23:25:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:44,512 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-10-01 23:25:44,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:25:44,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:25:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:44,523 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:25:44,523 INFO L226 Difference]: Without dead ends: 23 [2019-10-01 23:25:44,527 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:25:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-01 23:25:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-01 23:25:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 23:25:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-01 23:25:44,570 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2019-10-01 23:25:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:44,571 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-01 23:25:44,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:25:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-01 23:25:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:25:44,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:44,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:44,572 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -159068691, now seen corresponding path program 1 times [2019-10-01 23:25:44,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:44,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:44,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:44,631 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:25:44,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:25:44,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:25:44,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:25:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:25:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:25:44,634 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-10-01 23:25:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:44,709 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-01 23:25:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:25:44,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:25:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:44,711 INFO L225 Difference]: With dead ends: 43 [2019-10-01 23:25:44,712 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 23:25:44,713 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:25:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 23:25:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-01 23:25:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-01 23:25:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-01 23:25:44,720 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2019-10-01 23:25:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:44,720 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-01 23:25:44,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:25:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-01 23:25:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:25:44,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:44,722 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] [2019-10-01 23:25:44,722 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash 99818017, now seen corresponding path program 1 times [2019-10-01 23:25:44,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:44,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:44,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:44,796 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:25:44,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:44,796 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:25:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:44,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:25:44,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:44,920 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:25:44,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:25:44,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:25:44,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:25:44,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:25:44,931 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-10-01 23:25:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:45,001 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-10-01 23:25:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:25:45,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-01 23:25:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:45,003 INFO L225 Difference]: With dead ends: 49 [2019-10-01 23:25:45,003 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:25:45,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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:25:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:25:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-01 23:25:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 23:25:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-01 23:25:45,011 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-10-01 23:25:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:45,011 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-01 23:25:45,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:25:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-01 23:25:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:25:45,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:45,013 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:45,013 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1510721175, now seen corresponding path program 2 times [2019-10-01 23:25:45,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:45,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:45,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:45,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:45,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 23:25:45,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:45,101 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:25:45,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:25:45,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:25:45,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:45,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:25:45,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:25:45,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:45,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:25:45,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:25:45,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:25:45,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:25:45,196 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2019-10-01 23:25:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:45,285 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-10-01 23:25:45,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:25:45,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-01 23:25:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:45,287 INFO L225 Difference]: With dead ends: 57 [2019-10-01 23:25:45,287 INFO L226 Difference]: Without dead ends: 38 [2019-10-01 23:25:45,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:25:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-01 23:25:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-10-01 23:25:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 23:25:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-10-01 23:25:45,304 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2019-10-01 23:25:45,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:45,305 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-01 23:25:45,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:25:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-10-01 23:25:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-01 23:25:45,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:45,308 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:45,309 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -235287899, now seen corresponding path program 3 times [2019-10-01 23:25:45,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:45,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:45,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:45,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 23:25:45,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:45,414 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) [2019-10-01 23:25:45,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:25:45,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:25:45,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:45,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:25:45,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:45,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:25:45,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:25:45,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:25:45,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:25:45,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:25:45,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:25:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 23:25:45,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:45,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2019-10-01 23:25:45,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:25:45,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:25:45,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:25:45,704 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 14 states. [2019-10-01 23:25:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:46,120 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2019-10-01 23:25:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:25:46,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-10-01 23:25:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:46,130 INFO L225 Difference]: With dead ends: 88 [2019-10-01 23:25:46,130 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 23:25:46,133 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:25:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 23:25:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2019-10-01 23:25:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 23:25:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-10-01 23:25:46,163 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 30 [2019-10-01 23:25:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:46,164 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-10-01 23:25:46,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:25:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-10-01 23:25:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 23:25:46,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:46,165 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:46,166 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1110475037, now seen corresponding path program 1 times [2019-10-01 23:25:46,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:46,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:46,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 23:25:46,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:46,324 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:25:46,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:25:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:46,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:25:46,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:25:46,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:46,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:25:46,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:25:46,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:25:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:25:46,426 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 8 states. [2019-10-01 23:25:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:46,525 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2019-10-01 23:25:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:25:46,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-10-01 23:25:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:46,528 INFO L225 Difference]: With dead ends: 108 [2019-10-01 23:25:46,529 INFO L226 Difference]: Without dead ends: 68 [2019-10-01 23:25:46,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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:25:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-01 23:25:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-10-01 23:25:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 23:25:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-10-01 23:25:46,540 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 35 [2019-10-01 23:25:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:46,540 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-10-01 23:25:46,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:25:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-10-01 23:25:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 23:25:46,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:46,542 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:46,542 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash -194968281, now seen corresponding path program 2 times [2019-10-01 23:25:46,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:46,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:46,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:46,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-01 23:25:46,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:46,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:25:46,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:25:46,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:25:46,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:46,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:25:46,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-01 23:25:46,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:46,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:25:46,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:25:46,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:25:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:25:46,760 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 9 states. [2019-10-01 23:25:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:46,858 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2019-10-01 23:25:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:25:46,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-10-01 23:25:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:46,860 INFO L225 Difference]: With dead ends: 122 [2019-10-01 23:25:46,861 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 23:25:46,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 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:25:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 23:25:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2019-10-01 23:25:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 23:25:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-10-01 23:25:46,872 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 40 [2019-10-01 23:25:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:46,873 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-10-01 23:25:46,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:25:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-10-01 23:25:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 23:25:46,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:46,875 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:46,875 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1343481249, now seen corresponding path program 3 times [2019-10-01 23:25:46,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:46,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:46,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:46,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:46,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-01 23:25:47,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:47,033 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:25:47,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:25:47,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:25:47,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:47,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:25:47,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:47,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:25:47,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:25:47,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:25:47,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:25:47,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:25:47,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:25:47,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:25:47,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:25:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:25:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:47,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-10-01 23:25:47,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:25:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:25:47,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:25:47,329 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 19 states. [2019-10-01 23:25:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:48,548 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2019-10-01 23:25:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:25:48,549 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-10-01 23:25:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:48,550 INFO L225 Difference]: With dead ends: 148 [2019-10-01 23:25:48,553 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 23:25:48,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=609, Invalid=2147, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:25:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 23:25:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 61. [2019-10-01 23:25:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 23:25:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-10-01 23:25:48,571 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 45 [2019-10-01 23:25:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:48,571 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-10-01 23:25:48,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:25:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-10-01 23:25:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-01 23:25:48,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:48,573 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:48,573 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1086899484, now seen corresponding path program 1 times [2019-10-01 23:25:48,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:48,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:48,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:48,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-01 23:25:48,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:48,689 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:25:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:48,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:25:48,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream Closed [2019-10-01 23:25:48,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:48,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:25:48,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:25:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:25:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:25:48,785 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 11 states. [2019-10-01 23:25:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:48,874 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2019-10-01 23:25:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:25:48,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-10-01 23:25:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:48,876 INFO L225 Difference]: With dead ends: 109 [2019-10-01 23:25:48,877 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 23:25:48,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 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:25:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 23:25:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-10-01 23:25:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 23:25:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-10-01 23:25:48,891 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 58 [2019-10-01 23:25:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:48,891 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-10-01 23:25:48,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:25:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-10-01 23:25:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 23:25:48,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:48,893 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:48,893 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -957205740, now seen corresponding path program 2 times [2019-10-01 23:25:48,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:48,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:48,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:48,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:48,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-01 23:25:49,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:49,046 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:25:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:25:49,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:25:49,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:49,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:25:49,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:25:49,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:49,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:25:49,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:25:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:25:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:25:49,136 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 12 states. [2019-10-01 23:25:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:49,234 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2019-10-01 23:25:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:25:49,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-10-01 23:25:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:49,238 INFO L225 Difference]: With dead ends: 117 [2019-10-01 23:25:49,238 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 23:25:49,239 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:25:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 23:25:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-10-01 23:25:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 23:25:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-10-01 23:25:49,248 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 63 [2019-10-01 23:25:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:49,248 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-10-01 23:25:49,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:25:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-10-01 23:25:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 23:25:49,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:49,250 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:49,250 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash 995106664, now seen corresponding path program 3 times [2019-10-01 23:25:49,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:49,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:49,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-01 23:25:49,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:49,363 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:25:49,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:25:49,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:25:49,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:49,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:25:49,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:49,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:25:49,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:25:49,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:25:49,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:25:49,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:25:49,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:25:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 23:25:49,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:49,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2019-10-01 23:25:49,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:25:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:25:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:25:49,650 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 24 states. [2019-10-01 23:25:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:50,478 INFO L93 Difference]: Finished difference Result 167 states and 205 transitions. [2019-10-01 23:25:50,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:25:50,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 68 [2019-10-01 23:25:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:50,480 INFO L225 Difference]: With dead ends: 167 [2019-10-01 23:25:50,480 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 23:25:50,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:25:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 23:25:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2019-10-01 23:25:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 23:25:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2019-10-01 23:25:50,496 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 68 [2019-10-01 23:25:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:50,497 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2019-10-01 23:25:50,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:25:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2019-10-01 23:25:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 23:25:50,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:50,500 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:50,500 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1767766386, now seen corresponding path program 1 times [2019-10-01 23:25:50,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:50,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:50,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-01 23:25:50,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:50,626 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:25:50,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:50,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:25:50,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 149 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:25:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:50,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:25:50,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:25:50,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:25:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:25:50,749 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 14 states. [2019-10-01 23:25:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:50,917 INFO L93 Difference]: Finished difference Result 206 states and 254 transitions. [2019-10-01 23:25:50,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:25:50,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-10-01 23:25:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:50,920 INFO L225 Difference]: With dead ends: 206 [2019-10-01 23:25:50,920 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 23:25:50,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 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:25:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 23:25:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2019-10-01 23:25:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-01 23:25:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-10-01 23:25:50,932 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 73 [2019-10-01 23:25:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:50,932 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-10-01 23:25:50,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:25:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2019-10-01 23:25:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-01 23:25:50,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:50,934 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:50,935 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1854631914, now seen corresponding path program 2 times [2019-10-01 23:25:50,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:50,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:50,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:50,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-10-01 23:25:51,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:51,108 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:51,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:25:51,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:25:51,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:51,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:25:51,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-01 23:25:51,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:51,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:25:51,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:25:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:25:51,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:25:51,201 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand 15 states. [2019-10-01 23:25:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:51,330 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2019-10-01 23:25:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:25:51,331 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2019-10-01 23:25:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:51,332 INFO L225 Difference]: With dead ends: 220 [2019-10-01 23:25:51,332 INFO L226 Difference]: Without dead ends: 131 [2019-10-01 23:25:51,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:25:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-01 23:25:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2019-10-01 23:25:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 23:25:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2019-10-01 23:25:51,344 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 78 [2019-10-01 23:25:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:51,345 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2019-10-01 23:25:51,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:25:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2019-10-01 23:25:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 23:25:51,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:51,347 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:51,347 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2005840374, now seen corresponding path program 3 times [2019-10-01 23:25:51,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:51,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:51,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 2 proven. 144 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-10-01 23:25:51,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:51,521 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:25:51,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:25:51,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:25:51,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:51,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:25:51,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:51,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:25:51,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:25:51,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:25:51,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:25:51,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:25:51,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:25:51,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:25:51,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:25:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-10-01 23:25:51,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:52,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2019-10-01 23:25:52,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:25:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:25:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:25:52,001 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 30 states. [2019-10-01 23:25:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:54,360 INFO L93 Difference]: Finished difference Result 258 states and 314 transitions. [2019-10-01 23:25:54,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 23:25:54,361 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 83 [2019-10-01 23:25:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:54,364 INFO L225 Difference]: With dead ends: 258 [2019-10-01 23:25:54,364 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 23:25:54,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2549 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1714, Invalid=6476, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 23:25:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 23:25:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 99. [2019-10-01 23:25:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 23:25:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2019-10-01 23:25:54,374 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 83 [2019-10-01 23:25:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:54,375 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2019-10-01 23:25:54,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:25:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2019-10-01 23:25:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 23:25:54,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:54,377 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:54,377 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash 343721127, now seen corresponding path program 4 times [2019-10-01 23:25:54,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:54,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:54,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:54,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:54,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-01 23:25:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:54,567 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:25:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:25:54,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:25:54,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:54,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:25:54,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-10-01 23:25:54,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:54,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:25:54,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:25:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:25:54,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:25:54,739 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 17 states. [2019-10-01 23:25:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:54,895 INFO L93 Difference]: Finished difference Result 173 states and 206 transitions. [2019-10-01 23:25:54,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:25:54,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 23:25:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:54,897 INFO L225 Difference]: With dead ends: 173 [2019-10-01 23:25:54,897 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 23:25:54,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 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:25:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 23:25:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-10-01 23:25:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 23:25:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-10-01 23:25:54,905 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 96 [2019-10-01 23:25:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:54,906 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-10-01 23:25:54,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:25:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-10-01 23:25:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 23:25:54,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:54,907 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:54,907 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1246669377, now seen corresponding path program 5 times [2019-10-01 23:25:54,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:54,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:54,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:54,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:54,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 4 proven. 196 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-10-01 23:25:55,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:55,104 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:25:55,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:25:55,287 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 23:25:55,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:55,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:25:55,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-10-01 23:25:55,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:55,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:25:55,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:25:55,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:25:55,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:25:55,316 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 18 states. [2019-10-01 23:25:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:55,448 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2019-10-01 23:25:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:25:55,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 101 [2019-10-01 23:25:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:55,450 INFO L225 Difference]: With dead ends: 181 [2019-10-01 23:25:55,450 INFO L226 Difference]: Without dead ends: 112 [2019-10-01 23:25:55,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 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:25:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-01 23:25:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2019-10-01 23:25:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 23:25:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-10-01 23:25:55,459 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 101 [2019-10-01 23:25:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:55,460 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-10-01 23:25:55,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:25:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-10-01 23:25:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 23:25:55,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:55,461 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:55,461 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1730536149, now seen corresponding path program 6 times [2019-10-01 23:25:55,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:55,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:55,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:55,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 4 proven. 225 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-01 23:25:55,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:55,660 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:25:55,690 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:25:56,017 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 23:25:56,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:56,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:25:56,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-10-01 23:25:56,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:25:56,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:25:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:25:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:25:56,070 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 19 states. [2019-10-01 23:25:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:56,200 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2019-10-01 23:25:56,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:25:56,200 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2019-10-01 23:25:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:56,201 INFO L225 Difference]: With dead ends: 189 [2019-10-01 23:25:56,202 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 23:25:56,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 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:25:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 23:25:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-10-01 23:25:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 23:25:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2019-10-01 23:25:56,211 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 106 [2019-10-01 23:25:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:56,211 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2019-10-01 23:25:56,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:25:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2019-10-01 23:25:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-01 23:25:56,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:56,213 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:56,213 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1419636421, now seen corresponding path program 7 times [2019-10-01 23:25:56,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:56,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:56,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:56,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:56,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 4 proven. 256 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-10-01 23:25:56,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:56,397 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:25:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:56,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:25:56,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:25:56,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:56,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:25:56,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:25:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:25:56,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:25:56,511 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 20 states. [2019-10-01 23:25:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:56,663 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2019-10-01 23:25:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:25:56,664 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-10-01 23:25:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:56,665 INFO L225 Difference]: With dead ends: 197 [2019-10-01 23:25:56,665 INFO L226 Difference]: Without dead ends: 122 [2019-10-01 23:25:56,666 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:25:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-01 23:25:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-10-01 23:25:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 23:25:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2019-10-01 23:25:56,675 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 111 [2019-10-01 23:25:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:56,675 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-10-01 23:25:56,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:25:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2019-10-01 23:25:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-01 23:25:56,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:56,677 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:56,677 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash 263871919, now seen corresponding path program 8 times [2019-10-01 23:25:56,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:56,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:56,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:56,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 4 proven. 289 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2019-10-01 23:25:56,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:56,903 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:25:56,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:25:56,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:25:56,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:56,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:25:56,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-01 23:25:57,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:57,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:25:57,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:25:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:25:57,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:25:57,021 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 21 states. [2019-10-01 23:25:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:57,250 INFO L93 Difference]: Finished difference Result 205 states and 246 transitions. [2019-10-01 23:25:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:25:57,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 116 [2019-10-01 23:25:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:57,251 INFO L225 Difference]: With dead ends: 205 [2019-10-01 23:25:57,251 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 23:25:57,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 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:25:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 23:25:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-10-01 23:25:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 23:25:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2019-10-01 23:25:57,261 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 116 [2019-10-01 23:25:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:57,261 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2019-10-01 23:25:57,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:25:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2019-10-01 23:25:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-01 23:25:57,262 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:57,263 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:57,263 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1047643319, now seen corresponding path program 9 times [2019-10-01 23:25:57,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:57,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:57,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 4 proven. 324 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2019-10-01 23:25:57,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:57,503 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:25:57,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:25:57,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:25:57,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:57,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:25:57,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:57,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:25:57,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:25:57,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:25:57,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:25:57,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:25:57,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:25:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 6 proven. 141 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-10-01 23:25:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 35 [2019-10-01 23:25:58,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:25:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:25:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:25:58,061 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand 35 states. [2019-10-01 23:25:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:59,920 INFO L93 Difference]: Finished difference Result 283 states and 348 transitions. [2019-10-01 23:25:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 23:25:59,921 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 121 [2019-10-01 23:25:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:59,923 INFO L225 Difference]: With dead ends: 283 [2019-10-01 23:25:59,923 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 23:25:59,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1249, Invalid=4451, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 23:25:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 23:25:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2019-10-01 23:25:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 23:25:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 230 transitions. [2019-10-01 23:25:59,943 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 230 transitions. Word has length 121 [2019-10-01 23:25:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:59,943 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 230 transitions. [2019-10-01 23:25:59,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:25:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 230 transitions. [2019-10-01 23:25:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 23:25:59,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:59,945 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:59,945 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash -688313295, now seen corresponding path program 4 times [2019-10-01 23:25:59,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:59,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:59,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 4 proven. 361 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-01 23:26:00,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:00,218 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:26:00,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:00,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:00,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:00,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:26:00,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2019-10-01 23:26:00,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:00,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:26:00,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:26:00,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:26:00,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:26:00,367 INFO L87 Difference]: Start difference. First operand 191 states and 230 transitions. Second operand 23 states. [2019-10-01 23:26:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:00,573 INFO L93 Difference]: Finished difference Result 350 states and 434 transitions. [2019-10-01 23:26:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:26:00,574 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 126 [2019-10-01 23:26:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:00,575 INFO L225 Difference]: With dead ends: 350 [2019-10-01 23:26:00,576 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 23:26:00,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:26:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 23:26:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2019-10-01 23:26:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 23:26:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 240 transitions. [2019-10-01 23:26:00,590 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 240 transitions. Word has length 126 [2019-10-01 23:26:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:00,590 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 240 transitions. [2019-10-01 23:26:00,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:26:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 240 transitions. [2019-10-01 23:26:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 23:26:00,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:00,592 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:00,592 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:00,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash 868455985, now seen corresponding path program 5 times [2019-10-01 23:26:00,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:00,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 4 proven. 400 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2019-10-01 23:26:00,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:00,856 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:26:00,899 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:26:01,482 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-01 23:26:01,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:01,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:26:01,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-10-01 23:26:01,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:01,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:26:01,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:26:01,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:26:01,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:26:01,535 INFO L87 Difference]: Start difference. First operand 199 states and 240 transitions. Second operand 24 states. [2019-10-01 23:26:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:01,703 INFO L93 Difference]: Finished difference Result 364 states and 452 transitions. [2019-10-01 23:26:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:26:01,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 131 [2019-10-01 23:26:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:01,705 INFO L225 Difference]: With dead ends: 364 [2019-10-01 23:26:01,705 INFO L226 Difference]: Without dead ends: 212 [2019-10-01 23:26:01,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 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:26:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-01 23:26:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2019-10-01 23:26:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-01 23:26:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2019-10-01 23:26:01,721 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 131 [2019-10-01 23:26:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:01,721 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2019-10-01 23:26:01,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:26:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2019-10-01 23:26:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-01 23:26:01,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:01,723 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:01,723 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -7078731, now seen corresponding path program 6 times [2019-10-01 23:26:01,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:01,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:01,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 4 proven. 441 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-10-01 23:26:02,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:02,075 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:26:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:26:02,398 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-01 23:26:02,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:02,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:26:02,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:02,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:02,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:26:02,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:02,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:02,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:02,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:02,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:26:03,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 56 proven. 168 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:03,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:03,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2019-10-01 23:26:03,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:26:03,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:26:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1243, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:26:03,176 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand 41 states. [2019-10-01 23:26:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:08,313 INFO L93 Difference]: Finished difference Result 406 states and 497 transitions. [2019-10-01 23:26:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-10-01 23:26:08,314 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 136 [2019-10-01 23:26:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:08,317 INFO L225 Difference]: With dead ends: 406 [2019-10-01 23:26:08,317 INFO L226 Difference]: Without dead ends: 248 [2019-10-01 23:26:08,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6898 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4483, Invalid=15539, Unknown=0, NotChecked=0, Total=20022 [2019-10-01 23:26:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-01 23:26:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 152. [2019-10-01 23:26:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-01 23:26:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2019-10-01 23:26:08,335 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 136 [2019-10-01 23:26:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:08,335 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2019-10-01 23:26:08,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:26:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2019-10-01 23:26:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-01 23:26:08,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:08,336 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:08,337 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -74610458, now seen corresponding path program 10 times [2019-10-01 23:26:08,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:08,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:08,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:08,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 6 proven. 484 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-01 23:26:08,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:08,698 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:26:08,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:08,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:08,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:08,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:26:08,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2019-10-01 23:26:08,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:08,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:26:08,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:26:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:26:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:26:08,887 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 26 states. [2019-10-01 23:26:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:09,271 INFO L93 Difference]: Finished difference Result 261 states and 312 transitions. [2019-10-01 23:26:09,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:26:09,272 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 149 [2019-10-01 23:26:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:09,274 INFO L225 Difference]: With dead ends: 261 [2019-10-01 23:26:09,274 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 23:26:09,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:26:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 23:26:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-10-01 23:26:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 23:26:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-10-01 23:26:09,293 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 149 [2019-10-01 23:26:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:09,293 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-10-01 23:26:09,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:26:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-10-01 23:26:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-01 23:26:09,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:09,296 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:09,296 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1658402930, now seen corresponding path program 11 times [2019-10-01 23:26:09,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:09,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:09,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-10-01 23:26:09,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:09,795 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:26:09,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:26:11,061 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 23:26:11,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:11,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:26:11,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2019-10-01 23:26:11,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:11,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:26:11,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:26:11,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:26:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:26:11,103 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 27 states. [2019-10-01 23:26:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:11,323 INFO L93 Difference]: Finished difference Result 269 states and 322 transitions. [2019-10-01 23:26:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:26:11,325 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2019-10-01 23:26:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:11,326 INFO L225 Difference]: With dead ends: 269 [2019-10-01 23:26:11,326 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 23:26:11,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 154 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:26:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 23:26:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-10-01 23:26:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 23:26:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2019-10-01 23:26:11,338 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 154 [2019-10-01 23:26:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:11,338 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2019-10-01 23:26:11,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:26:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2019-10-01 23:26:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-01 23:26:11,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:11,339 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:11,340 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1479239778, now seen corresponding path program 12 times [2019-10-01 23:26:11,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:11,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:11,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:11,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:11,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 6 proven. 576 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-10-01 23:26:11,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:11,793 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:26:11,859 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:26:12,829 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 23:26:12,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:12,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:26:12,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:13,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:26:13,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:13,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:13,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:13,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:26:13,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 11 proven. 261 refuted. 0 times theorem prover too weak. 1192 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:26:13,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:13,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2019-10-01 23:26:13,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 23:26:13,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 23:26:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=1314, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:26:13,217 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand 43 states. [2019-10-01 23:26:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:15,495 INFO L93 Difference]: Finished difference Result 366 states and 449 transitions. [2019-10-01 23:26:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 23:26:15,496 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 159 [2019-10-01 23:26:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:15,497 INFO L225 Difference]: With dead ends: 366 [2019-10-01 23:26:15,498 INFO L226 Difference]: Without dead ends: 259 [2019-10-01 23:26:15,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2006, Invalid=6924, Unknown=0, NotChecked=0, Total=8930 [2019-10-01 23:26:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-01 23:26:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 248. [2019-10-01 23:26:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-01 23:26:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 299 transitions. [2019-10-01 23:26:15,520 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 299 transitions. Word has length 159 [2019-10-01 23:26:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:15,521 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 299 transitions. [2019-10-01 23:26:15,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 23:26:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 299 transitions. [2019-10-01 23:26:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-01 23:26:15,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:15,523 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:15,523 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:15,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash 895048948, now seen corresponding path program 7 times [2019-10-01 23:26:15,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:15,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:15,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:15,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 6 proven. 625 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2019-10-01 23:26:15,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:15,996 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:26:16,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:16,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:26:16,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-10-01 23:26:16,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:16,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:26:16,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:26:16,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:26:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:26:16,150 INFO L87 Difference]: Start difference. First operand 248 states and 299 transitions. Second operand 29 states. [2019-10-01 23:26:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:16,477 INFO L93 Difference]: Finished difference Result 452 states and 560 transitions. [2019-10-01 23:26:16,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:26:16,478 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 164 [2019-10-01 23:26:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:16,480 INFO L225 Difference]: With dead ends: 452 [2019-10-01 23:26:16,481 INFO L226 Difference]: Without dead ends: 261 [2019-10-01 23:26:16,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:26:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-01 23:26:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 256. [2019-10-01 23:26:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-01 23:26:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2019-10-01 23:26:16,511 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 164 [2019-10-01 23:26:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:16,511 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2019-10-01 23:26:16,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:26:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2019-10-01 23:26:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-01 23:26:16,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:16,514 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:16,514 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1645201372, now seen corresponding path program 8 times [2019-10-01 23:26:16,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:16,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:16,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 6 proven. 676 refuted. 0 times theorem prover too weak. 1031 trivial. 0 not checked. [2019-10-01 23:26:16,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:16,996 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:26:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:17,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:17,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:17,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:26:17,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:17,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:17,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:26:17,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:26:17,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:26:17,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:26:17,175 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand 30 states. [2019-10-01 23:26:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:17,439 INFO L93 Difference]: Finished difference Result 466 states and 578 transitions. [2019-10-01 23:26:17,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:26:17,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 169 [2019-10-01 23:26:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:17,441 INFO L225 Difference]: With dead ends: 466 [2019-10-01 23:26:17,441 INFO L226 Difference]: Without dead ends: 269 [2019-10-01 23:26:17,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:26:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-01 23:26:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 264. [2019-10-01 23:26:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-01 23:26:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 319 transitions. [2019-10-01 23:26:17,461 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 319 transitions. Word has length 169 [2019-10-01 23:26:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:17,461 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 319 transitions. [2019-10-01 23:26:17,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:26:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 319 transitions. [2019-10-01 23:26:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 23:26:17,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:17,463 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:17,463 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 579936632, now seen corresponding path program 9 times [2019-10-01 23:26:17,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:17,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:17,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:17,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1845 backedges. 6 proven. 729 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2019-10-01 23:26:17,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:17,894 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:17,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:18,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:26:18,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:18,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:26:18,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:18,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:18,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:26:18,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:18,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:18,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:18,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:18,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:26:18,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1845 backedges. 74 proven. 299 refuted. 0 times theorem prover too weak. 1472 trivial. 0 not checked. [2019-10-01 23:26:18,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:18,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21] total 49 [2019-10-01 23:26:18,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:26:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:26:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=1744, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:26:18,863 INFO L87 Difference]: Start difference. First operand 264 states and 319 transitions. Second operand 49 states. [2019-10-01 23:26:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:25,048 INFO L93 Difference]: Finished difference Result 512 states and 626 transitions. [2019-10-01 23:26:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-10-01 23:26:25,048 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 174 [2019-10-01 23:26:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:25,050 INFO L225 Difference]: With dead ends: 512 [2019-10-01 23:26:25,050 INFO L226 Difference]: Without dead ends: 309 [2019-10-01 23:26:25,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 151 SyntacticMatches, 5 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10861 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6923, Invalid=23527, Unknown=0, NotChecked=0, Total=30450 [2019-10-01 23:26:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-01 23:26:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 190. [2019-10-01 23:26:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-01 23:26:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2019-10-01 23:26:25,067 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 174 [2019-10-01 23:26:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:25,067 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2019-10-01 23:26:25,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:26:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2019-10-01 23:26:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-01 23:26:25,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:25,069 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:25,069 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1600678289, now seen corresponding path program 13 times [2019-10-01 23:26:25,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:25,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:25,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:25,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:25,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 8 proven. 784 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2019-10-01 23:26:25,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:25,488 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:25,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:25,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:26:25,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2019-10-01 23:26:25,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:25,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:26:25,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:26:25,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:26:25,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:26:25,701 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand 32 states. [2019-10-01 23:26:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:25,982 INFO L93 Difference]: Finished difference Result 325 states and 388 transitions. [2019-10-01 23:26:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:26:25,984 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 187 [2019-10-01 23:26:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:25,986 INFO L225 Difference]: With dead ends: 325 [2019-10-01 23:26:25,986 INFO L226 Difference]: Without dead ends: 198 [2019-10-01 23:26:25,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:26:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-01 23:26:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2019-10-01 23:26:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 23:26:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 226 transitions. [2019-10-01 23:26:26,000 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 226 transitions. Word has length 187 [2019-10-01 23:26:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:26,000 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 226 transitions. [2019-10-01 23:26:26,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:26:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 226 transitions. [2019-10-01 23:26:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 23:26:26,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:26,002 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:26,002 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash 664370229, now seen corresponding path program 14 times [2019-10-01 23:26:26,003 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:26,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:26,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 8 proven. 841 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-10-01 23:26:26,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:26,452 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:26,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:26,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:26,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:26,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:26:26,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-10-01 23:26:26,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:26,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:26:26,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:26:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:26:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:26:26,637 INFO L87 Difference]: Start difference. First operand 195 states and 226 transitions. Second operand 33 states. [2019-10-01 23:26:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:26,899 INFO L93 Difference]: Finished difference Result 333 states and 398 transitions. [2019-10-01 23:26:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:26:26,900 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 192 [2019-10-01 23:26:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:26,901 INFO L225 Difference]: With dead ends: 333 [2019-10-01 23:26:26,901 INFO L226 Difference]: Without dead ends: 203 [2019-10-01 23:26:26,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:26:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-01 23:26:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2019-10-01 23:26:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-01 23:26:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 232 transitions. [2019-10-01 23:26:26,915 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 232 transitions. Word has length 192 [2019-10-01 23:26:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:26,915 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 232 transitions. [2019-10-01 23:26:26,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:26:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 232 transitions. [2019-10-01 23:26:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-01 23:26:26,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:26,917 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:26,917 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1889678605, now seen corresponding path program 15 times [2019-10-01 23:26:26,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:26,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:26,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 8 proven. 900 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2019-10-01 23:26:27,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:27,389 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:27,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:27,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:26:27,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:27,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:26:27,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:28,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:26:28,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:28,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:28,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:28,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:26:28,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 16 proven. 418 refuted. 0 times theorem prover too weak. 1865 trivial. 0 not checked. [2019-10-01 23:26:28,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:28,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20] total 51 [2019-10-01 23:26:28,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 23:26:28,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 23:26:28,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=1823, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:26:28,225 INFO L87 Difference]: Start difference. First operand 200 states and 232 transitions. Second operand 51 states. [2019-10-01 23:26:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:31,322 INFO L93 Difference]: Finished difference Result 449 states and 550 transitions. [2019-10-01 23:26:31,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 23:26:31,322 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 197 [2019-10-01 23:26:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:31,325 INFO L225 Difference]: With dead ends: 449 [2019-10-01 23:26:31,325 INFO L226 Difference]: Without dead ends: 316 [2019-10-01 23:26:31,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3180 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2945, Invalid=9937, Unknown=0, NotChecked=0, Total=12882 [2019-10-01 23:26:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-10-01 23:26:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2019-10-01 23:26:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-01 23:26:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 368 transitions. [2019-10-01 23:26:31,353 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 368 transitions. Word has length 197 [2019-10-01 23:26:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:31,354 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 368 transitions. [2019-10-01 23:26:31,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 23:26:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 368 transitions. [2019-10-01 23:26:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 23:26:31,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:31,356 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:31,356 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:31,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:31,357 INFO L82 PathProgramCache]: Analyzing trace with hash 449525431, now seen corresponding path program 10 times [2019-10-01 23:26:31,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:31,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:31,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:31,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:31,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 8 proven. 961 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-10-01 23:26:31,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:31,912 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:32,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:32,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:32,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:26:32,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:32,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:32,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:26:32,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:26:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:26:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:26:32,113 INFO L87 Difference]: Start difference. First operand 305 states and 368 transitions. Second operand 35 states. [2019-10-01 23:26:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:32,434 INFO L93 Difference]: Finished difference Result 554 states and 686 transitions. [2019-10-01 23:26:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:26:32,435 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2019-10-01 23:26:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:32,437 INFO L225 Difference]: With dead ends: 554 [2019-10-01 23:26:32,437 INFO L226 Difference]: Without dead ends: 318 [2019-10-01 23:26:32,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:26:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-01 23:26:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2019-10-01 23:26:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-01 23:26:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 378 transitions. [2019-10-01 23:26:32,463 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 378 transitions. Word has length 202 [2019-10-01 23:26:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:32,463 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 378 transitions. [2019-10-01 23:26:32,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:26:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 378 transitions. [2019-10-01 23:26:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-01 23:26:32,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:32,466 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:32,466 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash -513482105, now seen corresponding path program 11 times [2019-10-01 23:26:32,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:32,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:32,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:32,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 8 proven. 1024 refuted. 0 times theorem prover too weak. 1576 trivial. 0 not checked. [2019-10-01 23:26:33,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:33,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:33,159 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:26:38,608 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 23:26:38,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:38,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:26:38,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2019-10-01 23:26:38,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:38,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:26:38,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:26:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:26:38,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:26:38,688 INFO L87 Difference]: Start difference. First operand 313 states and 378 transitions. Second operand 36 states. [2019-10-01 23:26:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:38,966 INFO L93 Difference]: Finished difference Result 568 states and 704 transitions. [2019-10-01 23:26:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:26:38,967 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2019-10-01 23:26:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:38,970 INFO L225 Difference]: With dead ends: 568 [2019-10-01 23:26:38,970 INFO L226 Difference]: Without dead ends: 326 [2019-10-01 23:26:38,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:26:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-01 23:26:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2019-10-01 23:26:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-01 23:26:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 388 transitions. [2019-10-01 23:26:38,996 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 388 transitions. Word has length 207 [2019-10-01 23:26:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:38,996 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 388 transitions. [2019-10-01 23:26:38,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:26:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 388 transitions. [2019-10-01 23:26:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 23:26:38,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:38,998 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:38,999 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1395511493, now seen corresponding path program 12 times [2019-10-01 23:26:38,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:38,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:39,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:39,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2770 backedges. 8 proven. 1089 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2019-10-01 23:26:39,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:39,551 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:26:41,586 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 23:26:41,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:41,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:26:41,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:42,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:42,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:26:42,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:42,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:42,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:42,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:42,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:26:42,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2770 backedges. 92 proven. 467 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-10-01 23:26:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 23] total 57 [2019-10-01 23:26:42,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 23:26:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 23:26:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=2326, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:26:42,611 INFO L87 Difference]: Start difference. First operand 321 states and 388 transitions. Second operand 57 states. [2019-10-01 23:26:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:50,591 INFO L93 Difference]: Finished difference Result 618 states and 755 transitions. [2019-10-01 23:26:50,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-10-01 23:26:50,591 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 212 [2019-10-01 23:26:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:50,594 INFO L225 Difference]: With dead ends: 618 [2019-10-01 23:26:50,594 INFO L226 Difference]: Without dead ends: 370 [2019-10-01 23:26:50,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 185 SyntacticMatches, 7 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15722 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9895, Invalid=33161, Unknown=0, NotChecked=0, Total=43056 [2019-10-01 23:26:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-01 23:26:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 228. [2019-10-01 23:26:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-01 23:26:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 264 transitions. [2019-10-01 23:26:50,614 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 264 transitions. Word has length 212 [2019-10-01 23:26:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:50,615 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 264 transitions. [2019-10-01 23:26:50,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 23:26:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 264 transitions. [2019-10-01 23:26:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-01 23:26:50,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:50,616 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:50,617 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1038283580, now seen corresponding path program 16 times [2019-10-01 23:26:50,617 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:50,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:50,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2973 backedges. 10 proven. 1156 refuted. 0 times theorem prover too weak. 1807 trivial. 0 not checked. [2019-10-01 23:26:51,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:51,353 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:51,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:51,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:51,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:26:51,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2973 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1817 trivial. 0 not checked. [2019-10-01 23:26:51,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:51,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:26:51,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:26:51,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:26:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:26:51,588 INFO L87 Difference]: Start difference. First operand 228 states and 264 transitions. Second operand 38 states. [2019-10-01 23:26:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:51,944 INFO L93 Difference]: Finished difference Result 389 states and 464 transitions. [2019-10-01 23:26:51,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:26:51,944 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 225 [2019-10-01 23:26:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:51,946 INFO L225 Difference]: With dead ends: 389 [2019-10-01 23:26:51,946 INFO L226 Difference]: Without dead ends: 236 [2019-10-01 23:26:51,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:26:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-01 23:26:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2019-10-01 23:26:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 23:26:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2019-10-01 23:26:51,962 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 225 [2019-10-01 23:26:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:51,963 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2019-10-01 23:26:51,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:26:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2019-10-01 23:26:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 23:26:51,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:51,964 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:51,964 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:51,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:51,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1604785928, now seen corresponding path program 17 times [2019-10-01 23:26:51,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:51,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:51,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3145 backedges. 10 proven. 1225 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-10-01 23:26:52,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:52,655 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:52,734 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:27:00,041 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 23:27:00,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:00,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:27:00,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3145 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:27:00,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:00,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:27:00,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:27:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:27:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:27:00,118 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand 39 states. [2019-10-01 23:27:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:00,454 INFO L93 Difference]: Finished difference Result 397 states and 474 transitions. [2019-10-01 23:27:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:27:00,454 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 230 [2019-10-01 23:27:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:00,456 INFO L225 Difference]: With dead ends: 397 [2019-10-01 23:27:00,456 INFO L226 Difference]: Without dead ends: 241 [2019-10-01 23:27:00,456 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:27:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-01 23:27:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-10-01 23:27:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 23:27:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 276 transitions. [2019-10-01 23:27:00,468 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 276 transitions. Word has length 230 [2019-10-01 23:27:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:00,469 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 276 transitions. [2019-10-01 23:27:00,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:27:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 276 transitions. [2019-10-01 23:27:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-01 23:27:00,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:00,470 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:00,471 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash -309957960, now seen corresponding path program 18 times [2019-10-01 23:27:00,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:00,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:00,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:00,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 10 proven. 1296 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-10-01 23:27:01,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:01,294 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:01,379 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:27:10,097 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 23:27:10,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:10,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:27:10,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:10,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:27:10,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:10,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:10,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:10,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:27:10,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 21 proven. 612 refuted. 0 times theorem prover too weak. 2689 trivial. 0 not checked. [2019-10-01 23:27:10,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:10,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 22] total 59 [2019-10-01 23:27:10,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 23:27:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 23:27:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1009, Invalid=2413, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:27:10,682 INFO L87 Difference]: Start difference. First operand 238 states and 276 transitions. Second operand 59 states. [2019-10-01 23:27:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:14,714 INFO L93 Difference]: Finished difference Result 532 states and 651 transitions. [2019-10-01 23:27:14,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-10-01 23:27:14,714 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 235 [2019-10-01 23:27:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:14,717 INFO L225 Difference]: With dead ends: 532 [2019-10-01 23:27:14,717 INFO L226 Difference]: Without dead ends: 373 [2019-10-01 23:27:14,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4381 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4066, Invalid=13490, Unknown=0, NotChecked=0, Total=17556 [2019-10-01 23:27:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-10-01 23:27:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 362. [2019-10-01 23:27:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-01 23:27:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 437 transitions. [2019-10-01 23:27:14,748 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 437 transitions. Word has length 235 [2019-10-01 23:27:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:14,748 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 437 transitions. [2019-10-01 23:27:14,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 23:27:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 437 transitions. [2019-10-01 23:27:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-01 23:27:14,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:14,751 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:14,751 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash 49052026, now seen corresponding path program 13 times [2019-10-01 23:27:14,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:14,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:14,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 10 proven. 1369 refuted. 0 times theorem prover too weak. 2125 trivial. 0 not checked. [2019-10-01 23:27:15,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:15,457 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:15,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:15,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:27:15,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-10-01 23:27:15,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:15,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:27:15,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:27:15,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:27:15,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:27:15,686 INFO L87 Difference]: Start difference. First operand 362 states and 437 transitions. Second operand 41 states. [2019-10-01 23:27:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:16,083 INFO L93 Difference]: Finished difference Result 656 states and 812 transitions. [2019-10-01 23:27:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:27:16,083 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 240 [2019-10-01 23:27:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:16,085 INFO L225 Difference]: With dead ends: 656 [2019-10-01 23:27:16,085 INFO L226 Difference]: Without dead ends: 375 [2019-10-01 23:27:16,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:27:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-01 23:27:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 370. [2019-10-01 23:27:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-01 23:27:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 447 transitions. [2019-10-01 23:27:16,115 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 447 transitions. Word has length 240 [2019-10-01 23:27:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:16,115 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 447 transitions. [2019-10-01 23:27:16,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:27:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 447 transitions. [2019-10-01 23:27:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-01 23:27:16,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:16,117 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:16,118 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash -869063118, now seen corresponding path program 14 times [2019-10-01 23:27:16,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:16,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:16,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:16,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:16,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3691 backedges. 10 proven. 1444 refuted. 0 times theorem prover too weak. 2237 trivial. 0 not checked. [2019-10-01 23:27:16,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:16,845 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:16,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:27:17,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:27:17,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:17,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:27:17,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3691 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:27:17,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:27:17,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:27:17,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:27:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:27:17,076 INFO L87 Difference]: Start difference. First operand 370 states and 447 transitions. Second operand 42 states. [2019-10-01 23:27:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:17,501 INFO L93 Difference]: Finished difference Result 670 states and 830 transitions. [2019-10-01 23:27:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:27:17,502 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 245 [2019-10-01 23:27:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:17,503 INFO L225 Difference]: With dead ends: 670 [2019-10-01 23:27:17,503 INFO L226 Difference]: Without dead ends: 383 [2019-10-01 23:27:17,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:27:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-01 23:27:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 378. [2019-10-01 23:27:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-10-01 23:27:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 457 transitions. [2019-10-01 23:27:17,533 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 457 transitions. Word has length 245 [2019-10-01 23:27:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:17,533 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 457 transitions. [2019-10-01 23:27:17,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:27:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 457 transitions. [2019-10-01 23:27:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 23:27:17,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:17,535 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:17,536 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1657477634, now seen corresponding path program 15 times [2019-10-01 23:27:17,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:17,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 10 proven. 1521 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-10-01 23:27:18,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:18,527 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:18,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:27:18,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 23:27:18,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:18,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:27:18,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:20,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:20,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:27:20,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:20,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:20,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:20,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:20,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:27:20,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 110 proven. 672 refuted. 0 times theorem prover too weak. 3101 trivial. 0 not checked. [2019-10-01 23:27:20,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:20,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 25] total 65 [2019-10-01 23:27:20,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 23:27:20,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 23:27:20,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1171, Invalid=2989, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:27:20,332 INFO L87 Difference]: Start difference. First operand 378 states and 457 transitions. Second operand 65 states. [2019-10-01 23:27:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:30,879 INFO L93 Difference]: Finished difference Result 724 states and 884 transitions. [2019-10-01 23:27:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2019-10-01 23:27:30,880 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 250 [2019-10-01 23:27:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:30,882 INFO L225 Difference]: With dead ends: 724 [2019-10-01 23:27:30,882 INFO L226 Difference]: Without dead ends: 431 [2019-10-01 23:27:30,885 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 219 SyntacticMatches, 9 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21481 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13399, Invalid=44441, Unknown=0, NotChecked=0, Total=57840 [2019-10-01 23:27:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-01 23:27:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 266. [2019-10-01 23:27:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-01 23:27:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2019-10-01 23:27:30,907 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 250 [2019-10-01 23:27:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:30,907 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2019-10-01 23:27:30,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 23:27:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2019-10-01 23:27:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-01 23:27:30,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:30,909 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:30,909 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash -504535577, now seen corresponding path program 19 times [2019-10-01 23:27:30,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:30,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4124 backedges. 12 proven. 1600 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2019-10-01 23:27:31,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:31,652 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:31,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:27:31,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4124 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2524 trivial. 0 not checked. [2019-10-01 23:27:31,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:31,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 23:27:31,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:27:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:27:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:27:31,962 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand 44 states. [2019-10-01 23:27:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:32,380 INFO L93 Difference]: Finished difference Result 453 states and 540 transitions. [2019-10-01 23:27:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:27:32,381 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 263 [2019-10-01 23:27:32,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:32,382 INFO L225 Difference]: With dead ends: 453 [2019-10-01 23:27:32,382 INFO L226 Difference]: Without dead ends: 274 [2019-10-01 23:27:32,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:27:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-01 23:27:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-10-01 23:27:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-01 23:27:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 314 transitions. [2019-10-01 23:27:32,407 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 314 transitions. Word has length 263 [2019-10-01 23:27:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:32,407 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 314 transitions. [2019-10-01 23:27:32,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:27:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 314 transitions. [2019-10-01 23:27:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 23:27:32,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:32,409 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:32,410 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2138390203, now seen corresponding path program 20 times [2019-10-01 23:27:32,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:32,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:32,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4326 backedges. 12 proven. 1681 refuted. 0 times theorem prover too weak. 2633 trivial. 0 not checked. [2019-10-01 23:27:33,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:33,190 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:33,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:27:33,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:27:33,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:33,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:27:33,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4326 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2019-10-01 23:27:33,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:33,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 23:27:33,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 23:27:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 23:27:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:27:33,459 INFO L87 Difference]: Start difference. First operand 271 states and 314 transitions. Second operand 45 states. [2019-10-01 23:27:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:33,920 INFO L93 Difference]: Finished difference Result 461 states and 550 transitions. [2019-10-01 23:27:33,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 23:27:33,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 268 [2019-10-01 23:27:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:33,923 INFO L225 Difference]: With dead ends: 461 [2019-10-01 23:27:33,923 INFO L226 Difference]: Without dead ends: 279 [2019-10-01 23:27:33,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:27:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-01 23:27:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-10-01 23:27:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-01 23:27:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 320 transitions. [2019-10-01 23:27:33,944 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 320 transitions. Word has length 268 [2019-10-01 23:27:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:33,944 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 320 transitions. [2019-10-01 23:27:33,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 23:27:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 320 transitions. [2019-10-01 23:27:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-01 23:27:33,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:33,946 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:33,947 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1418217827, now seen corresponding path program 21 times [2019-10-01 23:27:33,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:33,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:33,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4533 backedges. 12 proven. 1764 refuted. 0 times theorem prover too weak. 2757 trivial. 0 not checked. [2019-10-01 23:27:34,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:34,963 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:35,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:27:35,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-10-01 23:27:35,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:35,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 23:27:35,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:36,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:27:36,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:36,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:36,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:36,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:27:36,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4533 backedges. 26 proven. 843 refuted. 0 times theorem prover too weak. 3664 trivial. 0 not checked. [2019-10-01 23:27:36,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:36,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 24] total 67 [2019-10-01 23:27:36,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:27:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:27:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1338, Invalid=3084, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:27:36,927 INFO L87 Difference]: Start difference. First operand 276 states and 320 transitions. Second operand 67 states. [2019-10-01 23:27:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:41,762 INFO L93 Difference]: Finished difference Result 615 states and 752 transitions. [2019-10-01 23:27:41,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-01 23:27:41,762 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 273 [2019-10-01 23:27:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:41,764 INFO L225 Difference]: With dead ends: 615 [2019-10-01 23:27:41,764 INFO L226 Difference]: Without dead ends: 430 [2019-10-01 23:27:41,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5773 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5369, Invalid=17583, Unknown=0, NotChecked=0, Total=22952 [2019-10-01 23:27:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-01 23:27:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 419. [2019-10-01 23:27:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-01 23:27:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 506 transitions. [2019-10-01 23:27:41,801 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 506 transitions. Word has length 273 [2019-10-01 23:27:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:41,801 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 506 transitions. [2019-10-01 23:27:41,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:27:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 506 transitions. [2019-10-01 23:27:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 23:27:41,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:41,804 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:41,804 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:41,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1654987459, now seen corresponding path program 16 times [2019-10-01 23:27:41,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:41,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:41,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:41,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:41,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4745 backedges. 12 proven. 1849 refuted. 0 times theorem prover too weak. 2884 trivial. 0 not checked. [2019-10-01 23:27:42,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:42,656 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:42,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:27:42,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:27:42,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:42,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:27:42,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4745 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2896 trivial. 0 not checked. [2019-10-01 23:27:42,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:42,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 23:27:42,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 23:27:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 23:27:42,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:27:42,929 INFO L87 Difference]: Start difference. First operand 419 states and 506 transitions. Second operand 47 states. [2019-10-01 23:27:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:43,432 INFO L93 Difference]: Finished difference Result 758 states and 938 transitions. [2019-10-01 23:27:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 23:27:43,432 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 278 [2019-10-01 23:27:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:43,434 INFO L225 Difference]: With dead ends: 758 [2019-10-01 23:27:43,435 INFO L226 Difference]: Without dead ends: 432 [2019-10-01 23:27:43,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:27:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-10-01 23:27:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 427. [2019-10-01 23:27:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-01 23:27:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 516 transitions. [2019-10-01 23:27:43,480 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 516 transitions. Word has length 278 [2019-10-01 23:27:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:43,480 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 516 transitions. [2019-10-01 23:27:43,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 23:27:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 516 transitions. [2019-10-01 23:27:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-01 23:27:43,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:43,484 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:43,484 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1729441059, now seen corresponding path program 17 times [2019-10-01 23:27:43,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:43,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:43,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4962 backedges. 12 proven. 1936 refuted. 0 times theorem prover too weak. 3014 trivial. 0 not checked. [2019-10-01 23:27:44,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:44,528 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:27:50,028 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-10-01 23:27:50,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:50,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 23:27:50,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4962 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-10-01 23:27:50,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 23:27:50,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 23:27:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 23:27:50,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:27:50,155 INFO L87 Difference]: Start difference. First operand 427 states and 516 transitions. Second operand 48 states. [2019-10-01 23:27:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:50,540 INFO L93 Difference]: Finished difference Result 772 states and 956 transitions. [2019-10-01 23:27:50,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 23:27:50,541 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 283 [2019-10-01 23:27:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:50,542 INFO L225 Difference]: With dead ends: 772 [2019-10-01 23:27:50,542 INFO L226 Difference]: Without dead ends: 440 [2019-10-01 23:27:50,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:27:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-01 23:27:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2019-10-01 23:27:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-01 23:27:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 526 transitions. [2019-10-01 23:27:50,581 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 526 transitions. Word has length 283 [2019-10-01 23:27:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:50,582 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 526 transitions. [2019-10-01 23:27:50,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 23:27:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 526 transitions. [2019-10-01 23:27:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-01 23:27:50,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:50,584 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:50,584 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash -359201343, now seen corresponding path program 18 times [2019-10-01 23:27:50,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:50,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:50,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:50,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:50,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 12 proven. 2025 refuted. 0 times theorem prover too weak. 3147 trivial. 0 not checked. [2019-10-01 23:27:51,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:51,791 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:28:28,296 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-10-01 23:28:28,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:28,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 23:28:28,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:29,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:29,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:28:29,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:29,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:29,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:29,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:29,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:28:29,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 128 proven. 914 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2019-10-01 23:28:30,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:30,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 27] total 73 [2019-10-01 23:28:30,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 23:28:30,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 23:28:30,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1523, Invalid=3733, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 23:28:30,086 INFO L87 Difference]: Start difference. First operand 435 states and 526 transitions. Second operand 73 states. [2019-10-01 23:28:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:42,958 INFO L93 Difference]: Finished difference Result 830 states and 1013 transitions. [2019-10-01 23:28:42,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2019-10-01 23:28:42,962 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 288 [2019-10-01 23:28:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:42,964 INFO L225 Difference]: With dead ends: 830 [2019-10-01 23:28:42,964 INFO L226 Difference]: Without dead ends: 492 [2019-10-01 23:28:42,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 253 SyntacticMatches, 11 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28138 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17435, Invalid=57367, Unknown=0, NotChecked=0, Total=74802 [2019-10-01 23:28:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-01 23:28:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 304. [2019-10-01 23:28:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-01 23:28:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 352 transitions. [2019-10-01 23:28:42,992 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 352 transitions. Word has length 288 [2019-10-01 23:28:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:42,992 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 352 transitions. [2019-10-01 23:28:42,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 23:28:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 352 transitions. [2019-10-01 23:28:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-01 23:28:42,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:42,995 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:42,995 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 779616658, now seen corresponding path program 22 times [2019-10-01 23:28:42,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:42,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:42,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5463 backedges. 14 proven. 2116 refuted. 0 times theorem prover too weak. 3333 trivial. 0 not checked. [2019-10-01 23:28:43,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:43,966 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:44,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:28:44,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:28:44,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:44,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:28:44,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5463 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3347 trivial. 0 not checked. [2019-10-01 23:28:44,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:44,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 23:28:44,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 23:28:44,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 23:28:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:28:44,301 INFO L87 Difference]: Start difference. First operand 304 states and 352 transitions. Second operand 50 states. [2019-10-01 23:28:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:44,711 INFO L93 Difference]: Finished difference Result 517 states and 616 transitions. [2019-10-01 23:28:44,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:28:44,711 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 301 [2019-10-01 23:28:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:44,713 INFO L225 Difference]: With dead ends: 517 [2019-10-01 23:28:44,713 INFO L226 Difference]: Without dead ends: 312 [2019-10-01 23:28:44,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:28:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-10-01 23:28:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2019-10-01 23:28:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-01 23:28:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 358 transitions. [2019-10-01 23:28:44,738 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 358 transitions. Word has length 301 [2019-10-01 23:28:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:44,738 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 358 transitions. [2019-10-01 23:28:44,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 23:28:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 358 transitions. [2019-10-01 23:28:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 23:28:44,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:44,740 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:44,741 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 860634494, now seen corresponding path program 23 times [2019-10-01 23:28:44,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:44,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:44,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5695 backedges. 14 proven. 2209 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2019-10-01 23:28:45,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:45,915 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:46,045 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:29:00,006 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 23:29:00,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:29:00,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 23:29:00,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:29:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5695 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-10-01 23:29:00,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:29:00,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 23:29:00,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 23:29:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 23:29:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:29:00,100 INFO L87 Difference]: Start difference. First operand 309 states and 358 transitions. Second operand 51 states. [2019-10-01 23:29:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:29:00,578 INFO L93 Difference]: Finished difference Result 525 states and 626 transitions. [2019-10-01 23:29:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 23:29:00,579 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 306 [2019-10-01 23:29:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:29:00,580 INFO L225 Difference]: With dead ends: 525 [2019-10-01 23:29:00,581 INFO L226 Difference]: Without dead ends: 317 [2019-10-01 23:29:00,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:29:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-01 23:29:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2019-10-01 23:29:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-01 23:29:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 364 transitions. [2019-10-01 23:29:00,611 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 364 transitions. Word has length 306 [2019-10-01 23:29:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:29:00,612 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 364 transitions. [2019-10-01 23:29:00,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 23:29:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 364 transitions. [2019-10-01 23:29:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-01 23:29:00,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:29:00,614 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:29:00,614 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:29:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:29:00,615 INFO L82 PathProgramCache]: Analyzing trace with hash -11005682, now seen corresponding path program 24 times [2019-10-01 23:29:00,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:29:00,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:29:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:00,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:29:00,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:29:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 14 proven. 2304 refuted. 0 times theorem prover too weak. 3614 trivial. 0 not checked. [2019-10-01 23:29:01,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:29:01,863 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:29:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:30:06,309 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-10-01 23:30:06,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:06,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-01 23:30:06,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:06,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:30:06,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:06,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:06,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:06,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:30:06,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 31 proven. 1111 refuted. 0 times theorem prover too weak. 4790 trivial. 0 not checked. [2019-10-01 23:30:07,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:07,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 26] total 75 [2019-10-01 23:30:07,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 23:30:07,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 23:30:07,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=3836, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 23:30:07,184 INFO L87 Difference]: Start difference. First operand 314 states and 364 transitions. Second operand 75 states. [2019-10-01 23:30:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:12,500 INFO L93 Difference]: Finished difference Result 698 states and 853 transitions. [2019-10-01 23:30:12,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-10-01 23:30:12,501 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 311 [2019-10-01 23:30:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:12,503 INFO L225 Difference]: With dead ends: 698 [2019-10-01 23:30:12,503 INFO L226 Difference]: Without dead ends: 487 [2019-10-01 23:30:12,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7357 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6854, Invalid=22216, Unknown=0, NotChecked=0, Total=29070 [2019-10-01 23:30:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-01 23:30:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 476. [2019-10-01 23:30:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-01 23:30:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 575 transitions. [2019-10-01 23:30:12,551 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 575 transitions. Word has length 311 [2019-10-01 23:30:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:12,551 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 575 transitions. [2019-10-01 23:30:12,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 23:30:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 575 transitions. [2019-10-01 23:30:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-01 23:30:12,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:12,554 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:12,555 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash 431241728, now seen corresponding path program 19 times [2019-10-01 23:30:12,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:12,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:12,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 14 proven. 2401 refuted. 0 times theorem prover too weak. 3759 trivial. 0 not checked. [2019-10-01 23:30:13,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:13,865 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:13,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:30:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:14,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:30:14,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 3773 trivial. 0 not checked. [2019-10-01 23:30:14,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:14,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 23:30:14,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 23:30:14,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 23:30:14,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:30:14,225 INFO L87 Difference]: Start difference. First operand 476 states and 575 transitions. Second operand 53 states. [2019-10-01 23:30:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:14,769 INFO L93 Difference]: Finished difference Result 860 states and 1064 transitions. [2019-10-01 23:30:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 23:30:14,769 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 316 [2019-10-01 23:30:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:14,771 INFO L225 Difference]: With dead ends: 860 [2019-10-01 23:30:14,771 INFO L226 Difference]: Without dead ends: 489 [2019-10-01 23:30:14,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:30:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-10-01 23:30:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 484. [2019-10-01 23:30:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-01 23:30:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 585 transitions. [2019-10-01 23:30:14,805 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 585 transitions. Word has length 316 [2019-10-01 23:30:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:14,805 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 585 transitions. [2019-10-01 23:30:14,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 23:30:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 585 transitions. [2019-10-01 23:30:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-01 23:30:14,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:14,808 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:14,809 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:14,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash -839112568, now seen corresponding path program 20 times [2019-10-01 23:30:14,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:14,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:30:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6421 backedges. 14 proven. 2500 refuted. 0 times theorem prover too weak. 3907 trivial. 0 not checked. [2019-10-01 23:30:15,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:15,882 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:30:16,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:30:16,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:16,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 23:30:16,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6421 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 3921 trivial. 0 not checked. [2019-10-01 23:30:16,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:16,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 23:30:16,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 23:30:16,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 23:30:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:30:16,220 INFO L87 Difference]: Start difference. First operand 484 states and 585 transitions. Second operand 54 states. [2019-10-01 23:30:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:16,804 INFO L93 Difference]: Finished difference Result 874 states and 1082 transitions. [2019-10-01 23:30:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 23:30:16,805 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 321 [2019-10-01 23:30:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:16,806 INFO L225 Difference]: With dead ends: 874 [2019-10-01 23:30:16,807 INFO L226 Difference]: Without dead ends: 497 [2019-10-01 23:30:16,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:30:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-01 23:30:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 492. [2019-10-01 23:30:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-01 23:30:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 595 transitions. [2019-10-01 23:30:16,847 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 595 transitions. Word has length 321 [2019-10-01 23:30:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:16,848 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 595 transitions. [2019-10-01 23:30:16,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 23:30:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 595 transitions. [2019-10-01 23:30:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-01 23:30:16,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:16,851 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:16,851 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -808038780, now seen corresponding path program 21 times [2019-10-01 23:30:16,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:16,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:16,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:16,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6673 backedges. 14 proven. 2601 refuted. 0 times theorem prover too weak. 4058 trivial. 0 not checked. [2019-10-01 23:30:18,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:18,032 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:18,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:30:19,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-01 23:30:19,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:19,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:30:19,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:21,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:21,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:30:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:21,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:21,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:21,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:21,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:30:21,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6673 backedges. 146 proven. 1193 refuted. 0 times theorem prover too weak. 5334 trivial. 0 not checked. [2019-10-01 23:30:21,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 29] total 81 [2019-10-01 23:30:21,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 23:30:21,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 23:30:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=4558, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 23:30:21,399 INFO L87 Difference]: Start difference. First operand 492 states and 595 transitions. Second operand 81 states. [2019-10-01 23:30:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:35,962 INFO L93 Difference]: Finished difference Result 936 states and 1142 transitions. [2019-10-01 23:30:35,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2019-10-01 23:30:35,963 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 326 [2019-10-01 23:30:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:35,966 INFO L225 Difference]: With dead ends: 936 [2019-10-01 23:30:35,966 INFO L226 Difference]: Without dead ends: 553 [2019-10-01 23:30:35,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 287 SyntacticMatches, 13 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35693 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=22003, Invalid=71939, Unknown=0, NotChecked=0, Total=93942 [2019-10-01 23:30:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-01 23:30:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 342. [2019-10-01 23:30:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-10-01 23:30:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 396 transitions. [2019-10-01 23:30:35,991 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 396 transitions. Word has length 326 [2019-10-01 23:30:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:35,991 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 396 transitions. [2019-10-01 23:30:35,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 23:30:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 396 transitions. [2019-10-01 23:30:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-01 23:30:35,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:35,993 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:35,993 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1383269949, now seen corresponding path program 25 times [2019-10-01 23:30:35,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:35,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:35,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 16 proven. 2704 refuted. 0 times theorem prover too weak. 4270 trivial. 0 not checked. [2019-10-01 23:30:37,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:37,317 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:30:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:37,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:30:37,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 4286 trivial. 0 not checked. [2019-10-01 23:30:37,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:37,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 23:30:37,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 23:30:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 23:30:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:30:37,661 INFO L87 Difference]: Start difference. First operand 342 states and 396 transitions. Second operand 56 states. [2019-10-01 23:30:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:38,219 INFO L93 Difference]: Finished difference Result 581 states and 692 transitions. [2019-10-01 23:30:38,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 23:30:38,219 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 339 [2019-10-01 23:30:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:38,221 INFO L225 Difference]: With dead ends: 581 [2019-10-01 23:30:38,221 INFO L226 Difference]: Without dead ends: 350 [2019-10-01 23:30:38,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:30:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-10-01 23:30:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-10-01 23:30:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-01 23:30:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 402 transitions. [2019-10-01 23:30:38,241 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 402 transitions. Word has length 339 [2019-10-01 23:30:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:38,241 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 402 transitions. [2019-10-01 23:30:38,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 23:30:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 402 transitions. [2019-10-01 23:30:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-01 23:30:38,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:38,244 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:38,244 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash 842769729, now seen corresponding path program 26 times [2019-10-01 23:30:38,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:38,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:38,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:38,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:30:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 16 proven. 2809 refuted. 0 times theorem prover too weak. 4427 trivial. 0 not checked. [2019-10-01 23:30:39,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:39,500 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:39,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:30:39,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:30:39,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:39,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 23:30:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 4443 trivial. 0 not checked. [2019-10-01 23:30:39,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 23:30:39,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 23:30:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 23:30:39,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:30:39,953 INFO L87 Difference]: Start difference. First operand 347 states and 402 transitions. Second operand 57 states. [2019-10-01 23:30:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:40,514 INFO L93 Difference]: Finished difference Result 589 states and 702 transitions. [2019-10-01 23:30:40,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 23:30:40,514 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 344 [2019-10-01 23:30:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:40,516 INFO L225 Difference]: With dead ends: 589 [2019-10-01 23:30:40,516 INFO L226 Difference]: Without dead ends: 355 [2019-10-01 23:30:40,517 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:30:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-10-01 23:30:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-10-01 23:30:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-01 23:30:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 408 transitions. [2019-10-01 23:30:40,537 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 408 transitions. Word has length 344 [2019-10-01 23:30:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:40,537 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 408 transitions. [2019-10-01 23:30:40,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 23:30:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 408 transitions. [2019-10-01 23:30:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-01 23:30:40,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:40,540 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:40,540 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash -811204167, now seen corresponding path program 27 times [2019-10-01 23:30:40,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:40,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:40,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:40,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:40,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7519 backedges. 16 proven. 2916 refuted. 0 times theorem prover too weak. 4587 trivial. 0 not checked. [2019-10-01 23:30:42,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:42,263 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:30:45,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-10-01 23:30:45,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:45,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:30:45,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:46,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:30:46,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:46,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:46,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:46,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:30:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7519 backedges. 36 proven. 1416 refuted. 0 times theorem prover too weak. 6067 trivial. 0 not checked. [2019-10-01 23:30:46,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:46,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 28] total 83 [2019-10-01 23:30:46,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 23:30:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 23:30:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2137, Invalid=4669, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 23:30:46,738 INFO L87 Difference]: Start difference. First operand 352 states and 408 transitions. Second operand 83 states. [2019-10-01 23:30:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:53,384 INFO L93 Difference]: Finished difference Result 781 states and 954 transitions. [2019-10-01 23:30:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-10-01 23:30:53,384 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 349 [2019-10-01 23:30:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:53,387 INFO L225 Difference]: With dead ends: 781 [2019-10-01 23:30:53,388 INFO L226 Difference]: Without dead ends: 544 [2019-10-01 23:30:53,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9131 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8521, Invalid=27389, Unknown=0, NotChecked=0, Total=35910 [2019-10-01 23:30:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-01 23:30:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 533. [2019-10-01 23:30:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-01 23:30:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 644 transitions. [2019-10-01 23:30:53,426 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 644 transitions. Word has length 349 [2019-10-01 23:30:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:53,426 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 644 transitions. [2019-10-01 23:30:53,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 23:30:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 644 transitions. [2019-10-01 23:30:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-10-01 23:30:53,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:53,428 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:53,429 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:53,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1939224515, now seen corresponding path program 22 times [2019-10-01 23:30:53,429 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:53,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7791 backedges. 16 proven. 3025 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2019-10-01 23:30:54,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:54,822 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:54,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:30:55,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:30:55,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:55,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 23:30:55,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7791 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 4766 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:30:55,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:55,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 23:30:55,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 23:30:55,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 23:30:55,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:30:55,231 INFO L87 Difference]: Start difference. First operand 533 states and 644 transitions. Second operand 59 states. [2019-10-01 23:30:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:55,894 INFO L93 Difference]: Finished difference Result 962 states and 1190 transitions. [2019-10-01 23:30:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 23:30:55,895 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 354 [2019-10-01 23:30:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:55,897 INFO L225 Difference]: With dead ends: 962 [2019-10-01 23:30:55,897 INFO L226 Difference]: Without dead ends: 546 [2019-10-01 23:30:55,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:30:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-01 23:30:55,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 541. [2019-10-01 23:30:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-01 23:30:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 654 transitions. [2019-10-01 23:30:55,933 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 654 transitions. Word has length 354 [2019-10-01 23:30:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:55,933 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 654 transitions. [2019-10-01 23:30:55,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 23:30:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 654 transitions. [2019-10-01 23:30:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-10-01 23:30:55,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:55,935 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:55,936 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1244174541, now seen corresponding path program 23 times [2019-10-01 23:30:55,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:55,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:55,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8068 backedges. 16 proven. 3136 refuted. 0 times theorem prover too weak. 4916 trivial. 0 not checked. [2019-10-01 23:30:57,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:57,299 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:57,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:31:34,851 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-10-01 23:31:34,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:31:34,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 23:31:34,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8068 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 4932 trivial. 0 not checked. [2019-10-01 23:31:34,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:34,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 23:31:34,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 23:31:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 23:31:34,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:31:34,961 INFO L87 Difference]: Start difference. First operand 541 states and 654 transitions. Second operand 60 states. [2019-10-01 23:31:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:35,612 INFO L93 Difference]: Finished difference Result 976 states and 1208 transitions. [2019-10-01 23:31:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 23:31:35,613 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 359 [2019-10-01 23:31:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:35,615 INFO L225 Difference]: With dead ends: 976 [2019-10-01 23:31:35,615 INFO L226 Difference]: Without dead ends: 554 [2019-10-01 23:31:35,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:31:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-01 23:31:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 549. [2019-10-01 23:31:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-10-01 23:31:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 664 transitions. [2019-10-01 23:31:35,653 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 664 transitions. Word has length 359 [2019-10-01 23:31:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:35,653 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 664 transitions. [2019-10-01 23:31:35,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 23:31:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 664 transitions. [2019-10-01 23:31:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-01 23:31:35,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:35,655 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:35,655 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 399540295, now seen corresponding path program 24 times [2019-10-01 23:31:35,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:35,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:35,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:31:35,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8350 backedges. 16 proven. 3249 refuted. 0 times theorem prover too weak. 5085 trivial. 0 not checked. [2019-10-01 23:31:37,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:37,004 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:37,203 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:33:37,793 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2019-10-01 23:33:37,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:33:37,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 23:33:37,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:33:39,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:33:39,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:33:39,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:39,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:39,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:33:39,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:33:39,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:33:39,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8350 backedges. 164 proven. 1509 refuted. 0 times theorem prover too weak. 6677 trivial. 0 not checked. [2019-10-01 23:33:40,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:33:40,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 31] total 89 [2019-10-01 23:33:40,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 23:33:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 23:33:40,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2368, Invalid=5464, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 23:33:40,217 INFO L87 Difference]: Start difference. First operand 549 states and 664 transitions. Second operand 89 states. [2019-10-01 23:33:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:33:58,006 INFO L93 Difference]: Finished difference Result 1042 states and 1271 transitions. [2019-10-01 23:33:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2019-10-01 23:33:58,006 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 364 [2019-10-01 23:33:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:33:58,009 INFO L225 Difference]: With dead ends: 1042 [2019-10-01 23:33:58,009 INFO L226 Difference]: Without dead ends: 614 [2019-10-01 23:33:58,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 321 SyntacticMatches, 15 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44146 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=27103, Invalid=88157, Unknown=0, NotChecked=0, Total=115260 [2019-10-01 23:33:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-01 23:33:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 380. [2019-10-01 23:33:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-01 23:33:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 440 transitions. [2019-10-01 23:33:58,040 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 440 transitions. Word has length 364 [2019-10-01 23:33:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:33:58,040 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 440 transitions. [2019-10-01 23:33:58,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 23:33:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 440 transitions. [2019-10-01 23:33:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-01 23:33:58,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:33:58,042 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:33:58,042 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:33:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:33:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2093921256, now seen corresponding path program 28 times [2019-10-01 23:33:58,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:33:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:33:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:33:58,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:33:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:33:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:33:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8705 backedges. 18 proven. 3364 refuted. 0 times theorem prover too weak. 5323 trivial. 0 not checked. [2019-10-01 23:33:59,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:33:59,493 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:33:59,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:33:59,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:33:59,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:33:59,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 23:33:59,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:33:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8705 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 5341 trivial. 0 not checked. [2019-10-01 23:33:59,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:33:59,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 23:33:59,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 23:33:59,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 23:33:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 23:33:59,911 INFO L87 Difference]: Start difference. First operand 380 states and 440 transitions. Second operand 62 states. [2019-10-01 23:34:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:34:00,676 INFO L93 Difference]: Finished difference Result 645 states and 768 transitions. [2019-10-01 23:34:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 23:34:00,676 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 377 [2019-10-01 23:34:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:34:00,678 INFO L225 Difference]: With dead ends: 645 [2019-10-01 23:34:00,678 INFO L226 Difference]: Without dead ends: 388 [2019-10-01 23:34:00,679 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 23:34:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-10-01 23:34:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2019-10-01 23:34:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-10-01 23:34:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 446 transitions. [2019-10-01 23:34:00,702 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 446 transitions. Word has length 377 [2019-10-01 23:34:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:34:00,703 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 446 transitions. [2019-10-01 23:34:00,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 23:34:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 446 transitions. [2019-10-01 23:34:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-01 23:34:00,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:34:00,704 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:34:00,705 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:34:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:34:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1184970244, now seen corresponding path program 29 times [2019-10-01 23:34:00,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:34:00,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:34:00,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:00,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:34:00,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:34:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8997 backedges. 18 proven. 3481 refuted. 0 times theorem prover too weak. 5498 trivial. 0 not checked. [2019-10-01 23:34:02,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:34:02,182 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:34:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:35:04,098 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-10-01 23:35:04,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:35:04,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-01 23:35:04,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:35:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8997 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 3805 trivial. 0 not checked. [2019-10-01 23:35:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:35:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-10-01 23:35:04,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-01 23:35:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-01 23:35:04,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:35:04,327 INFO L87 Difference]: Start difference. First operand 385 states and 446 transitions. Second operand 63 states. [2019-10-01 23:35:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:35:04,837 INFO L93 Difference]: Finished difference Result 653 states and 778 transitions. [2019-10-01 23:35:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 23:35:04,837 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 382 [2019-10-01 23:35:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:35:04,839 INFO L225 Difference]: With dead ends: 653 [2019-10-01 23:35:04,839 INFO L226 Difference]: Without dead ends: 393 [2019-10-01 23:35:04,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:35:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-01 23:35:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2019-10-01 23:35:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-01 23:35:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 452 transitions. [2019-10-01 23:35:04,863 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 452 transitions. Word has length 382 [2019-10-01 23:35:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:35:04,863 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 452 transitions. [2019-10-01 23:35:04,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-01 23:35:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 452 transitions. [2019-10-01 23:35:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-10-01 23:35:04,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:35:04,865 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:35:04,865 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:35:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:35:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash -484287644, now seen corresponding path program 30 times [2019-10-01 23:35:04,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:35:04,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:35:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:04,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:35:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:35:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9294 backedges. 18 proven. 3600 refuted. 0 times theorem prover too weak. 5676 trivial. 0 not checked. [2019-10-01 23:35:06,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:35:06,421 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:35:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:36:12,804 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2019-10-01 23:36:12,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:36:12,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 23:36:12,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:13,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:36:13,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:36:13,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:36:13,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:36:13,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:36:13,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:36:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9294 backedges. 41 proven. 1758 refuted. 0 times theorem prover too weak. 7495 trivial. 0 not checked. [2019-10-01 23:36:14,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:14,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 30] total 91 [2019-10-01 23:36:14,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-01 23:36:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-01 23:36:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2607, Invalid=5583, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 23:36:14,297 INFO L87 Difference]: Start difference. First operand 390 states and 452 transitions. Second operand 91 states. [2019-10-01 23:36:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:22,795 INFO L93 Difference]: Finished difference Result 864 states and 1055 transitions. [2019-10-01 23:36:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-10-01 23:36:22,795 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 387 [2019-10-01 23:36:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:22,798 INFO L225 Difference]: With dead ends: 864 [2019-10-01 23:36:22,798 INFO L226 Difference]: Without dead ends: 601 [2019-10-01 23:36:22,800 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11096 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10370, Invalid=33102, Unknown=0, NotChecked=0, Total=43472 [2019-10-01 23:36:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-01 23:36:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 590. [2019-10-01 23:36:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-01 23:36:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 713 transitions. [2019-10-01 23:36:22,847 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 713 transitions. Word has length 387 [2019-10-01 23:36:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:22,847 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 713 transitions. [2019-10-01 23:36:22,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-01 23:36:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 713 transitions. [2019-10-01 23:36:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-01 23:36:22,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:22,849 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:22,849 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:22,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1096900986, now seen corresponding path program 25 times [2019-10-01 23:36:22,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:22,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:22,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:22,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:36:22,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9596 backedges. 18 proven. 3721 refuted. 0 times theorem prover too weak. 5857 trivial. 0 not checked. [2019-10-01 23:36:24,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:24,425 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:24,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:36:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:24,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 23:36:24,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9596 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 5875 trivial. 0 not checked. [2019-10-01 23:36:24,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:24,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-10-01 23:36:24,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 23:36:24,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 23:36:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:36:24,857 INFO L87 Difference]: Start difference. First operand 590 states and 713 transitions. Second operand 65 states. [2019-10-01 23:36:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:25,631 INFO L93 Difference]: Finished difference Result 1064 states and 1316 transitions. [2019-10-01 23:36:25,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 23:36:25,632 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 392 [2019-10-01 23:36:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:25,634 INFO L225 Difference]: With dead ends: 1064 [2019-10-01 23:36:25,634 INFO L226 Difference]: Without dead ends: 603 [2019-10-01 23:36:25,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:36:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-01 23:36:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2019-10-01 23:36:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-01 23:36:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 723 transitions. [2019-10-01 23:36:25,678 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 723 transitions. Word has length 392 [2019-10-01 23:36:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:25,679 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 723 transitions. [2019-10-01 23:36:25,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 23:36:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 723 transitions. [2019-10-01 23:36:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-10-01 23:36:25,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:25,682 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:25,682 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 317509342, now seen corresponding path program 26 times [2019-10-01 23:36:25,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:25,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:25,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:25,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:36:25,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9903 backedges. 18 proven. 3844 refuted. 0 times theorem prover too weak. 6041 trivial. 0 not checked. [2019-10-01 23:36:27,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:27,342 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:36:27,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:36:27,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:36:27,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-01 23:36:27,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9903 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 6059 trivial. 0 not checked. [2019-10-01 23:36:27,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:27,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-10-01 23:36:27,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 23:36:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 23:36:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 23:36:27,796 INFO L87 Difference]: Start difference. First operand 598 states and 723 transitions. Second operand 66 states. [2019-10-01 23:36:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:28,608 INFO L93 Difference]: Finished difference Result 1078 states and 1334 transitions. [2019-10-01 23:36:28,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 23:36:28,608 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 397 [2019-10-01 23:36:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:28,610 INFO L225 Difference]: With dead ends: 1078 [2019-10-01 23:36:28,610 INFO L226 Difference]: Without dead ends: 611 [2019-10-01 23:36:28,611 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 23:36:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-01 23:36:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 606. [2019-10-01 23:36:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-01 23:36:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 733 transitions. [2019-10-01 23:36:28,655 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 733 transitions. Word has length 397 [2019-10-01 23:36:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:28,655 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 733 transitions. [2019-10-01 23:36:28,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 23:36:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 733 transitions. [2019-10-01 23:36:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-10-01 23:36:28,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:28,658 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:28,658 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1768119050, now seen corresponding path program 27 times [2019-10-01 23:36:28,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:28,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:28,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:36:28,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10215 backedges. 18 proven. 3969 refuted. 0 times theorem prover too weak. 6228 trivial. 0 not checked. [2019-10-01 23:36:30,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:30,298 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:30,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:36:36,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-10-01 23:36:36,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:36:36,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 23:36:36,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:38,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:36:38,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-10-01 23:36:38,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:36:38,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:36:38,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:36:38,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:36:38,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 23:36:38,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:36:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10215 backedges. 182 proven. 1862 refuted. 0 times theorem prover too weak. 8171 trivial. 0 not checked. [2019-10-01 23:36:38,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 33] total 97 [2019-10-01 23:36:38,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-01 23:36:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-01 23:36:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=6451, Unknown=0, NotChecked=0, Total=9312 [2019-10-01 23:36:38,892 INFO L87 Difference]: Start difference. First operand 606 states and 733 transitions. Second operand 97 states. [2019-10-01 23:37:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:00,034 INFO L93 Difference]: Finished difference Result 1148 states and 1400 transitions. [2019-10-01 23:37:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 304 states. [2019-10-01 23:37:00,035 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 402 [2019-10-01 23:37:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:00,038 INFO L225 Difference]: With dead ends: 1148 [2019-10-01 23:37:00,038 INFO L226 Difference]: Without dead ends: 675 [2019-10-01 23:37:00,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 355 SyntacticMatches, 17 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53497 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=32735, Invalid=106021, Unknown=0, NotChecked=0, Total=138756 [2019-10-01 23:37:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-10-01 23:37:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 418. [2019-10-01 23:37:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-01 23:37:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 484 transitions. [2019-10-01 23:37:00,118 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 484 transitions. Word has length 402 [2019-10-01 23:37:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:00,118 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 484 transitions. [2019-10-01 23:37:00,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-01 23:37:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 484 transitions. [2019-10-01 23:37:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-10-01 23:37:00,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:00,120 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:00,120 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:00,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1870968173, now seen corresponding path program 31 times [2019-10-01 23:37:00,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:00,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:00,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:37:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 20 proven. 4096 refuted. 0 times theorem prover too weak. 6492 trivial. 0 not checked. [2019-10-01 23:37:01,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:01,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:02,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:37:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:02,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 23:37:02,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:37:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 6512 trivial. 0 not checked. [2019-10-01 23:37:02,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:37:02,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 23:37:02,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 23:37:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 23:37:02,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:37:02,396 INFO L87 Difference]: Start difference. First operand 418 states and 484 transitions. Second operand 68 states. [2019-10-01 23:37:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:03,097 INFO L93 Difference]: Finished difference Result 709 states and 844 transitions. [2019-10-01 23:37:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:37:03,097 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 415 [2019-10-01 23:37:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:03,099 INFO L225 Difference]: With dead ends: 709 [2019-10-01 23:37:03,099 INFO L226 Difference]: Without dead ends: 426 [2019-10-01 23:37:03,100 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:37:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-01 23:37:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2019-10-01 23:37:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-01 23:37:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 490 transitions. [2019-10-01 23:37:03,126 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 490 transitions. Word has length 415 [2019-10-01 23:37:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:03,126 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 490 transitions. [2019-10-01 23:37:03,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 23:37:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 490 transitions. [2019-10-01 23:37:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-10-01 23:37:03,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:03,128 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:03,128 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash -623202361, now seen corresponding path program 32 times [2019-10-01 23:37:03,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:03,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:03,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:03,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:37:03,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10930 backedges. 20 proven. 4225 refuted. 0 times theorem prover too weak. 6685 trivial. 0 not checked. [2019-10-01 23:37:04,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:04,915 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:37:05,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:37:05,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:37:05,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-01 23:37:05,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:37:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10930 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 6705 trivial. 0 not checked. [2019-10-01 23:37:05,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:37:05,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 69 [2019-10-01 23:37:05,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 23:37:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 23:37:05,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 23:37:05,386 INFO L87 Difference]: Start difference. First operand 423 states and 490 transitions. Second operand 69 states. [2019-10-01 23:37:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:06,187 INFO L93 Difference]: Finished difference Result 717 states and 854 transitions. [2019-10-01 23:37:06,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-01 23:37:06,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 420 [2019-10-01 23:37:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:06,189 INFO L225 Difference]: With dead ends: 717 [2019-10-01 23:37:06,189 INFO L226 Difference]: Without dead ends: 431 [2019-10-01 23:37:06,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 23:37:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-01 23:37:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2019-10-01 23:37:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-01 23:37:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 496 transitions. [2019-10-01 23:37:06,217 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 496 transitions. Word has length 420 [2019-10-01 23:37:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:06,217 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 496 transitions. [2019-10-01 23:37:06,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 23:37:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 496 transitions. [2019-10-01 23:37:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-10-01 23:37:06,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:06,219 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:06,219 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1199398415, now seen corresponding path program 33 times [2019-10-01 23:37:06,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:06,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:06,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:06,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:37:06,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11257 backedges. 20 proven. 4356 refuted. 0 times theorem prover too weak. 6881 trivial. 0 not checked. [2019-10-01 23:37:08,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:08,064 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:08,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:37:15,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-10-01 23:37:15,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:37:15,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 23:37:15,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:37:16,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:37:16,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:37:16,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:37:16,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:37:16,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:37:16,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:37:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11257 backedges. 46 proven. 2137 refuted. 0 times theorem prover too weak. 9074 trivial. 0 not checked. [2019-10-01 23:37:17,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:37:17,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 32] total 99 [2019-10-01 23:37:17,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-01 23:37:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-01 23:37:17,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3124, Invalid=6578, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 23:37:17,113 INFO L87 Difference]: Start difference. First operand 428 states and 496 transitions. Second operand 99 states. [2019-10-01 23:37:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:26,562 INFO L93 Difference]: Finished difference Result 947 states and 1156 transitions. [2019-10-01 23:37:26,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-10-01 23:37:26,562 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 425 [2019-10-01 23:37:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:26,565 INFO L225 Difference]: With dead ends: 947 [2019-10-01 23:37:26,565 INFO L226 Difference]: Without dead ends: 658 [2019-10-01 23:37:26,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13252 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12401, Invalid=39355, Unknown=0, NotChecked=0, Total=51756 [2019-10-01 23:37:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-01 23:37:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 647. [2019-10-01 23:37:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-01 23:37:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 782 transitions. [2019-10-01 23:37:26,617 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 782 transitions. Word has length 425 [2019-10-01 23:37:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:26,617 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 782 transitions. [2019-10-01 23:37:26,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-01 23:37:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 782 transitions. [2019-10-01 23:37:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-10-01 23:37:26,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:26,619 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 66, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:26,620 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:26,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1919626825, now seen corresponding path program 28 times [2019-10-01 23:37:26,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:26,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:26,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:26,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:37:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11589 backedges. 20 proven. 4489 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-10-01 23:37:28,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:28,418 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:37:28,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:37:28,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:37:28,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-01 23:37:28,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:37:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11589 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 7100 trivial. 0 not checked. [2019-10-01 23:37:28,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:37:28,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 71 [2019-10-01 23:37:28,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-01 23:37:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-01 23:37:28,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 23:37:28,946 INFO L87 Difference]: Start difference. First operand 647 states and 782 transitions. Second operand 71 states. [2019-10-01 23:37:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:29,832 INFO L93 Difference]: Finished difference Result 1166 states and 1442 transitions. [2019-10-01 23:37:29,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 23:37:29,833 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 430 [2019-10-01 23:37:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:29,835 INFO L225 Difference]: With dead ends: 1166 [2019-10-01 23:37:29,835 INFO L226 Difference]: Without dead ends: 660 [2019-10-01 23:37:29,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 23:37:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-01 23:37:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 655. [2019-10-01 23:37:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-01 23:37:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 792 transitions. [2019-10-01 23:37:29,886 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 792 transitions. Word has length 430 [2019-10-01 23:37:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:29,886 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 792 transitions. [2019-10-01 23:37:29,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-01 23:37:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 792 transitions. [2019-10-01 23:37:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-10-01 23:37:29,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:29,889 INFO L411 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 67, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:29,889 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash -743661687, now seen corresponding path program 29 times [2019-10-01 23:37:29,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:29,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:29,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:29,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:37:29,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 20 proven. 4624 refuted. 0 times theorem prover too weak. 7282 trivial. 0 not checked. [2019-10-01 23:37:31,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:31,859 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:32,104 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:38:37,337 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 69 check-sat command(s) [2019-10-01 23:38:37,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:38:37,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-01 23:38:37,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:38:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 7302 trivial. 0 not checked. [2019-10-01 23:38:37,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:38:37,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 72 [2019-10-01 23:38:37,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-01 23:38:37,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-01 23:38:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 23:38:37,509 INFO L87 Difference]: Start difference. First operand 655 states and 792 transitions. Second operand 72 states. [2019-10-01 23:38:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:38:38,671 INFO L93 Difference]: Finished difference Result 1180 states and 1460 transitions. [2019-10-01 23:38:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-01 23:38:38,672 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 435 [2019-10-01 23:38:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:38:38,674 INFO L225 Difference]: With dead ends: 1180 [2019-10-01 23:38:38,674 INFO L226 Difference]: Without dead ends: 668 [2019-10-01 23:38:38,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 23:38:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-10-01 23:38:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 663. [2019-10-01 23:38:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-01 23:38:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 802 transitions. [2019-10-01 23:38:38,727 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 802 transitions. Word has length 435 [2019-10-01 23:38:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:38:38,727 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 802 transitions. [2019-10-01 23:38:38,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-01 23:38:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 802 transitions. [2019-10-01 23:38:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-10-01 23:38:38,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:38:38,729 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 68, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:38:38,730 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:38:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:38:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1821598003, now seen corresponding path program 30 times [2019-10-01 23:38:38,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:38:38,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:38:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:38,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:38:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:38:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12268 backedges. 20 proven. 4761 refuted. 0 times theorem prover too weak. 7487 trivial. 0 not checked. [2019-10-01 23:38:40,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:38:40,745 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:38:40,994 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE